/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/rfi007_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:12:07,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:12:07,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:12:07,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:12:07,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:12:07,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:12:07,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:12:07,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:12:07,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:12:07,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:12:07,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:12:07,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:12:07,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:12:07,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:12:07,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:12:07,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:12:07,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:12:07,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:12:07,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:12:07,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:12:07,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:12:07,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:12:07,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:12:07,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:12:07,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:12:07,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:12:07,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:12:07,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:12:07,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:12:07,121 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:12:07,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:12:07,122 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:12:07,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:12:07,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:12:07,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:12:07,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:12:07,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:12:07,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:12:07,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:12:07,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:12:07,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:12:07,128 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:12:07,143 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:12:07,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:12:07,145 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:12:07,145 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:12:07,145 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:12:07,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:12:07,145 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:12:07,146 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:12:07,146 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:12:07,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:12:07,146 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:12:07,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:12:07,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:12:07,147 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:12:07,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:12:07,147 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:12:07,147 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:12:07,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:12:07,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:12:07,148 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:12:07,148 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:12:07,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:12:07,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:12:07,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:12:07,149 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:12:07,149 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:12:07,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:12:07,150 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:12:07,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:12:07,150 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:12:07,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:12:07,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:12:07,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:12:07,446 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:12:07,446 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:12:07,447 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_pso.oepc.i [2019-12-27 07:12:07,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32940abbe/b93a9be40f7244c08ca79c151413dce6/FLAG2f0747c16 [2019-12-27 07:12:08,107 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:12:08,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_pso.oepc.i [2019-12-27 07:12:08,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32940abbe/b93a9be40f7244c08ca79c151413dce6/FLAG2f0747c16 [2019-12-27 07:12:08,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32940abbe/b93a9be40f7244c08ca79c151413dce6 [2019-12-27 07:12:08,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:12:08,397 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:12:08,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:12:08,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:12:08,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:12:08,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:12:08" (1/1) ... [2019-12-27 07:12:08,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1511a0f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:08, skipping insertion in model container [2019-12-27 07:12:08,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:12:08" (1/1) ... [2019-12-27 07:12:08,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:12:08,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:12:08,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:12:09,000 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:12:09,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:12:09,176 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:12:09,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:09 WrapperNode [2019-12-27 07:12:09,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:12:09,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:12:09,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:12:09,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:12:09,187 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:12:09" (1/1) ... [2019-12-27 07:12:09,208 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:12:09" (1/1) ... [2019-12-27 07:12:09,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:12:09,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:12:09,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:12:09,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:12:09,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:09" (1/1) ... [2019-12-27 07:12:09,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:09" (1/1) ... [2019-12-27 07:12:09,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:09" (1/1) ... [2019-12-27 07:12:09,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:09" (1/1) ... [2019-12-27 07:12:09,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:09" (1/1) ... [2019-12-27 07:12:09,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:09" (1/1) ... [2019-12-27 07:12:09,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:09" (1/1) ... [2019-12-27 07:12:09,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:12:09,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:12:09,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:12:09,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:12:09,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:09" (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:12:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:12:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:12:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:12:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:12:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:12:09,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:12:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:12:09,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:12:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:12:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:12:09,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:12:09,351 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:12:10,082 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:12:10,083 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:12:10,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:12:10 BoogieIcfgContainer [2019-12-27 07:12:10,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:12:10,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:12:10,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:12:10,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:12:10,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:12:08" (1/3) ... [2019-12-27 07:12:10,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2bdbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:12:10, skipping insertion in model container [2019-12-27 07:12:10,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:09" (2/3) ... [2019-12-27 07:12:10,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2bdbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:12:10, skipping insertion in model container [2019-12-27 07:12:10,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:12:10" (3/3) ... [2019-12-27 07:12:10,094 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_pso.oepc.i [2019-12-27 07:12:10,103 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:12:10,104 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:12:10,111 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:12:10,112 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:12:10,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,170 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,171 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,171 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,171 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,184 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,185 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,238 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,239 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,239 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,250 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,269 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:10,287 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:12:10,312 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:12:10,312 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:12:10,312 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:12:10,312 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:12:10,313 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:12:10,313 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:12:10,313 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:12:10,313 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:12:10,336 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 07:12:10,338 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 07:12:10,440 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 07:12:10,440 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:12:10,454 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 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:12:10,475 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 07:12:10,519 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 07:12:10,519 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:12:10,525 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 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:12:10,539 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 07:12:10,540 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:12:13,581 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 07:12:13,688 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 07:12:13,781 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50908 [2019-12-27 07:12:13,781 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 07:12:13,785 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 90 transitions [2019-12-27 07:12:14,362 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9707 states. [2019-12-27 07:12:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states. [2019-12-27 07:12:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:12:14,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:14,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:12:14,372 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:14,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:14,379 INFO L82 PathProgramCache]: Analyzing trace with hash 787412, now seen corresponding path program 1 times [2019-12-27 07:12:14,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:14,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132805093] [2019-12-27 07:12:14,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:14,598 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:12:14,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132805093] [2019-12-27 07:12:14,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:14,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:12:14,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911993802] [2019-12-27 07:12:14,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:14,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:14,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:14,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:14,628 INFO L87 Difference]: Start difference. First operand 9707 states. Second operand 3 states. [2019-12-27 07:12:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:14,891 INFO L93 Difference]: Finished difference Result 9421 states and 30351 transitions. [2019-12-27 07:12:14,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:14,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:12:14,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:14,982 INFO L225 Difference]: With dead ends: 9421 [2019-12-27 07:12:14,982 INFO L226 Difference]: Without dead ends: 8862 [2019-12-27 07:12:14,983 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:12:15,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8862 states. [2019-12-27 07:12:15,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8862 to 8862. [2019-12-27 07:12:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8862 states. [2019-12-27 07:12:15,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8862 states to 8862 states and 28501 transitions. [2019-12-27 07:12:15,541 INFO L78 Accepts]: Start accepts. Automaton has 8862 states and 28501 transitions. Word has length 3 [2019-12-27 07:12:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:15,542 INFO L462 AbstractCegarLoop]: Abstraction has 8862 states and 28501 transitions. [2019-12-27 07:12:15,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 8862 states and 28501 transitions. [2019-12-27 07:12:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:12:15,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:15,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:15,546 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:15,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:15,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1755658876, now seen corresponding path program 1 times [2019-12-27 07:12:15,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:15,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765989557] [2019-12-27 07:12:15,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:15,661 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:12:15,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765989557] [2019-12-27 07:12:15,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:15,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:12:15,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719586453] [2019-12-27 07:12:15,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:12:15,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:15,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:12:15,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:12:15,665 INFO L87 Difference]: Start difference. First operand 8862 states and 28501 transitions. Second operand 4 states. [2019-12-27 07:12:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:16,083 INFO L93 Difference]: Finished difference Result 13396 states and 41079 transitions. [2019-12-27 07:12:16,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:12:16,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:12:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:16,174 INFO L225 Difference]: With dead ends: 13396 [2019-12-27 07:12:16,174 INFO L226 Difference]: Without dead ends: 13389 [2019-12-27 07:12:16,177 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:12:16,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13389 states. [2019-12-27 07:12:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13389 to 12015. [2019-12-27 07:12:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12015 states. [2019-12-27 07:12:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 37536 transitions. [2019-12-27 07:12:17,383 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 37536 transitions. Word has length 11 [2019-12-27 07:12:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:17,384 INFO L462 AbstractCegarLoop]: Abstraction has 12015 states and 37536 transitions. [2019-12-27 07:12:17,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:12:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 37536 transitions. [2019-12-27 07:12:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:12:17,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:17,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:17,395 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:17,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:17,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1550555126, now seen corresponding path program 1 times [2019-12-27 07:12:17,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:17,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102100744] [2019-12-27 07:12:17,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:17,549 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:12:17,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102100744] [2019-12-27 07:12:17,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:17,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:12:17,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38108806] [2019-12-27 07:12:17,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:12:17,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:17,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:12:17,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:12:17,551 INFO L87 Difference]: Start difference. First operand 12015 states and 37536 transitions. Second operand 4 states. [2019-12-27 07:12:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:17,831 INFO L93 Difference]: Finished difference Result 14164 states and 44146 transitions. [2019-12-27 07:12:17,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:12:17,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:12:17,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:17,872 INFO L225 Difference]: With dead ends: 14164 [2019-12-27 07:12:17,872 INFO L226 Difference]: Without dead ends: 14164 [2019-12-27 07:12:17,873 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:12:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14164 states. [2019-12-27 07:12:18,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14164 to 12676. [2019-12-27 07:12:18,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12676 states. [2019-12-27 07:12:18,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12676 states to 12676 states and 39720 transitions. [2019-12-27 07:12:18,360 INFO L78 Accepts]: Start accepts. Automaton has 12676 states and 39720 transitions. Word has length 14 [2019-12-27 07:12:18,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:18,364 INFO L462 AbstractCegarLoop]: Abstraction has 12676 states and 39720 transitions. [2019-12-27 07:12:18,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:12:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 12676 states and 39720 transitions. [2019-12-27 07:12:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:12:18,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:18,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:18,368 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:18,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:18,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1838903681, now seen corresponding path program 1 times [2019-12-27 07:12:18,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:18,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803852223] [2019-12-27 07:12:18,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:18,477 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:12:18,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803852223] [2019-12-27 07:12:18,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:18,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:12:18,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048667268] [2019-12-27 07:12:18,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:18,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:18,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:18,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:18,483 INFO L87 Difference]: Start difference. First operand 12676 states and 39720 transitions. Second operand 3 states. [2019-12-27 07:12:18,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:18,546 INFO L93 Difference]: Finished difference Result 12673 states and 39711 transitions. [2019-12-27 07:12:18,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:18,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 07:12:18,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:18,592 INFO L225 Difference]: With dead ends: 12673 [2019-12-27 07:12:18,593 INFO L226 Difference]: Without dead ends: 12673 [2019-12-27 07:12:18,593 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:12:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12673 states. [2019-12-27 07:12:19,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12673 to 12673. [2019-12-27 07:12:19,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12673 states. [2019-12-27 07:12:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12673 states to 12673 states and 39711 transitions. [2019-12-27 07:12:19,110 INFO L78 Accepts]: Start accepts. Automaton has 12673 states and 39711 transitions. Word has length 16 [2019-12-27 07:12:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:19,111 INFO L462 AbstractCegarLoop]: Abstraction has 12673 states and 39711 transitions. [2019-12-27 07:12:19,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 12673 states and 39711 transitions. [2019-12-27 07:12:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:12:19,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:19,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:19,116 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:19,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:19,116 INFO L82 PathProgramCache]: Analyzing trace with hash -601685409, now seen corresponding path program 1 times [2019-12-27 07:12:19,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:19,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462046433] [2019-12-27 07:12:19,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:19,164 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:12:19,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462046433] [2019-12-27 07:12:19,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:19,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:12:19,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765807150] [2019-12-27 07:12:19,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:19,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:19,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:19,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:19,167 INFO L87 Difference]: Start difference. First operand 12673 states and 39711 transitions. Second operand 3 states. [2019-12-27 07:12:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:19,268 INFO L93 Difference]: Finished difference Result 21543 states and 67050 transitions. [2019-12-27 07:12:19,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:19,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 07:12:19,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:19,308 INFO L225 Difference]: With dead ends: 21543 [2019-12-27 07:12:19,309 INFO L226 Difference]: Without dead ends: 12171 [2019-12-27 07:12:19,309 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:12:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-27 07:12:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 11475. [2019-12-27 07:12:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11475 states. [2019-12-27 07:12:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 34983 transitions. [2019-12-27 07:12:19,622 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 34983 transitions. Word has length 17 [2019-12-27 07:12:19,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:19,622 INFO L462 AbstractCegarLoop]: Abstraction has 11475 states and 34983 transitions. [2019-12-27 07:12:19,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 34983 transitions. [2019-12-27 07:12:19,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:12:19,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:19,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:19,627 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:19,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1176802527, now seen corresponding path program 1 times [2019-12-27 07:12:19,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:19,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143061803] [2019-12-27 07:12:19,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:19,910 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2019-12-27 07:12:19,912 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:12:19,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143061803] [2019-12-27 07:12:19,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:19,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:12:19,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132632820] [2019-12-27 07:12:19,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:12:19,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:19,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:12:19,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:12:19,914 INFO L87 Difference]: Start difference. First operand 11475 states and 34983 transitions. Second operand 4 states. [2019-12-27 07:12:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:19,961 INFO L93 Difference]: Finished difference Result 1920 states and 4675 transitions. [2019-12-27 07:12:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:12:19,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 07:12:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:19,965 INFO L225 Difference]: With dead ends: 1920 [2019-12-27 07:12:19,965 INFO L226 Difference]: Without dead ends: 1382 [2019-12-27 07:12:19,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:12:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-12-27 07:12:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1378. [2019-12-27 07:12:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2019-12-27 07:12:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 3017 transitions. [2019-12-27 07:12:19,989 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 3017 transitions. Word has length 17 [2019-12-27 07:12:19,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:19,989 INFO L462 AbstractCegarLoop]: Abstraction has 1378 states and 3017 transitions. [2019-12-27 07:12:19,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:12:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 3017 transitions. [2019-12-27 07:12:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:12:19,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:19,992 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] [2019-12-27 07:12:19,992 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:19,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:19,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2091906228, now seen corresponding path program 1 times [2019-12-27 07:12:19,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:19,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153225780] [2019-12-27 07:12:19,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:20,074 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:12:20,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153225780] [2019-12-27 07:12:20,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:20,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:12:20,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044675574] [2019-12-27 07:12:20,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:12:20,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:20,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:12:20,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:12:20,077 INFO L87 Difference]: Start difference. First operand 1378 states and 3017 transitions. Second operand 6 states. [2019-12-27 07:12:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:20,711 INFO L93 Difference]: Finished difference Result 3860 states and 8328 transitions. [2019-12-27 07:12:20,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:12:20,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 07:12:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:20,719 INFO L225 Difference]: With dead ends: 3860 [2019-12-27 07:12:20,720 INFO L226 Difference]: Without dead ends: 3825 [2019-12-27 07:12:20,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:12:20,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2019-12-27 07:12:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 2035. [2019-12-27 07:12:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-27 07:12:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4502 transitions. [2019-12-27 07:12:20,766 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4502 transitions. Word has length 25 [2019-12-27 07:12:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:20,767 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4502 transitions. [2019-12-27 07:12:20,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:12:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4502 transitions. [2019-12-27 07:12:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:12:20,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:20,770 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] [2019-12-27 07:12:20,770 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:20,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:20,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1541096581, now seen corresponding path program 1 times [2019-12-27 07:12:20,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:20,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350359971] [2019-12-27 07:12:20,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:20,846 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:12:20,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350359971] [2019-12-27 07:12:20,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:20,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:12:20,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843721824] [2019-12-27 07:12:20,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:12:20,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:20,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:12:20,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:12:20,849 INFO L87 Difference]: Start difference. First operand 2035 states and 4502 transitions. Second operand 6 states. [2019-12-27 07:12:21,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:21,287 INFO L93 Difference]: Finished difference Result 3781 states and 8072 transitions. [2019-12-27 07:12:21,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:12:21,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 07:12:21,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:21,299 INFO L225 Difference]: With dead ends: 3781 [2019-12-27 07:12:21,300 INFO L226 Difference]: Without dead ends: 3752 [2019-12-27 07:12:21,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:12:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2019-12-27 07:12:21,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2007. [2019-12-27 07:12:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-12-27 07:12:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 4455 transitions. [2019-12-27 07:12:21,345 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 4455 transitions. Word has length 26 [2019-12-27 07:12:21,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:21,346 INFO L462 AbstractCegarLoop]: Abstraction has 2007 states and 4455 transitions. [2019-12-27 07:12:21,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:12:21,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 4455 transitions. [2019-12-27 07:12:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:12:21,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:21,349 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] [2019-12-27 07:12:21,349 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:21,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:21,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1268776575, now seen corresponding path program 1 times [2019-12-27 07:12:21,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:21,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560808802] [2019-12-27 07:12:21,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:21,426 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:12:21,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560808802] [2019-12-27 07:12:21,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:21,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:12:21,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196696921] [2019-12-27 07:12:21,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:12:21,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:21,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:12:21,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:12:21,429 INFO L87 Difference]: Start difference. First operand 2007 states and 4455 transitions. Second operand 5 states. [2019-12-27 07:12:21,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:21,468 INFO L93 Difference]: Finished difference Result 1067 states and 2242 transitions. [2019-12-27 07:12:21,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:12:21,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 07:12:21,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:21,471 INFO L225 Difference]: With dead ends: 1067 [2019-12-27 07:12:21,471 INFO L226 Difference]: Without dead ends: 862 [2019-12-27 07:12:21,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:12:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-12-27 07:12:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 828. [2019-12-27 07:12:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-12-27 07:12:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1806 transitions. [2019-12-27 07:12:21,484 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1806 transitions. Word has length 27 [2019-12-27 07:12:21,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:21,485 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1806 transitions. [2019-12-27 07:12:21,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:12:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1806 transitions. [2019-12-27 07:12:21,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 07:12:21,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:21,488 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] [2019-12-27 07:12:21,488 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:21,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:21,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1725794524, now seen corresponding path program 1 times [2019-12-27 07:12:21,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:21,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358554959] [2019-12-27 07:12:21,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:21,579 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:12:21,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358554959] [2019-12-27 07:12:21,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:21,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:12:21,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518908037] [2019-12-27 07:12:21,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:12:21,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:21,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:12:21,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:12:21,581 INFO L87 Difference]: Start difference. First operand 828 states and 1806 transitions. Second operand 7 states. [2019-12-27 07:12:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:21,780 INFO L93 Difference]: Finished difference Result 1705 states and 3607 transitions. [2019-12-27 07:12:21,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:12:21,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 07:12:21,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:21,782 INFO L225 Difference]: With dead ends: 1705 [2019-12-27 07:12:21,782 INFO L226 Difference]: Without dead ends: 1136 [2019-12-27 07:12:21,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:12:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-12-27 07:12:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 903. [2019-12-27 07:12:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-12-27 07:12:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1931 transitions. [2019-12-27 07:12:21,798 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1931 transitions. Word has length 51 [2019-12-27 07:12:21,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:21,798 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1931 transitions. [2019-12-27 07:12:21,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:12:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1931 transitions. [2019-12-27 07:12:21,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 07:12:21,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:21,801 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] [2019-12-27 07:12:21,801 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:21,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:21,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1701166622, now seen corresponding path program 2 times [2019-12-27 07:12:21,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:21,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144402801] [2019-12-27 07:12:21,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:22,130 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:12:22,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144402801] [2019-12-27 07:12:22,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:22,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:12:22,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83517824] [2019-12-27 07:12:22,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:22,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:22,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:22,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:22,133 INFO L87 Difference]: Start difference. First operand 903 states and 1931 transitions. Second operand 3 states. [2019-12-27 07:12:22,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:22,200 INFO L93 Difference]: Finished difference Result 1183 states and 2500 transitions. [2019-12-27 07:12:22,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:22,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 07:12:22,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:22,202 INFO L225 Difference]: With dead ends: 1183 [2019-12-27 07:12:22,203 INFO L226 Difference]: Without dead ends: 1183 [2019-12-27 07:12:22,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:12:22,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-12-27 07:12:22,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 993. [2019-12-27 07:12:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-12-27 07:12:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 2127 transitions. [2019-12-27 07:12:22,220 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 2127 transitions. Word has length 51 [2019-12-27 07:12:22,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:22,221 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 2127 transitions. [2019-12-27 07:12:22,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:22,221 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 2127 transitions. [2019-12-27 07:12:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:12:22,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:22,224 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:12:22,224 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:22,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:22,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1213233403, now seen corresponding path program 1 times [2019-12-27 07:12:22,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:22,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405795899] [2019-12-27 07:12:22,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:22,267 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:12:22,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405795899] [2019-12-27 07:12:22,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:22,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:12:22,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112410001] [2019-12-27 07:12:22,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:22,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:22,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:22,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:22,271 INFO L87 Difference]: Start difference. First operand 993 states and 2127 transitions. Second operand 3 states. [2019-12-27 07:12:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:22,318 INFO L93 Difference]: Finished difference Result 1082 states and 2252 transitions. [2019-12-27 07:12:22,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:22,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:12:22,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:22,321 INFO L225 Difference]: With dead ends: 1082 [2019-12-27 07:12:22,321 INFO L226 Difference]: Without dead ends: 1082 [2019-12-27 07:12:22,322 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:12:22,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-12-27 07:12:22,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 930. [2019-12-27 07:12:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-12-27 07:12:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1974 transitions. [2019-12-27 07:12:22,338 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1974 transitions. Word has length 52 [2019-12-27 07:12:22,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:22,339 INFO L462 AbstractCegarLoop]: Abstraction has 930 states and 1974 transitions. [2019-12-27 07:12:22,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1974 transitions. [2019-12-27 07:12:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:12:22,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:22,342 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:12:22,342 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:22,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:22,342 INFO L82 PathProgramCache]: Analyzing trace with hash 105545405, now seen corresponding path program 1 times [2019-12-27 07:12:22,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:22,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997881148] [2019-12-27 07:12:22,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:22,425 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:12:22,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997881148] [2019-12-27 07:12:22,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:22,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:12:22,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049455665] [2019-12-27 07:12:22,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:22,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:22,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:22,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:22,428 INFO L87 Difference]: Start difference. First operand 930 states and 1974 transitions. Second operand 3 states. [2019-12-27 07:12:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:22,440 INFO L93 Difference]: Finished difference Result 929 states and 1972 transitions. [2019-12-27 07:12:22,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:22,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:12:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:22,442 INFO L225 Difference]: With dead ends: 929 [2019-12-27 07:12:22,442 INFO L226 Difference]: Without dead ends: 929 [2019-12-27 07:12:22,443 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:12:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-27 07:12:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 670. [2019-12-27 07:12:22,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-27 07:12:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1434 transitions. [2019-12-27 07:12:22,454 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1434 transitions. Word has length 52 [2019-12-27 07:12:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:22,454 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1434 transitions. [2019-12-27 07:12:22,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1434 transitions. [2019-12-27 07:12:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:12:22,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:22,456 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:12:22,456 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:22,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:22,457 INFO L82 PathProgramCache]: Analyzing trace with hash -616115185, now seen corresponding path program 1 times [2019-12-27 07:12:22,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:22,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839886940] [2019-12-27 07:12:22,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:12:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:12:22,596 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:12:22,596 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:12:22,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_45| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~x$w_buff1~0_25) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1709~0.base_22| 4)) (= 0 v_~x$r_buff0_thd1~0_28) (= 0 v_~x$r_buff0_thd0~0_22) (= 0 v_~x$r_buff0_thd2~0_76) (= v_~x~0_24 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1709~0.base_22|) (= v_~x$flush_delayed~0_13 0) (= |v_ULTIMATE.start_main_~#t1709~0.offset_17| 0) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_18 0) (= 0 v_~x$w_buff0~0_25) (= v_~y~0_15 0) (= |v_#valid_43| (store .cse0 |v_ULTIMATE.start_main_~#t1709~0.base_22| 1)) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~x$r_buff1_thd2~0_51 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$w_buff0_used~0_102) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1709~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1709~0.base_22|) |v_ULTIMATE.start_main_~#t1709~0.offset_17| 0))) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~x$r_buff1_thd0~0_19 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1709~0.base_22|)) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_25, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t1710~0.offset=|v_ULTIMATE.start_main_~#t1710~0.offset_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ULTIMATE.start_main_~#t1709~0.offset=|v_ULTIMATE.start_main_~#t1709~0.offset_17|, #length=|v_#length_13|, ~y~0=v_~y~0_15, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ULTIMATE.start_main_~#t1710~0.base=|v_ULTIMATE.start_main_~#t1710~0.base_16|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_76, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1709~0.base=|v_ULTIMATE.start_main_~#t1709~0.base_22|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_24, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1710~0.offset, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1709~0.offset, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1710~0.base, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1709~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:12:22,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_56) (= v_~x$r_buff1_thd1~0_11 v_~x$r_buff0_thd1~0_17) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_14) (= 1 v_~y~0_5) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= 1 v_~x$r_buff0_thd1~0_16)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_11, ~y~0=v_~y~0_5, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 07:12:22,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L797-1-->L799: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1710~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1710~0.base_12|) |v_ULTIMATE.start_main_~#t1710~0.offset_10| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1710~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1710~0.base_12| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1710~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1710~0.offset_10|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1710~0.base_12| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1710~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1710~0.base=|v_ULTIMATE.start_main_~#t1710~0.base_12|, ULTIMATE.start_main_~#t1710~0.offset=|v_ULTIMATE.start_main_~#t1710~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1710~0.base, ULTIMATE.start_main_~#t1710~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 07:12:22,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-735221509 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-735221509 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-735221509 |P0Thread1of1ForFork0_#t~ite5_Out-735221509|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-735221509|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-735221509, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-735221509} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-735221509|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-735221509, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-735221509} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:12:22,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1531488616 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1531488616 256) 0))) (or (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-1531488616 256))) (and .cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1531488616 256))) (= 0 (mod ~x$w_buff0_used~0_In-1531488616 256)))) (= |P1Thread1of1ForFork1_#t~ite15_Out-1531488616| |P1Thread1of1ForFork1_#t~ite14_Out-1531488616|) (= ~x$w_buff0~0_In-1531488616 |P1Thread1of1ForFork1_#t~ite14_Out-1531488616|) .cse1) (and (= ~x$w_buff0~0_In-1531488616 |P1Thread1of1ForFork1_#t~ite15_Out-1531488616|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In-1531488616| |P1Thread1of1ForFork1_#t~ite14_Out-1531488616|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1531488616, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1531488616, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1531488616, ~weak$$choice2~0=~weak$$choice2~0_In-1531488616, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1531488616, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1531488616|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1531488616} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1531488616, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1531488616, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1531488616, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1531488616|, ~weak$$choice2~0=~weak$$choice2~0_In-1531488616, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1531488616, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1531488616|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1531488616} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:12:22,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-363447698 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out-363447698| |P1Thread1of1ForFork1_#t~ite17_Out-363447698|) (= ~x$w_buff1~0_In-363447698 |P1Thread1of1ForFork1_#t~ite17_Out-363447698|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-363447698 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-363447698 256))) (= 0 (mod ~x$w_buff0_used~0_In-363447698 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-363447698 256)))))) (and (= |P1Thread1of1ForFork1_#t~ite17_In-363447698| |P1Thread1of1ForFork1_#t~ite17_Out-363447698|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out-363447698| ~x$w_buff1~0_In-363447698)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-363447698, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-363447698, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-363447698, ~weak$$choice2~0=~weak$$choice2~0_In-363447698, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-363447698, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-363447698|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-363447698} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-363447698|, ~x$w_buff1~0=~x$w_buff1~0_In-363447698, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-363447698, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-363447698, ~weak$$choice2~0=~weak$$choice2~0_In-363447698, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-363447698, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-363447698|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-363447698} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 07:12:22,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-883452394 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-883452394 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-883452394 256)) (and .cse0 (= (mod ~x$r_buff1_thd2~0_In-883452394 256) 0)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-883452394 256))))) (= ~x$w_buff0_used~0_In-883452394 |P1Thread1of1ForFork1_#t~ite20_Out-883452394|) (= |P1Thread1of1ForFork1_#t~ite21_Out-883452394| |P1Thread1of1ForFork1_#t~ite20_Out-883452394|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In-883452394| |P1Thread1of1ForFork1_#t~ite20_Out-883452394|) (= ~x$w_buff0_used~0_In-883452394 |P1Thread1of1ForFork1_#t~ite21_Out-883452394|)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-883452394|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-883452394, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-883452394, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-883452394, ~weak$$choice2~0=~weak$$choice2~0_In-883452394, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-883452394} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-883452394|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-883452394, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-883452394, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-883452394|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-883452394, ~weak$$choice2~0=~weak$$choice2~0_In-883452394, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-883452394} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 07:12:22,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1749663678 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1749663678 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1749663678 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1749663678 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1749663678 |P0Thread1of1ForFork0_#t~ite6_Out1749663678|) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1749663678| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1749663678, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1749663678, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1749663678, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1749663678} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1749663678|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1749663678, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1749663678, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1749663678, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1749663678} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:12:22,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In763433722 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In763433722 256)))) (or (and (= ~x$r_buff0_thd1~0_Out763433722 ~x$r_buff0_thd1~0_In763433722) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$r_buff0_thd1~0_Out763433722 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In763433722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763433722} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out763433722, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out763433722|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763433722} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 07:12:22,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In211933903 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In211933903 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In211933903 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In211933903 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out211933903| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out211933903| ~x$r_buff1_thd1~0_In211933903) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In211933903, ~x$w_buff1_used~0=~x$w_buff1_used~0_In211933903, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In211933903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In211933903} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In211933903, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out211933903|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In211933903, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In211933903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In211933903} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:12:22,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L742-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= 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_8} 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_7, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} 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:12:22,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd2~0_60 v_~x$r_buff0_thd2~0_59)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 07:12:22,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1224516088 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1224516088 256)))) (or (and (= (mod ~x$w_buff1_used~0_In1224516088 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1224516088 256)) (and (= 0 (mod ~x$r_buff1_thd2~0_In1224516088 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite29_Out1224516088| ~x$r_buff1_thd2~0_In1224516088) (= |P1Thread1of1ForFork1_#t~ite29_Out1224516088| |P1Thread1of1ForFork1_#t~ite30_Out1224516088|)) (and (= ~x$r_buff1_thd2~0_In1224516088 |P1Thread1of1ForFork1_#t~ite30_Out1224516088|) (= |P1Thread1of1ForFork1_#t~ite29_In1224516088| |P1Thread1of1ForFork1_#t~ite29_Out1224516088|) (not .cse0)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1224516088|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1224516088, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1224516088, ~weak$$choice2~0=~weak$$choice2~0_In1224516088, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1224516088, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1224516088} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1224516088|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1224516088|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1224516088, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1224516088, ~weak$$choice2~0=~weak$$choice2~0_In1224516088, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1224516088, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1224516088} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 07:12:22,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 07:12:22,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-210380232 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-210380232 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In-210380232 |P1Thread1of1ForFork1_#t~ite32_Out-210380232|)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-210380232| ~x$w_buff1~0_In-210380232)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-210380232, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-210380232, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-210380232, ~x~0=~x~0_In-210380232} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-210380232, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-210380232, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-210380232, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-210380232|, ~x~0=~x~0_In-210380232} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 07:12:22,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_16 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 07:12:22,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-898420190 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-898420190 256) 0))) (or (and (= ~x$w_buff0_used~0_In-898420190 |P1Thread1of1ForFork1_#t~ite34_Out-898420190|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-898420190|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-898420190, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-898420190} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-898420190|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-898420190, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-898420190} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:12:22,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1471269165 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1471269165 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1471269165 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1471269165 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out1471269165| ~x$w_buff1_used~0_In1471269165) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite35_Out1471269165| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1471269165, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1471269165, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1471269165, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1471269165} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1471269165, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1471269165, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1471269165|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1471269165, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1471269165} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 07:12:22,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In880010694 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In880010694 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In880010694 |P1Thread1of1ForFork1_#t~ite36_Out880010694|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out880010694|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In880010694, ~x$w_buff0_used~0=~x$w_buff0_used~0_In880010694} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In880010694, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out880010694|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In880010694} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 07:12:22,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1746866131 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1746866131 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1746866131 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1746866131 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1746866131 |P1Thread1of1ForFork1_#t~ite37_Out-1746866131|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1746866131|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1746866131, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1746866131, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1746866131, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1746866131} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1746866131, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1746866131, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1746866131, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1746866131|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1746866131} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:12:22,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_44 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:12:22,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~x$w_buff0_used~0_83 256) 0) (= 0 (mod v_~x$r_buff0_thd0~0_17 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:12:22,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1862770799 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1862770799 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1862770799| ~x$w_buff1~0_In1862770799) (not .cse0) (not .cse1)) (and (= ~x~0_In1862770799 |ULTIMATE.start_main_#t~ite40_Out1862770799|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1862770799, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1862770799, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1862770799, ~x~0=~x~0_In1862770799} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1862770799|, ~x$w_buff1~0=~x$w_buff1~0_In1862770799, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1862770799, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1862770799, ~x~0=~x~0_In1862770799} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 07:12:22,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-27 07:12:22,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In237937280 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In237937280 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out237937280| 0)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In237937280 |ULTIMATE.start_main_#t~ite42_Out237937280|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In237937280, ~x$w_buff0_used~0=~x$w_buff0_used~0_In237937280} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In237937280, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out237937280|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In237937280} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 07:12:22,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In578550162 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In578550162 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In578550162 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In578550162 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out578550162|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In578550162 |ULTIMATE.start_main_#t~ite43_Out578550162|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In578550162, ~x$w_buff1_used~0=~x$w_buff1_used~0_In578550162, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In578550162, ~x$w_buff0_used~0=~x$w_buff0_used~0_In578550162} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In578550162, ~x$w_buff1_used~0=~x$w_buff1_used~0_In578550162, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out578550162|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In578550162, ~x$w_buff0_used~0=~x$w_buff0_used~0_In578550162} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 07:12:22,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In356991779 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In356991779 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out356991779| ~x$r_buff0_thd0~0_In356991779)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out356991779| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In356991779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In356991779} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In356991779, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out356991779|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In356991779} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:12:22,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1659747499 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1659747499 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1659747499 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1659747499 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out1659747499| ~x$r_buff1_thd0~0_In1659747499)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite45_Out1659747499| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1659747499, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1659747499, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1659747499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1659747499} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1659747499, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1659747499, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1659747499, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1659747499|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1659747499} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:12:22,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite45_14|) (= v_~main$tmp_guard1~0_12 0) (= v_~__unbuffered_p1_EBX~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y~0_13 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:12:22,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:12:22 BasicIcfg [2019-12-27 07:12:22,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:12:22,697 INFO L168 Benchmark]: Toolchain (without parser) took 14300.03 ms. Allocated memory was 144.2 MB in the beginning and 616.0 MB in the end (delta: 471.9 MB). Free memory was 99.7 MB in the beginning and 459.3 MB in the end (delta: -359.6 MB). Peak memory consumption was 112.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:22,697 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 07:12:22,698 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.51 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 99.2 MB in the beginning and 156.6 MB in the end (delta: -57.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:22,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.98 ms. Allocated memory is still 202.4 MB. Free memory was 156.6 MB in the beginning and 153.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:22,699 INFO L168 Benchmark]: Boogie Preprocessor took 41.85 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:22,700 INFO L168 Benchmark]: RCFGBuilder took 801.71 ms. Allocated memory is still 202.4 MB. Free memory was 151.6 MB in the beginning and 107.4 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:22,701 INFO L168 Benchmark]: TraceAbstraction took 12609.00 ms. Allocated memory was 202.4 MB in the beginning and 616.0 MB in the end (delta: 413.7 MB). Free memory was 107.4 MB in the beginning and 459.3 MB in the end (delta: -351.9 MB). Peak memory consumption was 61.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:22,705 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.19 ms. Allocated memory is still 144.2 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.51 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 99.2 MB in the beginning and 156.6 MB in the end (delta: -57.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.98 ms. Allocated memory is still 202.4 MB. Free memory was 156.6 MB in the beginning and 153.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.85 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 801.71 ms. Allocated memory is still 202.4 MB. Free memory was 151.6 MB in the beginning and 107.4 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12609.00 ms. Allocated memory was 202.4 MB in the beginning and 616.0 MB in the end (delta: 413.7 MB). Free memory was 107.4 MB in the beginning and 459.3 MB in the end (delta: -351.9 MB). Peak memory consumption was 61.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 147 ProgramPointsBefore, 80 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4527 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50908 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 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=0, __unbuffered_p1_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1710, ((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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 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 [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 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 [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 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 [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1557 SDtfs, 1599 SDslu, 2316 SDs, 0 SdLazy, 1136 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12676occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 7965 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 349 ConstructedInterpolants, 0 QuantifiedInterpolants, 31947 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...