/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/mix034_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:10:53,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:10:53,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:10:53,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:10:53,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:10:53,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:10:53,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:10:53,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:10:53,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:10:53,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:10:53,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:10:53,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:10:53,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:10:53,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:10:53,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:10:53,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:10:53,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:10:53,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:10:53,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:10:53,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:10:53,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:10:53,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:10:53,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:10:53,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:10:53,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:10:53,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:10:53,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:10:53,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:10:53,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:10:53,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:10:53,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:10:53,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:10:53,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:10:53,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:10:53,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:10:53,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:10:53,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:10:53,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:10:53,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:10:53,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:10:53,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:10:53,327 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-18 21:10:53,351 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:10:53,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:10:53,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:10:53,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:10:53,354 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:10:53,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:10:53,355 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:10:53,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:10:53,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:10:53,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:10:53,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:10:53,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:10:53,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:10:53,356 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:10:53,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:10:53,356 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:10:53,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:10:53,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:10:53,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:10:53,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:10:53,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:10:53,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:10:53,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:10:53,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:10:53,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:10:53,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:10:53,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:10:53,359 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:10:53,359 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:10:53,359 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:10:53,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:10:53,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:10:53,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:10:53,694 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:10:53,694 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:10:53,694 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.opt.i [2019-12-18 21:10:53,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d8bc56b/9d81bdca009e42468f77c1d406bfe7e0/FLAGeb828e628 [2019-12-18 21:10:54,338 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:10:54,339 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.opt.i [2019-12-18 21:10:54,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d8bc56b/9d81bdca009e42468f77c1d406bfe7e0/FLAGeb828e628 [2019-12-18 21:10:54,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d8bc56b/9d81bdca009e42468f77c1d406bfe7e0 [2019-12-18 21:10:54,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:10:54,583 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:10:54,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:10:54,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:10:54,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:10:54,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:10:54" (1/1) ... [2019-12-18 21:10:54,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd22070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:54, skipping insertion in model container [2019-12-18 21:10:54,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:10:54" (1/1) ... [2019-12-18 21:10:54,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:10:54,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:10:55,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:10:55,158 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:10:55,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:10:55,306 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:10:55,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:55 WrapperNode [2019-12-18 21:10:55,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:10:55,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:10:55,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:10:55,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:10:55,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:55" (1/1) ... [2019-12-18 21:10:55,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:55" (1/1) ... [2019-12-18 21:10:55,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:10:55,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:10:55,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:10:55,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:10:55,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:55" (1/1) ... [2019-12-18 21:10:55,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:55" (1/1) ... [2019-12-18 21:10:55,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:55" (1/1) ... [2019-12-18 21:10:55,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:55" (1/1) ... [2019-12-18 21:10:55,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:55" (1/1) ... [2019-12-18 21:10:55,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:55" (1/1) ... [2019-12-18 21:10:55,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:55" (1/1) ... [2019-12-18 21:10:55,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:10:55,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:10:55,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:10:55,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:10:55,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:55" (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-18 21:10:55,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:10:55,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:10:55,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:10:55,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:10:55,471 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:10:55,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:10:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:10:55,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:10:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:10:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:10:55,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:10:55,474 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:10:56,196 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:10:56,197 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:10:56,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:10:56 BoogieIcfgContainer [2019-12-18 21:10:56,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:10:56,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:10:56,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:10:56,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:10:56,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:10:54" (1/3) ... [2019-12-18 21:10:56,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fd5053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:10:56, skipping insertion in model container [2019-12-18 21:10:56,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:55" (2/3) ... [2019-12-18 21:10:56,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fd5053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:10:56, skipping insertion in model container [2019-12-18 21:10:56,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:10:56" (3/3) ... [2019-12-18 21:10:56,206 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_power.opt.i [2019-12-18 21:10:56,216 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:10:56,216 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:10:56,225 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:10:56,226 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:10:56,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,266 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,266 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,268 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,278 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,278 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,312 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,313 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,313 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,335 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,338 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:56,354 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:10:56,374 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:10:56,375 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:10:56,375 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:10:56,375 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:10:56,375 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:10:56,375 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:10:56,376 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:10:56,376 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:10:56,393 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-18 21:10:56,395 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-18 21:10:56,491 INFO L126 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-18 21:10:56,492 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:10:56,512 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:10:56,534 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-18 21:10:56,609 INFO L126 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-18 21:10:56,609 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:10:56,615 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:10:56,630 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 21:10:56,631 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:10:59,936 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 21:11:00,059 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 21:11:00,090 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49761 [2019-12-18 21:11:00,090 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-18 21:11:00,094 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 83 transitions [2019-12-18 21:11:00,484 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-18 21:11:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-18 21:11:00,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:11:00,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:00,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:11:00,495 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:00,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:00,504 INFO L82 PathProgramCache]: Analyzing trace with hash 798121, now seen corresponding path program 1 times [2019-12-18 21:11:00,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:00,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788304375] [2019-12-18 21:11:00,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:00,747 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-18 21:11:00,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788304375] [2019-12-18 21:11:00,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:00,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:11:00,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493770360] [2019-12-18 21:11:00,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:00,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:00,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:00,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:00,773 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-18 21:11:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:00,998 INFO L93 Difference]: Finished difference Result 7842 states and 25482 transitions. [2019-12-18 21:11:00,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:01,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:11:01,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:01,076 INFO L225 Difference]: With dead ends: 7842 [2019-12-18 21:11:01,076 INFO L226 Difference]: Without dead ends: 7386 [2019-12-18 21:11:01,077 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-18 21:11:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7386 states. [2019-12-18 21:11:01,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7386 to 7386. [2019-12-18 21:11:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7386 states. [2019-12-18 21:11:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7386 states to 7386 states and 23956 transitions. [2019-12-18 21:11:01,533 INFO L78 Accepts]: Start accepts. Automaton has 7386 states and 23956 transitions. Word has length 3 [2019-12-18 21:11:01,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:01,533 INFO L462 AbstractCegarLoop]: Abstraction has 7386 states and 23956 transitions. [2019-12-18 21:11:01,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:01,533 INFO L276 IsEmpty]: Start isEmpty. Operand 7386 states and 23956 transitions. [2019-12-18 21:11:01,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:11:01,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:01,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:01,540 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:01,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:01,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1045751384, now seen corresponding path program 1 times [2019-12-18 21:11:01,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:01,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930079957] [2019-12-18 21:11:01,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:01,658 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-18 21:11:01,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930079957] [2019-12-18 21:11:01,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:01,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:01,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507891175] [2019-12-18 21:11:01,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:01,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:01,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:01,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:01,663 INFO L87 Difference]: Start difference. First operand 7386 states and 23956 transitions. Second operand 3 states. [2019-12-18 21:11:01,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:01,705 INFO L93 Difference]: Finished difference Result 1203 states and 2726 transitions. [2019-12-18 21:11:01,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:01,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 21:11:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:01,712 INFO L225 Difference]: With dead ends: 1203 [2019-12-18 21:11:01,713 INFO L226 Difference]: Without dead ends: 1203 [2019-12-18 21:11:01,713 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-18 21:11:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-12-18 21:11:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2019-12-18 21:11:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-12-18 21:11:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 2726 transitions. [2019-12-18 21:11:01,745 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 2726 transitions. Word has length 11 [2019-12-18 21:11:01,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:01,745 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 2726 transitions. [2019-12-18 21:11:01,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 2726 transitions. [2019-12-18 21:11:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:11:01,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:01,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:01,748 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:01,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:01,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1102482469, now seen corresponding path program 1 times [2019-12-18 21:11:01,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:01,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857229755] [2019-12-18 21:11:01,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:01,847 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-18 21:11:01,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857229755] [2019-12-18 21:11:01,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:01,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:01,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784644412] [2019-12-18 21:11:01,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:01,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:01,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:01,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:01,852 INFO L87 Difference]: Start difference. First operand 1203 states and 2726 transitions. Second operand 3 states. [2019-12-18 21:11:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:01,934 INFO L93 Difference]: Finished difference Result 1939 states and 4348 transitions. [2019-12-18 21:11:01,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:01,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 21:11:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:01,945 INFO L225 Difference]: With dead ends: 1939 [2019-12-18 21:11:01,945 INFO L226 Difference]: Without dead ends: 1939 [2019-12-18 21:11:01,945 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-18 21:11:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-18 21:11:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1336. [2019-12-18 21:11:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-12-18 21:11:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3074 transitions. [2019-12-18 21:11:01,989 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3074 transitions. Word has length 14 [2019-12-18 21:11:01,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:01,990 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 3074 transitions. [2019-12-18 21:11:01,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:01,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3074 transitions. [2019-12-18 21:11:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:11:01,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:01,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:01,994 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:01,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:01,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1024507146, now seen corresponding path program 1 times [2019-12-18 21:11:01,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:01,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556673270] [2019-12-18 21:11:01,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:02,093 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-18 21:11:02,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556673270] [2019-12-18 21:11:02,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:02,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:02,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467019513] [2019-12-18 21:11:02,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:02,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:02,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:02,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:02,097 INFO L87 Difference]: Start difference. First operand 1336 states and 3074 transitions. Second operand 4 states. [2019-12-18 21:11:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:02,254 INFO L93 Difference]: Finished difference Result 1693 states and 3800 transitions. [2019-12-18 21:11:02,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:11:02,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:11:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:02,263 INFO L225 Difference]: With dead ends: 1693 [2019-12-18 21:11:02,263 INFO L226 Difference]: Without dead ends: 1693 [2019-12-18 21:11:02,264 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-18 21:11:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2019-12-18 21:11:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1629. [2019-12-18 21:11:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1629 states. [2019-12-18 21:11:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 3676 transitions. [2019-12-18 21:11:02,303 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 3676 transitions. Word has length 14 [2019-12-18 21:11:02,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:02,303 INFO L462 AbstractCegarLoop]: Abstraction has 1629 states and 3676 transitions. [2019-12-18 21:11:02,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 3676 transitions. [2019-12-18 21:11:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:11:02,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:02,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:02,305 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:02,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:02,305 INFO L82 PathProgramCache]: Analyzing trace with hash -399327403, now seen corresponding path program 1 times [2019-12-18 21:11:02,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:02,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106301322] [2019-12-18 21:11:02,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:02,346 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-18 21:11:02,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106301322] [2019-12-18 21:11:02,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:02,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:02,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634003187] [2019-12-18 21:11:02,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:02,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:02,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:02,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:02,348 INFO L87 Difference]: Start difference. First operand 1629 states and 3676 transitions. Second operand 4 states. [2019-12-18 21:11:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:02,510 INFO L93 Difference]: Finished difference Result 1964 states and 4378 transitions. [2019-12-18 21:11:02,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:11:02,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:11:02,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:02,522 INFO L225 Difference]: With dead ends: 1964 [2019-12-18 21:11:02,522 INFO L226 Difference]: Without dead ends: 1964 [2019-12-18 21:11:02,523 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-18 21:11:02,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-12-18 21:11:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1704. [2019-12-18 21:11:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-18 21:11:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3842 transitions. [2019-12-18 21:11:02,564 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3842 transitions. Word has length 14 [2019-12-18 21:11:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:02,565 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3842 transitions. [2019-12-18 21:11:02,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3842 transitions. [2019-12-18 21:11:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:11:02,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:02,568 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-18 21:11:02,568 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:02,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:02,568 INFO L82 PathProgramCache]: Analyzing trace with hash -524969657, now seen corresponding path program 1 times [2019-12-18 21:11:02,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:02,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420337044] [2019-12-18 21:11:02,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:02,674 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-18 21:11:02,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420337044] [2019-12-18 21:11:02,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:02,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:02,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709117270] [2019-12-18 21:11:02,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:11:02,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:02,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:11:02,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:11:02,677 INFO L87 Difference]: Start difference. First operand 1704 states and 3842 transitions. Second operand 5 states. [2019-12-18 21:11:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:02,988 INFO L93 Difference]: Finished difference Result 2231 states and 4892 transitions. [2019-12-18 21:11:02,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:11:02,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 21:11:02,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:03,001 INFO L225 Difference]: With dead ends: 2231 [2019-12-18 21:11:03,001 INFO L226 Difference]: Without dead ends: 2231 [2019-12-18 21:11:03,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:11:03,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-12-18 21:11:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1975. [2019-12-18 21:11:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2019-12-18 21:11:03,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 4398 transitions. [2019-12-18 21:11:03,047 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 4398 transitions. Word has length 25 [2019-12-18 21:11:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:03,047 INFO L462 AbstractCegarLoop]: Abstraction has 1975 states and 4398 transitions. [2019-12-18 21:11:03,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:11:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 4398 transitions. [2019-12-18 21:11:03,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:11:03,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:03,050 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-18 21:11:03,050 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:03,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:03,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1656128157, now seen corresponding path program 1 times [2019-12-18 21:11:03,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:03,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670545958] [2019-12-18 21:11:03,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:03,098 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-18 21:11:03,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670545958] [2019-12-18 21:11:03,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:03,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:11:03,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054864535] [2019-12-18 21:11:03,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:03,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:03,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:03,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:03,100 INFO L87 Difference]: Start difference. First operand 1975 states and 4398 transitions. Second operand 3 states. [2019-12-18 21:11:03,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:03,113 INFO L93 Difference]: Finished difference Result 1974 states and 4396 transitions. [2019-12-18 21:11:03,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:03,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 21:11:03,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:03,124 INFO L225 Difference]: With dead ends: 1974 [2019-12-18 21:11:03,124 INFO L226 Difference]: Without dead ends: 1974 [2019-12-18 21:11:03,124 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-18 21:11:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-12-18 21:11:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1974. [2019-12-18 21:11:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2019-12-18 21:11:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 4396 transitions. [2019-12-18 21:11:03,166 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 4396 transitions. Word has length 26 [2019-12-18 21:11:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:03,167 INFO L462 AbstractCegarLoop]: Abstraction has 1974 states and 4396 transitions. [2019-12-18 21:11:03,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:03,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 4396 transitions. [2019-12-18 21:11:03,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:11:03,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:03,170 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-18 21:11:03,170 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:03,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:03,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2023210146, now seen corresponding path program 1 times [2019-12-18 21:11:03,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:03,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575908746] [2019-12-18 21:11:03,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:03,292 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-18 21:11:03,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575908746] [2019-12-18 21:11:03,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:03,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:03,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415768191] [2019-12-18 21:11:03,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:11:03,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:03,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:11:03,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:11:03,298 INFO L87 Difference]: Start difference. First operand 1974 states and 4396 transitions. Second operand 5 states. [2019-12-18 21:11:03,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:03,520 INFO L93 Difference]: Finished difference Result 2351 states and 5130 transitions. [2019-12-18 21:11:03,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:11:03,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:11:03,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:03,527 INFO L225 Difference]: With dead ends: 2351 [2019-12-18 21:11:03,527 INFO L226 Difference]: Without dead ends: 2351 [2019-12-18 21:11:03,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:11:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2019-12-18 21:11:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 1824. [2019-12-18 21:11:03,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-12-18 21:11:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 4080 transitions. [2019-12-18 21:11:03,566 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 4080 transitions. Word has length 26 [2019-12-18 21:11:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:03,566 INFO L462 AbstractCegarLoop]: Abstraction has 1824 states and 4080 transitions. [2019-12-18 21:11:03,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:11:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 4080 transitions. [2019-12-18 21:11:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:11:03,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:03,570 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-18 21:11:03,571 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:03,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:03,571 INFO L82 PathProgramCache]: Analyzing trace with hash 394176671, now seen corresponding path program 1 times [2019-12-18 21:11:03,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:03,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181431921] [2019-12-18 21:11:03,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:03,663 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-18 21:11:03,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181431921] [2019-12-18 21:11:03,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:03,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:11:03,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118448575] [2019-12-18 21:11:03,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:11:03,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:03,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:11:03,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:11:03,667 INFO L87 Difference]: Start difference. First operand 1824 states and 4080 transitions. Second operand 5 states. [2019-12-18 21:11:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:04,178 INFO L93 Difference]: Finished difference Result 2655 states and 5824 transitions. [2019-12-18 21:11:04,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:11:04,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 21:11:04,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:04,186 INFO L225 Difference]: With dead ends: 2655 [2019-12-18 21:11:04,186 INFO L226 Difference]: Without dead ends: 2655 [2019-12-18 21:11:04,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:11:04,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2019-12-18 21:11:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2340. [2019-12-18 21:11:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2340 states. [2019-12-18 21:11:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 5204 transitions. [2019-12-18 21:11:04,245 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 5204 transitions. Word has length 27 [2019-12-18 21:11:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:04,245 INFO L462 AbstractCegarLoop]: Abstraction has 2340 states and 5204 transitions. [2019-12-18 21:11:04,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:11:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 5204 transitions. [2019-12-18 21:11:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 21:11:04,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:04,249 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] [2019-12-18 21:11:04,249 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:04,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:04,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2139749391, now seen corresponding path program 1 times [2019-12-18 21:11:04,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:04,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536040601] [2019-12-18 21:11:04,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:04,294 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-18 21:11:04,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536040601] [2019-12-18 21:11:04,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:04,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:04,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644511497] [2019-12-18 21:11:04,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:04,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:04,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:04,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:04,296 INFO L87 Difference]: Start difference. First operand 2340 states and 5204 transitions. Second operand 4 states. [2019-12-18 21:11:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:04,312 INFO L93 Difference]: Finished difference Result 1309 states and 2783 transitions. [2019-12-18 21:11:04,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:11:04,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 21:11:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:04,316 INFO L225 Difference]: With dead ends: 1309 [2019-12-18 21:11:04,316 INFO L226 Difference]: Without dead ends: 1309 [2019-12-18 21:11:04,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:04,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2019-12-18 21:11:04,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1214. [2019-12-18 21:11:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-18 21:11:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2608 transitions. [2019-12-18 21:11:04,340 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2608 transitions. Word has length 28 [2019-12-18 21:11:04,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:04,341 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 2608 transitions. [2019-12-18 21:11:04,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2608 transitions. [2019-12-18 21:11:04,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:11:04,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:04,344 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-18 21:11:04,345 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:04,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:04,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1815455026, now seen corresponding path program 1 times [2019-12-18 21:11:04,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:04,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182534465] [2019-12-18 21:11:04,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:04,429 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-18 21:11:04,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182534465] [2019-12-18 21:11:04,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:04,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:11:04,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702538693] [2019-12-18 21:11:04,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:11:04,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:04,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:11:04,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:11:04,431 INFO L87 Difference]: Start difference. First operand 1214 states and 2608 transitions. Second operand 7 states. [2019-12-18 21:11:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:04,748 INFO L93 Difference]: Finished difference Result 3206 states and 6700 transitions. [2019-12-18 21:11:04,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:11:04,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 21:11:04,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:04,754 INFO L225 Difference]: With dead ends: 3206 [2019-12-18 21:11:04,754 INFO L226 Difference]: Without dead ends: 2107 [2019-12-18 21:11:04,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:11:04,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2019-12-18 21:11:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 1250. [2019-12-18 21:11:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-12-18 21:11:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 2682 transitions. [2019-12-18 21:11:04,785 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 2682 transitions. Word has length 51 [2019-12-18 21:11:04,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:04,786 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 2682 transitions. [2019-12-18 21:11:04,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:11:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 2682 transitions. [2019-12-18 21:11:04,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:11:04,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:04,789 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-18 21:11:04,790 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:04,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:04,790 INFO L82 PathProgramCache]: Analyzing trace with hash 700498790, now seen corresponding path program 2 times [2019-12-18 21:11:04,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:04,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564108859] [2019-12-18 21:11:04,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:04,858 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-18 21:11:04,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564108859] [2019-12-18 21:11:04,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:04,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:04,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091584265] [2019-12-18 21:11:04,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:04,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:04,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:04,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:04,861 INFO L87 Difference]: Start difference. First operand 1250 states and 2682 transitions. Second operand 3 states. [2019-12-18 21:11:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:04,911 INFO L93 Difference]: Finished difference Result 1643 states and 3481 transitions. [2019-12-18 21:11:04,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:04,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 21:11:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:04,915 INFO L225 Difference]: With dead ends: 1643 [2019-12-18 21:11:04,915 INFO L226 Difference]: Without dead ends: 1643 [2019-12-18 21:11:04,916 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-18 21:11:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2019-12-18 21:11:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1340. [2019-12-18 21:11:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2019-12-18 21:11:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 2879 transitions. [2019-12-18 21:11:04,942 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 2879 transitions. Word has length 51 [2019-12-18 21:11:04,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:04,943 INFO L462 AbstractCegarLoop]: Abstraction has 1340 states and 2879 transitions. [2019-12-18 21:11:04,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 2879 transitions. [2019-12-18 21:11:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:11:04,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:04,947 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-18 21:11:04,947 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:04,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:04,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1020694631, now seen corresponding path program 1 times [2019-12-18 21:11:04,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:04,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874871578] [2019-12-18 21:11:04,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:05,045 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-18 21:11:05,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874871578] [2019-12-18 21:11:05,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:05,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:05,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999610991] [2019-12-18 21:11:05,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:05,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:05,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:05,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:05,048 INFO L87 Difference]: Start difference. First operand 1340 states and 2879 transitions. Second operand 4 states. [2019-12-18 21:11:05,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:05,120 INFO L93 Difference]: Finished difference Result 1340 states and 2864 transitions. [2019-12-18 21:11:05,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:11:05,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 21:11:05,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:05,125 INFO L225 Difference]: With dead ends: 1340 [2019-12-18 21:11:05,125 INFO L226 Difference]: Without dead ends: 1340 [2019-12-18 21:11:05,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:11:05,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-12-18 21:11:05,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1208. [2019-12-18 21:11:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2019-12-18 21:11:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 2584 transitions. [2019-12-18 21:11:05,150 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 2584 transitions. Word has length 52 [2019-12-18 21:11:05,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:05,151 INFO L462 AbstractCegarLoop]: Abstraction has 1208 states and 2584 transitions. [2019-12-18 21:11:05,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:05,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 2584 transitions. [2019-12-18 21:11:05,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:11:05,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:05,155 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-18 21:11:05,155 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:05,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:05,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1332632369, now seen corresponding path program 1 times [2019-12-18 21:11:05,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:05,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261292483] [2019-12-18 21:11:05,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:05,362 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-18 21:11:05,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261292483] [2019-12-18 21:11:05,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:05,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:11:05,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446764255] [2019-12-18 21:11:05,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:11:05,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:05,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:11:05,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:11:05,364 INFO L87 Difference]: Start difference. First operand 1208 states and 2584 transitions. Second operand 9 states. [2019-12-18 21:11:06,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:06,329 INFO L93 Difference]: Finished difference Result 1474 states and 2991 transitions. [2019-12-18 21:11:06,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:11:06,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-18 21:11:06,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:06,332 INFO L225 Difference]: With dead ends: 1474 [2019-12-18 21:11:06,332 INFO L226 Difference]: Without dead ends: 1474 [2019-12-18 21:11:06,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:11:06,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-12-18 21:11:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1114. [2019-12-18 21:11:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2019-12-18 21:11:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 2301 transitions. [2019-12-18 21:11:06,357 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 2301 transitions. Word has length 52 [2019-12-18 21:11:06,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:06,358 INFO L462 AbstractCegarLoop]: Abstraction has 1114 states and 2301 transitions. [2019-12-18 21:11:06,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:11:06,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 2301 transitions. [2019-12-18 21:11:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:11:06,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:06,361 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-18 21:11:06,361 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:06,362 INFO L82 PathProgramCache]: Analyzing trace with hash 509482779, now seen corresponding path program 2 times [2019-12-18 21:11:06,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:06,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907321254] [2019-12-18 21:11:06,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:06,474 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-18 21:11:06,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907321254] [2019-12-18 21:11:06,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:06,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:06,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658853527] [2019-12-18 21:11:06,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:06,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:06,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:06,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:06,477 INFO L87 Difference]: Start difference. First operand 1114 states and 2301 transitions. Second operand 3 states. [2019-12-18 21:11:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:06,492 INFO L93 Difference]: Finished difference Result 1113 states and 2299 transitions. [2019-12-18 21:11:06,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:06,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:11:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:06,495 INFO L225 Difference]: With dead ends: 1113 [2019-12-18 21:11:06,495 INFO L226 Difference]: Without dead ends: 1113 [2019-12-18 21:11:06,496 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-18 21:11:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-12-18 21:11:06,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 805. [2019-12-18 21:11:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-12-18 21:11:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1705 transitions. [2019-12-18 21:11:06,515 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1705 transitions. Word has length 52 [2019-12-18 21:11:06,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:06,515 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1705 transitions. [2019-12-18 21:11:06,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1705 transitions. [2019-12-18 21:11:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:11:06,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:06,518 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-18 21:11:06,518 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:06,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:06,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1167104957, now seen corresponding path program 1 times [2019-12-18 21:11:06,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:06,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974089836] [2019-12-18 21:11:06,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:11:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:11:06,621 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:11:06,622 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:11:06,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_50| 0 0))) (and (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= v_~z$w_buff0_used~0_109 0) (= v_~main$tmp_guard0~0_7 0) (= v_~z~0_24 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t899~0.base_27| 1) |v_#valid_48|) (= 0 v_~z$r_buff1_thd0~0_21) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t899~0.base_27|) (= v_~z$r_buff0_thd2~0_79 0) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~y~0_7) (= 0 v_~z$r_buff1_thd1~0_18) (= 0 v_~x~0_7) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_24 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t899~0.base_27|) 0) (= 0 v_~z$mem_tmp~0_9) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t899~0.base_27| 4)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_18 0) (= |v_ULTIMATE.start_main_~#t899~0.offset_20| 0) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~z$w_buff0~0_28) (= 0 v_~z$w_buff1_used~0_69) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd2~0_50) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_cnt~0_16) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t899~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t899~0.base_27|) |v_ULTIMATE.start_main_~#t899~0.offset_20| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t899~0.base=|v_ULTIMATE.start_main_~#t899~0.base_27|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_50, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_21, ULTIMATE.start_main_~#t900~0.base=|v_ULTIMATE.start_main_~#t900~0.base_19|, #length=|v_#length_15|, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_79, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_109, ~z$w_buff0~0=v_~z$w_buff0~0_28, ULTIMATE.start_main_~#t900~0.offset=|v_ULTIMATE.start_main_~#t900~0.offset_16|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, ULTIMATE.start_main_~#t899~0.offset=|v_ULTIMATE.start_main_~#t899~0.offset_20|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, #NULL.base=|v_#NULL.base_5|, ~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_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_48|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t899~0.base, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t900~0.base, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t900~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t899~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 21:11:06,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L804-1-->L806: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t900~0.base_13| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t900~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t900~0.base_13|) |v_ULTIMATE.start_main_~#t900~0.offset_11| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t900~0.base_13|) (= |v_ULTIMATE.start_main_~#t900~0.offset_11| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t900~0.base_13|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t900~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t900~0.base_13| 1) |v_#valid_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t900~0.base=|v_ULTIMATE.start_main_~#t900~0.base_13|, ULTIMATE.start_main_~#t900~0.offset=|v_ULTIMATE.start_main_~#t900~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t900~0.base, ULTIMATE.start_main_~#t900~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 21:11:06,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff0~0_In-1719572703 ~z$w_buff1~0_Out-1719572703) (= 1 ~z$w_buff0~0_Out-1719572703) (= ~z$w_buff1_used~0_Out-1719572703 ~z$w_buff0_used~0_In-1719572703) (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1719572703 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1719572703|) (= 1 ~z$w_buff0_used~0_Out-1719572703) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1719572703|) (= (mod ~z$w_buff1_used~0_Out-1719572703 256) 0) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1719572703| P0Thread1of1ForFork0_~arg.offset_Out-1719572703) (= |P0Thread1of1ForFork0_#in~arg.base_In-1719572703| P0Thread1of1ForFork0_~arg.base_Out-1719572703)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1719572703|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1719572703, ~z$w_buff0~0=~z$w_buff0~0_In-1719572703, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1719572703|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1719572703|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1719572703, ~z$w_buff0~0=~z$w_buff0~0_Out-1719572703, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1719572703, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1719572703, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1719572703|, ~z$w_buff1~0=~z$w_buff1~0_Out-1719572703, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1719572703, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1719572703|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1719572703} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:11:06,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L773-->L773-8: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In128164804 256))) (.cse4 (= 0 (mod ~z$r_buff1_thd2~0_In128164804 256))) (.cse6 (= 0 (mod ~z$r_buff0_thd2~0_In128164804 256))) (.cse5 (= (mod ~z$w_buff0_used~0_In128164804 256) 0)) (.cse0 (= (mod ~weak$$choice2~0_In128164804 256) 0)) (.cse3 (= |P1Thread1of1ForFork1_#t~ite24_Out128164804| |P1Thread1of1ForFork1_#t~ite23_Out128164804|))) (or (let ((.cse1 (not .cse6))) (and (= |P1Thread1of1ForFork1_#t~ite23_Out128164804| |P1Thread1of1ForFork1_#t~ite22_Out128164804|) .cse0 (or .cse1 (not .cse2)) .cse3 (or .cse1 (not .cse4)) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out128164804|) (not .cse5))) (and (= |P1Thread1of1ForFork1_#t~ite22_In128164804| |P1Thread1of1ForFork1_#t~ite22_Out128164804|) (or (and (not .cse0) (= ~z$w_buff1_used~0_In128164804 |P1Thread1of1ForFork1_#t~ite24_Out128164804|) (= |P1Thread1of1ForFork1_#t~ite23_In128164804| |P1Thread1of1ForFork1_#t~ite23_Out128164804|)) (and (or (and .cse6 .cse2) (and .cse4 .cse6) .cse5) .cse0 .cse3 (= ~z$w_buff1_used~0_In128164804 |P1Thread1of1ForFork1_#t~ite23_Out128164804|)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In128164804, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In128164804, ~z$w_buff1_used~0=~z$w_buff1_used~0_In128164804, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In128164804|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In128164804|, ~weak$$choice2~0=~weak$$choice2~0_In128164804, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In128164804} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In128164804, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In128164804, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out128164804|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In128164804, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out128164804|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out128164804|, ~weak$$choice2~0=~weak$$choice2~0_In128164804, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In128164804} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 21:11:06,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L774-->L775: Formula: (and (= v_~z$r_buff0_thd2~0_64 v_~z$r_buff0_thd2~0_63) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_64} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_63, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 21:11:06,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L775-->L775-8: Formula: (let ((.cse5 (= 0 (mod ~z$w_buff1_used~0_In1252703955 256))) (.cse4 (= 0 (mod ~z$w_buff0_used~0_In1252703955 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite30_Out1252703955| |P1Thread1of1ForFork1_#t~ite29_Out1252703955|)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1252703955 256))) (.cse0 (= (mod ~weak$$choice2~0_In1252703955 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In1252703955 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In1252703955| |P1Thread1of1ForFork1_#t~ite28_Out1252703955|) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In1252703955| |P1Thread1of1ForFork1_#t~ite29_Out1252703955|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out1252703955| ~z$r_buff1_thd2~0_In1252703955)) (and .cse1 .cse0 (or (and .cse2 .cse3) .cse4 (and .cse5 .cse3)) (= ~z$r_buff1_thd2~0_In1252703955 |P1Thread1of1ForFork1_#t~ite29_Out1252703955|)))) (let ((.cse6 (not .cse3))) (and (or .cse6 (not .cse5)) (not .cse4) .cse1 (or .cse6 (not .cse2)) .cse0 (= 0 |P1Thread1of1ForFork1_#t~ite28_Out1252703955|) (= |P1Thread1of1ForFork1_#t~ite28_Out1252703955| |P1Thread1of1ForFork1_#t~ite29_Out1252703955|))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1252703955|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1252703955, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1252703955, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1252703955, ~weak$$choice2~0=~weak$$choice2~0_In1252703955, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1252703955, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1252703955|} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1252703955|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1252703955|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1252703955, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1252703955, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1252703955, ~weak$$choice2~0=~weak$$choice2~0_In1252703955, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1252703955, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1252703955|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:11:06,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_17 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:11:06,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1428066735 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1428066735 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1428066735| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1428066735| ~z$w_buff0_used~0_In-1428066735) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1428066735, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1428066735} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1428066735|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1428066735, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1428066735} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:11:06,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-730298536 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-730298536 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-730298536 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-730298536 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-730298536| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-730298536 |P0Thread1of1ForFork0_#t~ite6_Out-730298536|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-730298536, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-730298536, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-730298536, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-730298536} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-730298536|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-730298536, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-730298536, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-730298536, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-730298536} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:11:06,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1662388488 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1662388488 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out1662388488 ~z$r_buff0_thd1~0_In1662388488)) (and (= ~z$r_buff0_thd1~0_Out1662388488 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1662388488, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1662388488} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1662388488, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1662388488|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1662388488} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:11:06,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In1020871153 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1020871153 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1020871153 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In1020871153 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1020871153| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd1~0_In1020871153 |P0Thread1of1ForFork0_#t~ite8_Out1020871153|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1020871153, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1020871153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1020871153, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1020871153} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1020871153, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1020871153|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1020871153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1020871153, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1020871153} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:11:06,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out-1048605430| |P1Thread1of1ForFork1_#t~ite32_Out-1048605430|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1048605430 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1048605430 256) 0))) (or (and (= ~z~0_In-1048605430 |P1Thread1of1ForFork1_#t~ite32_Out-1048605430|) (or .cse0 .cse1) .cse2) (and (= ~z$w_buff1~0_In-1048605430 |P1Thread1of1ForFork1_#t~ite32_Out-1048605430|) .cse2 (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1048605430, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1048605430, ~z$w_buff1~0=~z$w_buff1~0_In-1048605430, ~z~0=~z~0_In-1048605430} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1048605430, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1048605430, ~z$w_buff1~0=~z$w_buff1~0_In-1048605430, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1048605430|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1048605430|, ~z~0=~z~0_In-1048605430} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 21:11:06,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1197704152 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1197704152 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1197704152| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1197704152| ~z$w_buff0_used~0_In1197704152) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1197704152, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1197704152} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1197704152, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1197704152|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1197704152} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 21:11:06,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1583465529 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1583465529 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1583465529 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1583465529 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1583465529|)) (and (= ~z$w_buff1_used~0_In-1583465529 |P1Thread1of1ForFork1_#t~ite35_Out-1583465529|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1583465529, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1583465529, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1583465529, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1583465529} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1583465529, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1583465529, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1583465529, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1583465529|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1583465529} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 21:11:06,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-43375285 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-43375285 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-43375285| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-43375285 |P1Thread1of1ForFork1_#t~ite36_Out-43375285|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-43375285, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-43375285} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-43375285, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-43375285, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-43375285|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 21:11:06,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-225074027 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-225074027 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-225074027 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-225074027 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-225074027 |P1Thread1of1ForFork1_#t~ite37_Out-225074027|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-225074027|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-225074027, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-225074027, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-225074027, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-225074027} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-225074027, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-225074027, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-225074027, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-225074027, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-225074027|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:11:06,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_40 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:11:06,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:11:06,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 21:11:06,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1919178810 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1919178810 256)))) (or (and (= ~z$w_buff1~0_In-1919178810 |ULTIMATE.start_main_#t~ite40_Out-1919178810|) (not .cse0) (not .cse1)) (and (= ~z~0_In-1919178810 |ULTIMATE.start_main_#t~ite40_Out-1919178810|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1919178810, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1919178810, ~z$w_buff1~0=~z$w_buff1~0_In-1919178810, ~z~0=~z~0_In-1919178810} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1919178810|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1919178810, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1919178810, ~z$w_buff1~0=~z$w_buff1~0_In-1919178810, ~z~0=~z~0_In-1919178810} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:11:06,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_15 |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|, ~z~0=v_~z~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-18 21:11:06,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1773980748 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1773980748 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1773980748|)) (and (= ~z$w_buff0_used~0_In-1773980748 |ULTIMATE.start_main_#t~ite42_Out-1773980748|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1773980748, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1773980748} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1773980748, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1773980748, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1773980748|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:11:06,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In1675343071 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1675343071 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1675343071 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1675343071 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1675343071|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1675343071 |ULTIMATE.start_main_#t~ite43_Out1675343071|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1675343071, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1675343071, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1675343071, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1675343071} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1675343071, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1675343071, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1675343071, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1675343071, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1675343071|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 21:11:06,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In441920126 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In441920126 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out441920126| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out441920126| ~z$r_buff0_thd0~0_In441920126)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In441920126, ~z$w_buff0_used~0=~z$w_buff0_used~0_In441920126} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In441920126, ~z$w_buff0_used~0=~z$w_buff0_used~0_In441920126, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out441920126|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:11:06,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1193615020 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1193615020 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In1193615020 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1193615020 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In1193615020 |ULTIMATE.start_main_#t~ite45_Out1193615020|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1193615020|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1193615020, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1193615020, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1193615020, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1193615020} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1193615020, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1193615020, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1193615020, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1193615020, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1193615020|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:11:06,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EAX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~z$r_buff1_thd0~0_14) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:11:06,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:11:06 BasicIcfg [2019-12-18 21:11:06,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:11:06,734 INFO L168 Benchmark]: Toolchain (without parser) took 12150.94 ms. Allocated memory was 138.4 MB in the beginning and 390.1 MB in the end (delta: 251.7 MB). Free memory was 102.1 MB in the beginning and 136.1 MB in the end (delta: -34.0 MB). Peak memory consumption was 217.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:06,734 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 21:11:06,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.56 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 157.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:06,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.25 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 154.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:06,739 INFO L168 Benchmark]: Boogie Preprocessor took 38.64 ms. Allocated memory is still 202.9 MB. Free memory was 154.5 MB in the beginning and 152.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:06,740 INFO L168 Benchmark]: RCFGBuilder took 786.38 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 108.0 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:06,743 INFO L168 Benchmark]: TraceAbstraction took 10533.00 ms. Allocated memory was 202.9 MB in the beginning and 390.1 MB in the end (delta: 187.2 MB). Free memory was 107.4 MB in the beginning and 136.1 MB in the end (delta: -28.7 MB). Peak memory consumption was 158.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:06,748 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.16 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 723.56 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 157.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.25 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 154.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.64 ms. Allocated memory is still 202.9 MB. Free memory was 154.5 MB in the beginning and 152.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 786.38 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 108.0 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10533.00 ms. Allocated memory was 202.9 MB in the beginning and 390.1 MB in the end (delta: 187.2 MB). Free memory was 107.4 MB in the beginning and 136.1 MB in the end (delta: -28.7 MB). Peak memory consumption was 158.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 149 ProgramPointsBefore, 74 ProgramPointsAfterwards, 183 TransitionsBefore, 83 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 28 ChoiceCompositions, 4346 VarBasedMoverChecksPositive, 182 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49761 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t899, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t900, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1820 SDtfs, 1361 SDslu, 3604 SDs, 0 SdLazy, 2209 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 26 SyntacticMatches, 11 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8010occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 4080 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 499 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 51738 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...