/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:03:24,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:03:24,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:03:24,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:03:24,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:03:24,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:03:24,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:03:24,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:03:24,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:03:24,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:03:24,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:03:24,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:03:24,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:03:24,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:03:24,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:03:24,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:03:24,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:03:24,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:03:24,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:03:24,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:03:24,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:03:24,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:03:24,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:03:24,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:03:24,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:03:24,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:03:24,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:03:24,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:03:24,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:03:24,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:03:24,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:03:24,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:03:24,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:03:24,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:03:24,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:03:24,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:03:24,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:03:24,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:03:24,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:03:24,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:03:24,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:03:24,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:03:24,126 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:03:24,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:03:24,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:03:24,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:03:24,127 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:03:24,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:03:24,128 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:03:24,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:03:24,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:03:24,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:03:24,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:03:24,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:03:24,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:03:24,129 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:03:24,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:03:24,130 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:03:24,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:03:24,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:03:24,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:03:24,131 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:03:24,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:03:24,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:03:24,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:03:24,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:03:24,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:03:24,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:03:24,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:03:24,132 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:03:24,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:03:24,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:03:24,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:03:24,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:03:24,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:03:24,429 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:03:24,430 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:03:24,431 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i [2019-12-27 07:03:24,501 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60337e957/a838861e0c0e43948ccd91858d6f5eab/FLAG0806977af [2019-12-27 07:03:25,082 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:03:25,083 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i [2019-12-27 07:03:25,098 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60337e957/a838861e0c0e43948ccd91858d6f5eab/FLAG0806977af [2019-12-27 07:03:25,337 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60337e957/a838861e0c0e43948ccd91858d6f5eab [2019-12-27 07:03:25,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:03:25,346 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:03:25,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:03:25,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:03:25,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:03:25,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:03:25" (1/1) ... [2019-12-27 07:03:25,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad6db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:25, skipping insertion in model container [2019-12-27 07:03:25,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:03:25" (1/1) ... [2019-12-27 07:03:25,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:03:25,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:03:25,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:03:25,908 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:03:25,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:03:26,069 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:03:26,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:26 WrapperNode [2019-12-27 07:03:26,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:03:26,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:03:26,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:03:26,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:03:26,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:26" (1/1) ... [2019-12-27 07:03:26,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:26" (1/1) ... [2019-12-27 07:03:26,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:03:26,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:03:26,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:03:26,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:03:26,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:26" (1/1) ... [2019-12-27 07:03:26,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:26" (1/1) ... [2019-12-27 07:03:26,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:26" (1/1) ... [2019-12-27 07:03:26,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:26" (1/1) ... [2019-12-27 07:03:26,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:26" (1/1) ... [2019-12-27 07:03:26,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:26" (1/1) ... [2019-12-27 07:03:26,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:26" (1/1) ... [2019-12-27 07:03:26,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:03:26,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:03:26,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:03:26,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:03:26,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:03:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:03:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:03:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:03:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:03:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:03:26,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:03:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:03:26,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:03:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:03:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:03:26,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:03:26,270 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:03:27,044 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:03:27,044 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:03:27,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:03:27 BoogieIcfgContainer [2019-12-27 07:03:27,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:03:27,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:03:27,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:03:27,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:03:27,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:03:25" (1/3) ... [2019-12-27 07:03:27,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650aeda0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:03:27, skipping insertion in model container [2019-12-27 07:03:27,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:26" (2/3) ... [2019-12-27 07:03:27,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650aeda0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:03:27, skipping insertion in model container [2019-12-27 07:03:27,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:03:27" (3/3) ... [2019-12-27 07:03:27,054 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_rmo.opt.i [2019-12-27 07:03:27,065 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:03:27,065 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:03:27,073 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:03:27,074 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:03:27,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,109 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,110 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,119 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,119 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,119 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,119 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,120 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,133 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,133 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,136 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,136 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,137 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:27,155 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:03:27,175 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:03:27,176 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:03:27,176 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:03:27,176 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:03:27,176 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:03:27,176 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:03:27,176 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:03:27,177 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:03:27,193 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 07:03:27,195 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 07:03:27,327 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 07:03:27,327 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:03:27,343 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:03:27,358 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 07:03:27,444 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 07:03:27,444 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:03:27,449 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:03:27,461 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 07:03:27,463 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:03:30,298 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 07:03:30,462 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 07:03:30,481 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51265 [2019-12-27 07:03:30,481 INFO L214 etLargeBlockEncoding]: Total number of compositions: 96 [2019-12-27 07:03:30,485 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 07:03:30,963 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9480 states. [2019-12-27 07:03:30,965 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states. [2019-12-27 07:03:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:03:30,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:30,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:03:30,973 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:30,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash 691080428, now seen corresponding path program 1 times [2019-12-27 07:03:30,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:30,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85678604] [2019-12-27 07:03:30,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:31,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85678604] [2019-12-27 07:03:31,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:31,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:03:31,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769539643] [2019-12-27 07:03:31,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:31,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:31,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:31,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:31,293 INFO L87 Difference]: Start difference. First operand 9480 states. Second operand 3 states. [2019-12-27 07:03:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:31,610 INFO L93 Difference]: Finished difference Result 9416 states and 31128 transitions. [2019-12-27 07:03:31,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:31,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:03:31,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:31,747 INFO L225 Difference]: With dead ends: 9416 [2019-12-27 07:03:31,748 INFO L226 Difference]: Without dead ends: 9234 [2019-12-27 07:03:31,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9234 states. [2019-12-27 07:03:32,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9234 to 9234. [2019-12-27 07:03:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-27 07:03:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 30568 transitions. [2019-12-27 07:03:32,287 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 30568 transitions. Word has length 5 [2019-12-27 07:03:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:32,287 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 30568 transitions. [2019-12-27 07:03:32,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 30568 transitions. [2019-12-27 07:03:32,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:03:32,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:32,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:32,291 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:32,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:32,291 INFO L82 PathProgramCache]: Analyzing trace with hash -530442671, now seen corresponding path program 1 times [2019-12-27 07:03:32,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:32,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710233494] [2019-12-27 07:03:32,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:32,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710233494] [2019-12-27 07:03:32,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:32,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:03:32,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284081205] [2019-12-27 07:03:32,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:03:32,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:32,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:03:32,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:03:32,487 INFO L87 Difference]: Start difference. First operand 9234 states and 30568 transitions. Second operand 4 states. [2019-12-27 07:03:32,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:32,895 INFO L93 Difference]: Finished difference Result 14362 states and 45554 transitions. [2019-12-27 07:03:32,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:03:32,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:03:32,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:33,664 INFO L225 Difference]: With dead ends: 14362 [2019-12-27 07:03:33,665 INFO L226 Difference]: Without dead ends: 14355 [2019-12-27 07:03:33,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:03:33,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14355 states. [2019-12-27 07:03:34,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14355 to 13038. [2019-12-27 07:03:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2019-12-27 07:03:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41962 transitions. [2019-12-27 07:03:34,157 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41962 transitions. Word has length 11 [2019-12-27 07:03:34,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:34,158 INFO L462 AbstractCegarLoop]: Abstraction has 13038 states and 41962 transitions. [2019-12-27 07:03:34,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:03:34,158 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41962 transitions. [2019-12-27 07:03:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:03:34,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:34,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:34,166 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:34,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:34,168 INFO L82 PathProgramCache]: Analyzing trace with hash -963171175, now seen corresponding path program 1 times [2019-12-27 07:03:34,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:34,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80752326] [2019-12-27 07:03:34,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:34,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80752326] [2019-12-27 07:03:34,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:34,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:03:34,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610892707] [2019-12-27 07:03:34,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:34,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:34,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:34,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:34,221 INFO L87 Difference]: Start difference. First operand 13038 states and 41962 transitions. Second operand 3 states. [2019-12-27 07:03:34,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:34,240 INFO L93 Difference]: Finished difference Result 1778 states and 4038 transitions. [2019-12-27 07:03:34,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:34,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 07:03:34,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:34,245 INFO L225 Difference]: With dead ends: 1778 [2019-12-27 07:03:34,246 INFO L226 Difference]: Without dead ends: 1778 [2019-12-27 07:03:34,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-12-27 07:03:34,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1778. [2019-12-27 07:03:34,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-12-27 07:03:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4038 transitions. [2019-12-27 07:03:34,289 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4038 transitions. Word has length 11 [2019-12-27 07:03:34,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:34,289 INFO L462 AbstractCegarLoop]: Abstraction has 1778 states and 4038 transitions. [2019-12-27 07:03:34,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4038 transitions. [2019-12-27 07:03:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 07:03:34,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:34,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:34,292 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:34,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:34,292 INFO L82 PathProgramCache]: Analyzing trace with hash 966140781, now seen corresponding path program 1 times [2019-12-27 07:03:34,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:34,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220558902] [2019-12-27 07:03:34,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:34,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220558902] [2019-12-27 07:03:34,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:34,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:34,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856075573] [2019-12-27 07:03:34,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:03:34,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:34,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:03:34,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:03:34,397 INFO L87 Difference]: Start difference. First operand 1778 states and 4038 transitions. Second operand 4 states. [2019-12-27 07:03:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:34,410 INFO L93 Difference]: Finished difference Result 371 states and 689 transitions. [2019-12-27 07:03:34,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:03:34,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 07:03:34,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:34,412 INFO L225 Difference]: With dead ends: 371 [2019-12-27 07:03:34,412 INFO L226 Difference]: Without dead ends: 371 [2019-12-27 07:03:34,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:03:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-27 07:03:34,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 336. [2019-12-27 07:03:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-27 07:03:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 624 transitions. [2019-12-27 07:03:34,420 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 624 transitions. Word has length 23 [2019-12-27 07:03:34,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:34,421 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 624 transitions. [2019-12-27 07:03:34,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:03:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 624 transitions. [2019-12-27 07:03:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:03:34,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:34,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:34,423 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:34,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:34,424 INFO L82 PathProgramCache]: Analyzing trace with hash -813009935, now seen corresponding path program 1 times [2019-12-27 07:03:34,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:34,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669878395] [2019-12-27 07:03:34,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:34,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669878395] [2019-12-27 07:03:34,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:34,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:34,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740863712] [2019-12-27 07:03:34,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:34,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:34,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:34,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:34,537 INFO L87 Difference]: Start difference. First operand 336 states and 624 transitions. Second operand 3 states. [2019-12-27 07:03:34,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:34,585 INFO L93 Difference]: Finished difference Result 345 states and 638 transitions. [2019-12-27 07:03:34,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:34,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:03:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:34,587 INFO L225 Difference]: With dead ends: 345 [2019-12-27 07:03:34,587 INFO L226 Difference]: Without dead ends: 345 [2019-12-27 07:03:34,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-27 07:03:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-27 07:03:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-27 07:03:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 634 transitions. [2019-12-27 07:03:34,595 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 634 transitions. Word has length 52 [2019-12-27 07:03:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:34,595 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 634 transitions. [2019-12-27 07:03:34,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 634 transitions. [2019-12-27 07:03:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:03:34,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:34,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:34,598 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:34,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:34,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1499321922, now seen corresponding path program 1 times [2019-12-27 07:03:34,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:34,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396162281] [2019-12-27 07:03:34,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:34,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396162281] [2019-12-27 07:03:34,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:34,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:34,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662040904] [2019-12-27 07:03:34,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:34,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:34,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:34,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:34,698 INFO L87 Difference]: Start difference. First operand 341 states and 634 transitions. Second operand 3 states. [2019-12-27 07:03:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:34,745 INFO L93 Difference]: Finished difference Result 345 states and 628 transitions. [2019-12-27 07:03:34,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:34,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:03:34,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:34,748 INFO L225 Difference]: With dead ends: 345 [2019-12-27 07:03:34,748 INFO L226 Difference]: Without dead ends: 345 [2019-12-27 07:03:34,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-27 07:03:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-27 07:03:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-27 07:03:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 624 transitions. [2019-12-27 07:03:34,755 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 624 transitions. Word has length 52 [2019-12-27 07:03:34,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:34,756 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 624 transitions. [2019-12-27 07:03:34,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 624 transitions. [2019-12-27 07:03:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:03:34,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:34,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:34,758 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:34,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:34,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1504614149, now seen corresponding path program 1 times [2019-12-27 07:03:34,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:34,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601372706] [2019-12-27 07:03:34,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:34,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601372706] [2019-12-27 07:03:34,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:34,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:03:34,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961476923] [2019-12-27 07:03:34,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:34,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:34,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:34,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:34,870 INFO L87 Difference]: Start difference. First operand 341 states and 624 transitions. Second operand 3 states. [2019-12-27 07:03:34,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:34,884 INFO L93 Difference]: Finished difference Result 328 states and 585 transitions. [2019-12-27 07:03:34,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:34,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:03:34,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:34,886 INFO L225 Difference]: With dead ends: 328 [2019-12-27 07:03:34,886 INFO L226 Difference]: Without dead ends: 328 [2019-12-27 07:03:34,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:34,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-12-27 07:03:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-12-27 07:03:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 07:03:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 585 transitions. [2019-12-27 07:03:34,893 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 585 transitions. Word has length 52 [2019-12-27 07:03:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:34,893 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 585 transitions. [2019-12-27 07:03:34,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 585 transitions. [2019-12-27 07:03:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:03:34,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:34,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:34,895 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:34,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:34,896 INFO L82 PathProgramCache]: Analyzing trace with hash -820511471, now seen corresponding path program 1 times [2019-12-27 07:03:34,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:34,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819876015] [2019-12-27 07:03:34,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:35,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819876015] [2019-12-27 07:03:35,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:35,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:03:35,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077176851] [2019-12-27 07:03:35,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:03:35,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:35,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:03:35,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:03:35,045 INFO L87 Difference]: Start difference. First operand 328 states and 585 transitions. Second operand 6 states. [2019-12-27 07:03:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:35,126 INFO L93 Difference]: Finished difference Result 543 states and 963 transitions. [2019-12-27 07:03:35,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:03:35,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 07:03:35,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:35,128 INFO L225 Difference]: With dead ends: 543 [2019-12-27 07:03:35,128 INFO L226 Difference]: Without dead ends: 234 [2019-12-27 07:03:35,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:03:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-12-27 07:03:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 210. [2019-12-27 07:03:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-27 07:03:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 364 transitions. [2019-12-27 07:03:35,133 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 364 transitions. Word has length 53 [2019-12-27 07:03:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:35,133 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 364 transitions. [2019-12-27 07:03:35,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:03:35,134 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 364 transitions. [2019-12-27 07:03:35,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:03:35,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:35,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:35,135 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:35,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:35,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1394225301, now seen corresponding path program 2 times [2019-12-27 07:03:35,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:35,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503489587] [2019-12-27 07:03:35,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:35,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503489587] [2019-12-27 07:03:35,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:35,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:03:35,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108303661] [2019-12-27 07:03:35,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:35,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:35,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:35,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:35,238 INFO L87 Difference]: Start difference. First operand 210 states and 364 transitions. Second operand 3 states. [2019-12-27 07:03:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:35,280 INFO L93 Difference]: Finished difference Result 209 states and 362 transitions. [2019-12-27 07:03:35,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:35,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 07:03:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:35,282 INFO L225 Difference]: With dead ends: 209 [2019-12-27 07:03:35,282 INFO L226 Difference]: Without dead ends: 209 [2019-12-27 07:03:35,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-27 07:03:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-12-27 07:03:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-27 07:03:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 362 transitions. [2019-12-27 07:03:35,287 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 362 transitions. Word has length 53 [2019-12-27 07:03:35,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:35,287 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 362 transitions. [2019-12-27 07:03:35,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:35,287 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 362 transitions. [2019-12-27 07:03:35,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 07:03:35,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:35,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:35,289 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:35,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:35,289 INFO L82 PathProgramCache]: Analyzing trace with hash 599019040, now seen corresponding path program 1 times [2019-12-27 07:03:35,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:35,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997778074] [2019-12-27 07:03:35,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:03:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:03:35,444 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:03:35,444 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:03:35,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] ULTIMATE.startENTRY-->L787: Formula: (let ((.cse0 (store |v_#valid_44| 0 0))) (and (= v_~x$w_buff1_used~0_59 0) (= v_~x$r_buff1_thd1~0_19 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1595~0.base_18|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1595~0.base_18| 4)) (= v_~x$flush_delayed~0_15 0) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_21) (= v_~main$tmp_guard1~0_11 0) (= v_~x~0_27 0) (= 0 v_~x$w_buff0~0_24) (= 0 v_~x$r_buff0_thd0~0_77) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1595~0.base_18|) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= |v_#valid_42| (store .cse0 |v_ULTIMATE.start_main_~#t1595~0.base_18| 1)) (= 0 |v_ULTIMATE.start_main_~#t1595~0.offset_13|) (= 0 v_~weak$$choice0~0_7) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1595~0.base_18| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1595~0.base_18|) |v_ULTIMATE.start_main_~#t1595~0.offset_13| 0)) |v_#memory_int_15|) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_48 0) (= v_~y~0_13 0) (= v_~x$r_buff1_thd2~0_19 0) (= 0 v_~x$r_buff0_thd1~0_21) (= 0 v_~x$r_buff0_thd2~0_28) (= 0 v_~x$w_buff0_used~0_99) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~__unbuffered_p1_EBX~0_12 0) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_24, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_10|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_8|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_8|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, #length=|v_#length_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_77, ULTIMATE.start_main_~#t1595~0.offset=|v_ULTIMATE.start_main_~#t1595~0.offset_13|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_6|, ~x$w_buff1~0=v_~x$w_buff1~0_21, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_13|, ULTIMATE.start_main_~#t1595~0.base=|v_ULTIMATE.start_main_~#t1595~0.base_18|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_~#t1596~0.base=|v_ULTIMATE.start_main_~#t1596~0.base_16|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x~0=v_~x~0_27, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_10|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_11|, ~y~0=v_~y~0_13, ULTIMATE.start_main_~#t1596~0.offset=|v_ULTIMATE.start_main_~#t1596~0.offset_13|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_6|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_10|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1595~0.offset, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1595~0.base, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1596~0.base, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_~#t1596~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:03:35,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L787-1-->L789: Formula: (and (= |v_ULTIMATE.start_main_~#t1596~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1596~0.base_10|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1596~0.base_10| 1)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1596~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1596~0.base_10|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1596~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1596~0.base_10|) |v_ULTIMATE.start_main_~#t1596~0.offset_9| 1))) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1596~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1596~0.base=|v_ULTIMATE.start_main_~#t1596~0.base_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_3|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1596~0.offset=|v_ULTIMATE.start_main_~#t1596~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1596~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1596~0.offset] because there is no mapped edge [2019-12-27 07:03:35,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L4-->L764: Formula: (and (= ~__unbuffered_p1_EAX~0_Out-464109277 ~y~0_Out-464109277) (= 1 ~y~0_Out-464109277) (= ~x$r_buff1_thd0~0_Out-464109277 ~x$r_buff0_thd0~0_In-464109277) (= 1 ~x$r_buff0_thd2~0_Out-464109277) (= ~x$r_buff1_thd1~0_Out-464109277 ~x$r_buff0_thd1~0_In-464109277) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-464109277)) (= ~x$r_buff1_thd2~0_Out-464109277 ~x$r_buff0_thd2~0_In-464109277) (= ~__unbuffered_p1_EBX~0_Out-464109277 ~y~0_Out-464109277)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-464109277, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-464109277, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-464109277, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-464109277} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-464109277, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-464109277, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-464109277, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-464109277, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-464109277, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-464109277, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-464109277, ~y~0=~y~0_Out-464109277, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-464109277, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-464109277} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 07:03:35,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L730-2-->L730-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In-1537699396 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1537699396 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1537699396| ~x$w_buff1~0_In-1537699396) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1537699396| ~x~0_In-1537699396) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1537699396, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1537699396, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1537699396, ~x~0=~x~0_In-1537699396} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1537699396|, ~x$w_buff1~0=~x$w_buff1~0_In-1537699396, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1537699396, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1537699396, ~x~0=~x~0_In-1537699396} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-27 07:03:35,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L730-4-->L731: Formula: (= v_~x~0_15 |v_P0Thread1of1ForFork0_#t~ite3_8|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_8|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_7|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-27 07:03:35,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In97616325 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In97616325 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In97616325 |P0Thread1of1ForFork0_#t~ite5_Out97616325|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out97616325|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In97616325, ~x$w_buff0_used~0=~x$w_buff0_used~0_In97616325} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out97616325|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In97616325, ~x$w_buff0_used~0=~x$w_buff0_used~0_In97616325} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:03:35,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L732-->L732-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-2068971788 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-2068971788 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2068971788 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-2068971788 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-2068971788| ~x$w_buff1_used~0_In-2068971788)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-2068971788| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2068971788, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2068971788, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2068971788, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2068971788} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2068971788|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2068971788, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2068971788, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2068971788, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2068971788} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:03:35,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-438371256 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-438371256 256)))) (or (and (= ~x$r_buff0_thd1~0_In-438371256 |P0Thread1of1ForFork0_#t~ite7_Out-438371256|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-438371256|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-438371256, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-438371256} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-438371256, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-438371256|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-438371256} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 07:03:35,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1912769291 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1912769291 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1912769291 |P1Thread1of1ForFork1_#t~ite11_Out1912769291|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1912769291|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1912769291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1912769291} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1912769291|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1912769291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1912769291} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:03:35,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-939613703 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-939613703 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-939613703 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-939613703 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-939613703| ~x$w_buff1_used~0_In-939613703) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite12_Out-939613703| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-939613703, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-939613703, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-939613703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-939613703} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-939613703, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-939613703, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-939613703|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-939613703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-939613703} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:03:35,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L767-->L768: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In861087131 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In861087131 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out861087131 ~x$r_buff0_thd2~0_In861087131)) (and (= ~x$r_buff0_thd2~0_Out861087131 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In861087131, ~x$w_buff0_used~0=~x$w_buff0_used~0_In861087131} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out861087131|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out861087131, ~x$w_buff0_used~0=~x$w_buff0_used~0_In861087131} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:03:35,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In498614545 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In498614545 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In498614545 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In498614545 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out498614545|)) (and (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In498614545 |P1Thread1of1ForFork1_#t~ite14_Out498614545|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In498614545, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In498614545, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In498614545, ~x$w_buff0_used~0=~x$w_buff0_used~0_In498614545} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In498614545, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In498614545, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In498614545, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out498614545|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In498614545} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:03:35,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:03:35,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L734-->L734-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-516440355 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-516440355 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-516440355 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-516440355 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-516440355| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-516440355| ~x$r_buff1_thd1~0_In-516440355)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-516440355, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-516440355, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-516440355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-516440355} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-516440355, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-516440355|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-516440355, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-516440355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-516440355} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:03:35,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L734-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~x$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 07:03:35,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L789-1-->L795: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:03:35,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1328741410 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1328741410 256) 0))) (or (and (= ~x~0_In-1328741410 |ULTIMATE.start_main_#t~ite17_Out-1328741410|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1328741410 |ULTIMATE.start_main_#t~ite17_Out-1328741410|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1328741410, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1328741410, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1328741410, ~x~0=~x~0_In-1328741410} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1328741410|, ~x$w_buff1~0=~x$w_buff1~0_In-1328741410, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1328741410, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1328741410, ~x~0=~x~0_In-1328741410} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 07:03:35,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [624] [624] L795-4-->L796: Formula: (= v_~x~0_18 |v_ULTIMATE.start_main_#t~ite17_7|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_6|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-27 07:03:35,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1621301320 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1621301320 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out-1621301320|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1621301320 |ULTIMATE.start_main_#t~ite19_Out-1621301320|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1621301320, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1621301320} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1621301320, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1621301320|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1621301320} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 07:03:35,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1596774772 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1596774772 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1596774772 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1596774772 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-1596774772|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-1596774772 |ULTIMATE.start_main_#t~ite20_Out-1596774772|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1596774772, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1596774772, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1596774772, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1596774772} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1596774772, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1596774772, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1596774772|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1596774772, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1596774772} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 07:03:35,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1475525692 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1475525692 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out1475525692|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In1475525692 |ULTIMATE.start_main_#t~ite21_Out1475525692|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1475525692, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1475525692} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1475525692, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1475525692|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1475525692} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 07:03:35,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In2137378487 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In2137378487 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In2137378487 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2137378487 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out2137378487| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In2137378487 |ULTIMATE.start_main_#t~ite22_Out2137378487|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2137378487, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2137378487, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2137378487, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2137378487} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2137378487, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2137378487, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2137378487, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out2137378487|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2137378487} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 07:03:35,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L812: Formula: (and (= v_~x$r_buff0_thd0~0_69 v_~x$r_buff0_thd0~0_70) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 07:03:35,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-->L817-1: Formula: (and (= 0 v_~x$flush_delayed~0_9) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~x$flush_delayed~0_10 256))) (= v_~x$mem_tmp~0_6 v_~x~0_22)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_8|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:03:35,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L817-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 07:03:35,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:03:35 BasicIcfg [2019-12-27 07:03:35,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:03:35,545 INFO L168 Benchmark]: Toolchain (without parser) took 10198.55 ms. Allocated memory was 143.1 MB in the beginning and 465.0 MB in the end (delta: 321.9 MB). Free memory was 99.6 MB in the beginning and 206.6 MB in the end (delta: -107.0 MB). Peak memory consumption was 214.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:35,545 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 07:03:35,546 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.60 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 99.4 MB in the beginning and 154.8 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:35,547 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.76 ms. Allocated memory is still 200.8 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:35,548 INFO L168 Benchmark]: Boogie Preprocessor took 38.57 ms. Allocated memory is still 200.8 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:35,548 INFO L168 Benchmark]: RCFGBuilder took 865.75 ms. Allocated memory is still 200.8 MB. Free memory was 149.3 MB in the beginning and 105.0 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:35,549 INFO L168 Benchmark]: TraceAbstraction took 8495.65 ms. Allocated memory was 200.8 MB in the beginning and 465.0 MB in the end (delta: 264.2 MB). Free memory was 105.0 MB in the beginning and 206.6 MB in the end (delta: -101.6 MB). Peak memory consumption was 162.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:35,554 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 722.60 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 99.4 MB in the beginning and 154.8 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.76 ms. Allocated memory is still 200.8 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.57 ms. Allocated memory is still 200.8 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 865.75 ms. Allocated memory is still 200.8 MB. Free memory was 149.3 MB in the beginning and 105.0 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8495.65 ms. Allocated memory was 200.8 MB in the beginning and 465.0 MB in the end (delta: 264.2 MB). Free memory was 105.0 MB in the beginning and 206.6 MB in the end (delta: -101.6 MB). Peak memory consumption was 162.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 147 ProgramPointsBefore, 81 ProgramPointsAfterwards, 181 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 24 ChoiceCompositions, 3733 VarBasedMoverChecksPositive, 156 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51265 CheckedPairsTotal, 96 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L787] FCALL, FORK 0 pthread_create(&t1595, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] FCALL, FORK 0 pthread_create(&t1596, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 2 x$w_buff1 = x$w_buff0 [L745] 2 x$w_buff0 = 2 [L746] 2 x$w_buff1_used = x$w_buff0_used [L747] 2 x$w_buff0_used = (_Bool)1 [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L795] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L797] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L798] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L799] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L802] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 0 x$flush_delayed = weak$$choice2 [L805] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L807] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L808] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L809] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.2s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 887 SDtfs, 501 SDslu, 852 SDs, 0 SdLazy, 338 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13038occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 1384 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 37512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...