/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:26:23,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:26:23,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:26:23,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:26:23,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:26:23,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:26:23,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:26:23,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:26:23,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:26:23,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:26:23,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:26:23,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:26:23,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:26:23,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:26:23,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:26:23,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:26:23,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:26:23,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:26:23,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:26:23,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:26:23,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:26:23,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:26:23,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:26:23,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:26:23,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:26:23,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:26:23,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:26:23,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:26:23,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:26:23,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:26:23,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:26:23,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:26:23,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:26:23,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:26:23,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:26:23,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:26:23,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:26:23,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:26:23,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:26:23,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:26:23,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:26:23,333 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-SemanticLbe.epf [2019-12-27 01:26:23,350 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:26:23,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:26:23,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:26:23,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:26:23,352 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:26:23,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:26:23,352 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:26:23,352 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:26:23,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:26:23,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:26:23,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:26:23,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:26:23,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:26:23,353 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:26:23,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:26:23,354 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:26:23,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:26:23,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:26:23,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:26:23,355 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:26:23,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:26:23,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:26:23,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:26:23,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:26:23,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:26:23,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:26:23,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:26:23,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:26:23,356 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:26:23,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:26:23,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:26:23,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:26:23,671 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:26:23,672 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:26:23,673 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_rmo.oepc.i [2019-12-27 01:26:23,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/960c95c50/aebb12f248304f3a931e8267071ec740/FLAG9aec39ba7 [2019-12-27 01:26:24,300 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:26:24,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_rmo.oepc.i [2019-12-27 01:26:24,322 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/960c95c50/aebb12f248304f3a931e8267071ec740/FLAG9aec39ba7 [2019-12-27 01:26:24,708 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/960c95c50/aebb12f248304f3a931e8267071ec740 [2019-12-27 01:26:24,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:26:24,719 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:26:24,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:26:24,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:26:24,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:26:24,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:26:24" (1/1) ... [2019-12-27 01:26:24,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64273e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:26:24, skipping insertion in model container [2019-12-27 01:26:24,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:26:24" (1/1) ... [2019-12-27 01:26:24,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:26:24,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:26:25,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:26:25,376 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:26:25,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:26:25,526 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:26:25,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:26:25 WrapperNode [2019-12-27 01:26:25,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:26:25,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:26:25,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:26:25,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:26:25,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:26:25" (1/1) ... [2019-12-27 01:26:25,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:26:25" (1/1) ... [2019-12-27 01:26:25,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:26:25,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:26:25,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:26:25,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:26:25,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:26:25" (1/1) ... [2019-12-27 01:26:25,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:26:25" (1/1) ... [2019-12-27 01:26:25,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:26:25" (1/1) ... [2019-12-27 01:26:25,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:26:25" (1/1) ... [2019-12-27 01:26:25,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:26:25" (1/1) ... [2019-12-27 01:26:25,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:26:25" (1/1) ... [2019-12-27 01:26:25,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:26:25" (1/1) ... [2019-12-27 01:26:25,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:26:25,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:26:25,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:26:25,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:26:25,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:26:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:26:25,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:26:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:26:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:26:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:26:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:26:25,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:26:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:26:25,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:26:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:26:25,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:26:25,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:26:25,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:26:25,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:26:25,714 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:26:26,479 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:26:26,480 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:26:26,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:26:26 BoogieIcfgContainer [2019-12-27 01:26:26,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:26:26,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:26:26,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:26:26,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:26:26,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:26:24" (1/3) ... [2019-12-27 01:26:26,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4887a9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:26:26, skipping insertion in model container [2019-12-27 01:26:26,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:26:25" (2/3) ... [2019-12-27 01:26:26,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4887a9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:26:26, skipping insertion in model container [2019-12-27 01:26:26,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:26:26" (3/3) ... [2019-12-27 01:26:26,492 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_rmo.oepc.i [2019-12-27 01:26:26,501 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:26:26,501 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:26:26,508 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:26:26,509 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:26:26,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,550 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,550 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,596 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,597 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,641 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,643 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,651 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,651 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,652 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,660 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,660 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:26:26,682 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:26:26,704 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:26:26,704 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:26:26,705 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:26:26,705 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:26:26,705 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:26:26,705 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:26:26,705 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:26:26,705 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:26:26,723 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 01:26:26,724 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 01:26:26,822 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 01:26:26,823 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:26:26,839 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:26:26,861 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 01:26:26,916 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 01:26:26,916 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:26:26,924 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:26:26,945 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:26:26,946 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:26:32,215 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 01:26:32,332 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 01:26:32,665 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 01:26:32,795 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 01:26:32,826 INFO L206 etLargeBlockEncoding]: Checked pairs total: 90866 [2019-12-27 01:26:32,826 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 01:26:32,830 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 103 transitions [2019-12-27 01:26:54,390 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123302 states. [2019-12-27 01:26:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 123302 states. [2019-12-27 01:26:54,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:26:54,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:54,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:26:54,398 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:54,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:54,403 INFO L82 PathProgramCache]: Analyzing trace with hash 918873, now seen corresponding path program 1 times [2019-12-27 01:26:54,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:54,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155954650] [2019-12-27 01:26:54,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:54,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155954650] [2019-12-27 01:26:54,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:54,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:26:54,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719025238] [2019-12-27 01:26:54,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:26:54,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:54,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:26:54,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:26:54,663 INFO L87 Difference]: Start difference. First operand 123302 states. Second operand 3 states. [2019-12-27 01:26:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:56,104 INFO L93 Difference]: Finished difference Result 122174 states and 518852 transitions. [2019-12-27 01:26:56,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:26:56,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:26:56,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:56,779 INFO L225 Difference]: With dead ends: 122174 [2019-12-27 01:26:56,779 INFO L226 Difference]: Without dead ends: 115076 [2019-12-27 01:26:56,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:05,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115076 states. [2019-12-27 01:27:07,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115076 to 115076. [2019-12-27 01:27:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115076 states. [2019-12-27 01:27:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115076 states to 115076 states and 488094 transitions. [2019-12-27 01:27:08,101 INFO L78 Accepts]: Start accepts. Automaton has 115076 states and 488094 transitions. Word has length 3 [2019-12-27 01:27:08,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:08,102 INFO L462 AbstractCegarLoop]: Abstraction has 115076 states and 488094 transitions. [2019-12-27 01:27:08,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 115076 states and 488094 transitions. [2019-12-27 01:27:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:27:08,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:08,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:08,106 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:08,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:08,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1360334080, now seen corresponding path program 1 times [2019-12-27 01:27:08,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:08,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684367226] [2019-12-27 01:27:08,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:08,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684367226] [2019-12-27 01:27:08,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:08,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:08,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871719841] [2019-12-27 01:27:08,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:27:08,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:08,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:27:08,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:27:08,266 INFO L87 Difference]: Start difference. First operand 115076 states and 488094 transitions. Second operand 4 states. [2019-12-27 01:27:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:13,502 INFO L93 Difference]: Finished difference Result 178684 states and 728513 transitions. [2019-12-27 01:27:13,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:27:13,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:27:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:14,237 INFO L225 Difference]: With dead ends: 178684 [2019-12-27 01:27:14,238 INFO L226 Difference]: Without dead ends: 178635 [2019-12-27 01:27:14,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:27:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178635 states. [2019-12-27 01:27:30,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178635 to 162755. [2019-12-27 01:27:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162755 states. [2019-12-27 01:27:30,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162755 states to 162755 states and 672033 transitions. [2019-12-27 01:27:30,687 INFO L78 Accepts]: Start accepts. Automaton has 162755 states and 672033 transitions. Word has length 11 [2019-12-27 01:27:30,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:30,687 INFO L462 AbstractCegarLoop]: Abstraction has 162755 states and 672033 transitions. [2019-12-27 01:27:30,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:27:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand 162755 states and 672033 transitions. [2019-12-27 01:27:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:27:30,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:30,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:30,699 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:30,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:30,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1888852276, now seen corresponding path program 1 times [2019-12-27 01:27:30,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:30,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115221502] [2019-12-27 01:27:30,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:30,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115221502] [2019-12-27 01:27:30,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:30,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:30,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130436608] [2019-12-27 01:27:30,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:30,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:30,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:30,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:30,784 INFO L87 Difference]: Start difference. First operand 162755 states and 672033 transitions. Second operand 3 states. [2019-12-27 01:27:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:30,934 INFO L93 Difference]: Finished difference Result 34587 states and 111811 transitions. [2019-12-27 01:27:30,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:30,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:27:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:31,013 INFO L225 Difference]: With dead ends: 34587 [2019-12-27 01:27:31,014 INFO L226 Difference]: Without dead ends: 34587 [2019-12-27 01:27:31,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:31,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34587 states. [2019-12-27 01:27:31,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34587 to 34587. [2019-12-27 01:27:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34587 states. [2019-12-27 01:27:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34587 states to 34587 states and 111811 transitions. [2019-12-27 01:27:31,748 INFO L78 Accepts]: Start accepts. Automaton has 34587 states and 111811 transitions. Word has length 13 [2019-12-27 01:27:31,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:31,749 INFO L462 AbstractCegarLoop]: Abstraction has 34587 states and 111811 transitions. [2019-12-27 01:27:31,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 34587 states and 111811 transitions. [2019-12-27 01:27:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:27:31,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:31,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:31,752 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:31,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:31,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1220224201, now seen corresponding path program 1 times [2019-12-27 01:27:31,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:31,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172256054] [2019-12-27 01:27:31,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:36,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172256054] [2019-12-27 01:27:36,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:36,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:27:36,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563015792] [2019-12-27 01:27:36,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:27:36,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:36,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:27:36,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:27:36,864 INFO L87 Difference]: Start difference. First operand 34587 states and 111811 transitions. Second operand 5 states. [2019-12-27 01:27:37,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:37,415 INFO L93 Difference]: Finished difference Result 47506 states and 151809 transitions. [2019-12-27 01:27:37,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:27:37,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 01:27:37,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:37,496 INFO L225 Difference]: With dead ends: 47506 [2019-12-27 01:27:37,497 INFO L226 Difference]: Without dead ends: 47506 [2019-12-27 01:27:37,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:27:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47506 states. [2019-12-27 01:27:38,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47506 to 39981. [2019-12-27 01:27:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39981 states. [2019-12-27 01:27:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39981 states to 39981 states and 128832 transitions. [2019-12-27 01:27:38,346 INFO L78 Accepts]: Start accepts. Automaton has 39981 states and 128832 transitions. Word has length 16 [2019-12-27 01:27:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:38,347 INFO L462 AbstractCegarLoop]: Abstraction has 39981 states and 128832 transitions. [2019-12-27 01:27:38,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:27:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 39981 states and 128832 transitions. [2019-12-27 01:27:38,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:27:38,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:38,357 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] [2019-12-27 01:27:38,357 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:38,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:38,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1720601530, now seen corresponding path program 1 times [2019-12-27 01:27:38,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:38,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539998075] [2019-12-27 01:27:38,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:38,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539998075] [2019-12-27 01:27:38,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:38,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:27:38,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144212203] [2019-12-27 01:27:38,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:27:38,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:38,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:27:38,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:27:38,456 INFO L87 Difference]: Start difference. First operand 39981 states and 128832 transitions. Second operand 6 states. [2019-12-27 01:27:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:39,350 INFO L93 Difference]: Finished difference Result 59624 states and 187628 transitions. [2019-12-27 01:27:39,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:27:39,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 01:27:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:39,441 INFO L225 Difference]: With dead ends: 59624 [2019-12-27 01:27:39,442 INFO L226 Difference]: Without dead ends: 59617 [2019-12-27 01:27:39,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:27:39,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59617 states. [2019-12-27 01:27:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59617 to 40463. [2019-12-27 01:27:40,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40463 states. [2019-12-27 01:27:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40463 states to 40463 states and 129749 transitions. [2019-12-27 01:27:40,593 INFO L78 Accepts]: Start accepts. Automaton has 40463 states and 129749 transitions. Word has length 22 [2019-12-27 01:27:40,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:40,594 INFO L462 AbstractCegarLoop]: Abstraction has 40463 states and 129749 transitions. [2019-12-27 01:27:40,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:27:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 40463 states and 129749 transitions. [2019-12-27 01:27:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:27:40,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:40,607 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:40,607 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:40,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:40,608 INFO L82 PathProgramCache]: Analyzing trace with hash -74763598, now seen corresponding path program 1 times [2019-12-27 01:27:40,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:40,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403951255] [2019-12-27 01:27:40,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:40,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403951255] [2019-12-27 01:27:40,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:40,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:27:40,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619806230] [2019-12-27 01:27:40,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:27:40,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:40,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:27:40,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:27:40,673 INFO L87 Difference]: Start difference. First operand 40463 states and 129749 transitions. Second operand 4 states. [2019-12-27 01:27:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:40,738 INFO L93 Difference]: Finished difference Result 16096 states and 48753 transitions. [2019-12-27 01:27:40,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:27:40,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:27:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:40,761 INFO L225 Difference]: With dead ends: 16096 [2019-12-27 01:27:40,761 INFO L226 Difference]: Without dead ends: 16096 [2019-12-27 01:27:40,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:27:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16096 states. [2019-12-27 01:27:40,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16096 to 15803. [2019-12-27 01:27:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15803 states. [2019-12-27 01:27:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15803 states to 15803 states and 47917 transitions. [2019-12-27 01:27:41,001 INFO L78 Accepts]: Start accepts. Automaton has 15803 states and 47917 transitions. Word has length 25 [2019-12-27 01:27:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:41,002 INFO L462 AbstractCegarLoop]: Abstraction has 15803 states and 47917 transitions. [2019-12-27 01:27:41,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:27:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 15803 states and 47917 transitions. [2019-12-27 01:27:41,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:27:41,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:41,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:41,014 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:41,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:41,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1856606199, now seen corresponding path program 1 times [2019-12-27 01:27:41,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:41,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407664117] [2019-12-27 01:27:41,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:41,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407664117] [2019-12-27 01:27:41,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:41,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:27:41,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903834468] [2019-12-27 01:27:41,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:27:41,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:41,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:27:41,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:27:41,115 INFO L87 Difference]: Start difference. First operand 15803 states and 47917 transitions. Second operand 6 states. [2019-12-27 01:27:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:41,705 INFO L93 Difference]: Finished difference Result 22779 states and 67340 transitions. [2019-12-27 01:27:41,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:27:41,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 01:27:41,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:41,748 INFO L225 Difference]: With dead ends: 22779 [2019-12-27 01:27:41,748 INFO L226 Difference]: Without dead ends: 22779 [2019-12-27 01:27:41,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:27:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22779 states. [2019-12-27 01:27:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22779 to 18120. [2019-12-27 01:27:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18120 states. [2019-12-27 01:27:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18120 states to 18120 states and 54739 transitions. [2019-12-27 01:27:42,110 INFO L78 Accepts]: Start accepts. Automaton has 18120 states and 54739 transitions. Word has length 27 [2019-12-27 01:27:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:42,111 INFO L462 AbstractCegarLoop]: Abstraction has 18120 states and 54739 transitions. [2019-12-27 01:27:42,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:27:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 18120 states and 54739 transitions. [2019-12-27 01:27:42,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:27:42,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:42,128 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] [2019-12-27 01:27:42,129 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:42,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:42,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1731527828, now seen corresponding path program 1 times [2019-12-27 01:27:42,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:42,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110415760] [2019-12-27 01:27:42,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:42,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110415760] [2019-12-27 01:27:42,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:42,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:27:42,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431423177] [2019-12-27 01:27:42,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:27:42,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:42,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:27:42,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:27:42,268 INFO L87 Difference]: Start difference. First operand 18120 states and 54739 transitions. Second operand 7 states. [2019-12-27 01:27:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:43,291 INFO L93 Difference]: Finished difference Result 24798 states and 73024 transitions. [2019-12-27 01:27:43,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:27:43,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 01:27:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:43,337 INFO L225 Difference]: With dead ends: 24798 [2019-12-27 01:27:43,338 INFO L226 Difference]: Without dead ends: 24798 [2019-12-27 01:27:43,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:27:43,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24798 states. [2019-12-27 01:27:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24798 to 16706. [2019-12-27 01:27:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16706 states. [2019-12-27 01:27:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16706 states to 16706 states and 50524 transitions. [2019-12-27 01:27:43,639 INFO L78 Accepts]: Start accepts. Automaton has 16706 states and 50524 transitions. Word has length 33 [2019-12-27 01:27:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:43,640 INFO L462 AbstractCegarLoop]: Abstraction has 16706 states and 50524 transitions. [2019-12-27 01:27:43,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:27:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 16706 states and 50524 transitions. [2019-12-27 01:27:43,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:27:43,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:43,661 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] [2019-12-27 01:27:43,662 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:43,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:43,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1723865273, now seen corresponding path program 1 times [2019-12-27 01:27:43,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:43,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613351313] [2019-12-27 01:27:43,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:43,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613351313] [2019-12-27 01:27:43,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:43,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:43,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658554799] [2019-12-27 01:27:43,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:43,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:43,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:43,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:43,719 INFO L87 Difference]: Start difference. First operand 16706 states and 50524 transitions. Second operand 3 states. [2019-12-27 01:27:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:43,826 INFO L93 Difference]: Finished difference Result 28297 states and 85903 transitions. [2019-12-27 01:27:43,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:43,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:27:43,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:43,847 INFO L225 Difference]: With dead ends: 28297 [2019-12-27 01:27:43,847 INFO L226 Difference]: Without dead ends: 14210 [2019-12-27 01:27:43,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14210 states. [2019-12-27 01:27:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14210 to 14150. [2019-12-27 01:27:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14150 states. [2019-12-27 01:27:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 42128 transitions. [2019-12-27 01:27:44,175 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 42128 transitions. Word has length 39 [2019-12-27 01:27:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:44,175 INFO L462 AbstractCegarLoop]: Abstraction has 14150 states and 42128 transitions. [2019-12-27 01:27:44,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 42128 transitions. [2019-12-27 01:27:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:27:44,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:44,191 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] [2019-12-27 01:27:44,192 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:44,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:44,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1940280365, now seen corresponding path program 2 times [2019-12-27 01:27:44,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:44,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999973096] [2019-12-27 01:27:44,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:44,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999973096] [2019-12-27 01:27:44,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:44,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:27:44,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230947654] [2019-12-27 01:27:44,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:44,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:44,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:44,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:44,260 INFO L87 Difference]: Start difference. First operand 14150 states and 42128 transitions. Second operand 3 states. [2019-12-27 01:27:44,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:44,338 INFO L93 Difference]: Finished difference Result 14149 states and 42126 transitions. [2019-12-27 01:27:44,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:44,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:27:44,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:44,369 INFO L225 Difference]: With dead ends: 14149 [2019-12-27 01:27:44,369 INFO L226 Difference]: Without dead ends: 14149 [2019-12-27 01:27:44,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:44,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14149 states. [2019-12-27 01:27:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14149 to 14149. [2019-12-27 01:27:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14149 states. [2019-12-27 01:27:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14149 states to 14149 states and 42126 transitions. [2019-12-27 01:27:44,708 INFO L78 Accepts]: Start accepts. Automaton has 14149 states and 42126 transitions. Word has length 39 [2019-12-27 01:27:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:44,708 INFO L462 AbstractCegarLoop]: Abstraction has 14149 states and 42126 transitions. [2019-12-27 01:27:44,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 14149 states and 42126 transitions. [2019-12-27 01:27:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:27:44,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:44,732 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] [2019-12-27 01:27:44,732 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:44,733 INFO L82 PathProgramCache]: Analyzing trace with hash 140069502, now seen corresponding path program 1 times [2019-12-27 01:27:44,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:44,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534533315] [2019-12-27 01:27:44,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:44,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534533315] [2019-12-27 01:27:44,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:44,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:27:44,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801930669] [2019-12-27 01:27:44,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:27:44,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:44,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:27:44,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:27:44,822 INFO L87 Difference]: Start difference. First operand 14149 states and 42126 transitions. Second operand 5 states. [2019-12-27 01:27:44,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:44,898 INFO L93 Difference]: Finished difference Result 13093 states and 39713 transitions. [2019-12-27 01:27:44,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:27:44,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:27:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:44,920 INFO L225 Difference]: With dead ends: 13093 [2019-12-27 01:27:44,920 INFO L226 Difference]: Without dead ends: 11563 [2019-12-27 01:27:44,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:27:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11563 states. [2019-12-27 01:27:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11563 to 11150. [2019-12-27 01:27:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11150 states. [2019-12-27 01:27:45,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11150 states to 11150 states and 34836 transitions. [2019-12-27 01:27:45,116 INFO L78 Accepts]: Start accepts. Automaton has 11150 states and 34836 transitions. Word has length 40 [2019-12-27 01:27:45,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:45,116 INFO L462 AbstractCegarLoop]: Abstraction has 11150 states and 34836 transitions. [2019-12-27 01:27:45,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:27:45,116 INFO L276 IsEmpty]: Start isEmpty. Operand 11150 states and 34836 transitions. [2019-12-27 01:27:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:27:45,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:45,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:45,129 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:45,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:45,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1749898488, now seen corresponding path program 1 times [2019-12-27 01:27:45,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:45,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670493365] [2019-12-27 01:27:45,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:45,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670493365] [2019-12-27 01:27:45,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:45,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:27:45,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57622216] [2019-12-27 01:27:45,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:45,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:45,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:45,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:45,185 INFO L87 Difference]: Start difference. First operand 11150 states and 34836 transitions. Second operand 3 states. [2019-12-27 01:27:45,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:45,285 INFO L93 Difference]: Finished difference Result 17888 states and 54761 transitions. [2019-12-27 01:27:45,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:45,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:27:45,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:45,321 INFO L225 Difference]: With dead ends: 17888 [2019-12-27 01:27:45,321 INFO L226 Difference]: Without dead ends: 17888 [2019-12-27 01:27:45,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:45,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17888 states. [2019-12-27 01:27:45,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17888 to 12900. [2019-12-27 01:27:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12900 states. [2019-12-27 01:27:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12900 states to 12900 states and 39991 transitions. [2019-12-27 01:27:45,749 INFO L78 Accepts]: Start accepts. Automaton has 12900 states and 39991 transitions. Word has length 64 [2019-12-27 01:27:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:45,749 INFO L462 AbstractCegarLoop]: Abstraction has 12900 states and 39991 transitions. [2019-12-27 01:27:45,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 12900 states and 39991 transitions. [2019-12-27 01:27:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:27:45,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:45,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:45,771 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:45,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:45,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1943324054, now seen corresponding path program 1 times [2019-12-27 01:27:45,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:45,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482257271] [2019-12-27 01:27:45,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:45,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482257271] [2019-12-27 01:27:45,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:45,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:27:45,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95564851] [2019-12-27 01:27:45,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:27:45,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:45,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:27:45,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:27:45,870 INFO L87 Difference]: Start difference. First operand 12900 states and 39991 transitions. Second operand 7 states. [2019-12-27 01:27:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:46,440 INFO L93 Difference]: Finished difference Result 37114 states and 114341 transitions. [2019-12-27 01:27:46,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:27:46,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:27:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:46,505 INFO L225 Difference]: With dead ends: 37114 [2019-12-27 01:27:46,506 INFO L226 Difference]: Without dead ends: 27250 [2019-12-27 01:27:46,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:27:46,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27250 states. [2019-12-27 01:27:46,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27250 to 15594. [2019-12-27 01:27:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15594 states. [2019-12-27 01:27:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15594 states to 15594 states and 48552 transitions. [2019-12-27 01:27:46,975 INFO L78 Accepts]: Start accepts. Automaton has 15594 states and 48552 transitions. Word has length 64 [2019-12-27 01:27:46,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:46,975 INFO L462 AbstractCegarLoop]: Abstraction has 15594 states and 48552 transitions. [2019-12-27 01:27:46,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:27:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 15594 states and 48552 transitions. [2019-12-27 01:27:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:27:46,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:46,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:46,996 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:46,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:46,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1388273988, now seen corresponding path program 2 times [2019-12-27 01:27:46,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:46,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749815117] [2019-12-27 01:27:46,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:47,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-27 01:27:47,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749815117] [2019-12-27 01:27:47,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:47,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:27:47,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870306370] [2019-12-27 01:27:47,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:27:47,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:47,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:27:47,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:27:47,100 INFO L87 Difference]: Start difference. First operand 15594 states and 48552 transitions. Second operand 7 states. [2019-12-27 01:27:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:47,538 INFO L93 Difference]: Finished difference Result 41160 states and 125962 transitions. [2019-12-27 01:27:47,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:27:47,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:27:47,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:47,730 INFO L225 Difference]: With dead ends: 41160 [2019-12-27 01:27:47,730 INFO L226 Difference]: Without dead ends: 29917 [2019-12-27 01:27:47,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:27:47,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29917 states. [2019-12-27 01:27:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29917 to 18174. [2019-12-27 01:27:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18174 states. [2019-12-27 01:27:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18174 states to 18174 states and 56555 transitions. [2019-12-27 01:27:48,103 INFO L78 Accepts]: Start accepts. Automaton has 18174 states and 56555 transitions. Word has length 64 [2019-12-27 01:27:48,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:48,103 INFO L462 AbstractCegarLoop]: Abstraction has 18174 states and 56555 transitions. [2019-12-27 01:27:48,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:27:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 18174 states and 56555 transitions. [2019-12-27 01:27:48,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:27:48,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:48,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:48,133 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:48,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:48,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1006987750, now seen corresponding path program 3 times [2019-12-27 01:27:48,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:48,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296106208] [2019-12-27 01:27:48,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:48,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296106208] [2019-12-27 01:27:48,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:48,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:27:48,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048146492] [2019-12-27 01:27:48,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:27:48,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:48,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:27:48,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:27:48,261 INFO L87 Difference]: Start difference. First operand 18174 states and 56555 transitions. Second operand 9 states. [2019-12-27 01:27:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:49,664 INFO L93 Difference]: Finished difference Result 69591 states and 211239 transitions. [2019-12-27 01:27:49,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 01:27:49,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:27:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:49,780 INFO L225 Difference]: With dead ends: 69591 [2019-12-27 01:27:49,780 INFO L226 Difference]: Without dead ends: 65149 [2019-12-27 01:27:49,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-27 01:27:49,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65149 states. [2019-12-27 01:27:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65149 to 18319. [2019-12-27 01:27:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18319 states. [2019-12-27 01:27:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18319 states to 18319 states and 57144 transitions. [2019-12-27 01:27:50,425 INFO L78 Accepts]: Start accepts. Automaton has 18319 states and 57144 transitions. Word has length 64 [2019-12-27 01:27:50,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:50,425 INFO L462 AbstractCegarLoop]: Abstraction has 18319 states and 57144 transitions. [2019-12-27 01:27:50,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:27:50,425 INFO L276 IsEmpty]: Start isEmpty. Operand 18319 states and 57144 transitions. [2019-12-27 01:27:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:27:50,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:50,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:50,446 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:50,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:50,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1302254906, now seen corresponding path program 1 times [2019-12-27 01:27:50,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:50,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402413156] [2019-12-27 01:27:50,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:50,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402413156] [2019-12-27 01:27:50,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:50,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:27:50,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209193562] [2019-12-27 01:27:50,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:50,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:50,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:50,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:50,501 INFO L87 Difference]: Start difference. First operand 18319 states and 57144 transitions. Second operand 3 states. [2019-12-27 01:27:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:50,621 INFO L93 Difference]: Finished difference Result 23765 states and 72382 transitions. [2019-12-27 01:27:50,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:50,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:27:50,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:50,652 INFO L225 Difference]: With dead ends: 23765 [2019-12-27 01:27:50,652 INFO L226 Difference]: Without dead ends: 23765 [2019-12-27 01:27:50,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:50,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23765 states. [2019-12-27 01:27:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23765 to 18819. [2019-12-27 01:27:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18819 states. [2019-12-27 01:27:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18819 states to 18819 states and 57725 transitions. [2019-12-27 01:27:50,982 INFO L78 Accepts]: Start accepts. Automaton has 18819 states and 57725 transitions. Word has length 64 [2019-12-27 01:27:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:50,982 INFO L462 AbstractCegarLoop]: Abstraction has 18819 states and 57725 transitions. [2019-12-27 01:27:50,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 18819 states and 57725 transitions. [2019-12-27 01:27:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:27:51,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:51,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:51,002 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:51,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:51,003 INFO L82 PathProgramCache]: Analyzing trace with hash 479548822, now seen corresponding path program 4 times [2019-12-27 01:27:51,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:51,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988328609] [2019-12-27 01:27:51,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:51,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-27 01:27:51,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988328609] [2019-12-27 01:27:51,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:51,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:27:51,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394342016] [2019-12-27 01:27:51,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:27:51,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:51,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:27:51,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:27:51,295 INFO L87 Difference]: Start difference. First operand 18819 states and 57725 transitions. Second operand 9 states. [2019-12-27 01:27:52,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:52,542 INFO L93 Difference]: Finished difference Result 63866 states and 192746 transitions. [2019-12-27 01:27:52,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:27:52,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:27:52,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:52,630 INFO L225 Difference]: With dead ends: 63866 [2019-12-27 01:27:52,631 INFO L226 Difference]: Without dead ends: 61442 [2019-12-27 01:27:52,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:27:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61442 states. [2019-12-27 01:27:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61442 to 18847. [2019-12-27 01:27:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18847 states. [2019-12-27 01:27:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18847 states to 18847 states and 57879 transitions. [2019-12-27 01:27:53,258 INFO L78 Accepts]: Start accepts. Automaton has 18847 states and 57879 transitions. Word has length 64 [2019-12-27 01:27:53,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:53,259 INFO L462 AbstractCegarLoop]: Abstraction has 18847 states and 57879 transitions. [2019-12-27 01:27:53,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:27:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 18847 states and 57879 transitions. [2019-12-27 01:27:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:27:53,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:53,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:53,279 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:53,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:53,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1651786320, now seen corresponding path program 5 times [2019-12-27 01:27:53,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:53,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713707731] [2019-12-27 01:27:53,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:53,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713707731] [2019-12-27 01:27:53,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:53,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:53,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518685803] [2019-12-27 01:27:53,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:53,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:53,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:53,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:53,349 INFO L87 Difference]: Start difference. First operand 18847 states and 57879 transitions. Second operand 3 states. [2019-12-27 01:27:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:53,466 INFO L93 Difference]: Finished difference Result 22647 states and 69341 transitions. [2019-12-27 01:27:53,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:53,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:27:53,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:53,499 INFO L225 Difference]: With dead ends: 22647 [2019-12-27 01:27:53,499 INFO L226 Difference]: Without dead ends: 22647 [2019-12-27 01:27:53,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22647 states. [2019-12-27 01:27:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22647 to 19666. [2019-12-27 01:27:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19666 states. [2019-12-27 01:27:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19666 states to 19666 states and 60576 transitions. [2019-12-27 01:27:53,846 INFO L78 Accepts]: Start accepts. Automaton has 19666 states and 60576 transitions. Word has length 64 [2019-12-27 01:27:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:53,847 INFO L462 AbstractCegarLoop]: Abstraction has 19666 states and 60576 transitions. [2019-12-27 01:27:53,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:53,847 INFO L276 IsEmpty]: Start isEmpty. Operand 19666 states and 60576 transitions. [2019-12-27 01:27:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:27:53,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:53,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:53,870 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:53,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:53,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1362059626, now seen corresponding path program 1 times [2019-12-27 01:27:53,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:53,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396761617] [2019-12-27 01:27:53,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:53,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396761617] [2019-12-27 01:27:53,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:53,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:27:53,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497975890] [2019-12-27 01:27:53,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:27:53,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:53,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:27:53,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:27:53,974 INFO L87 Difference]: Start difference. First operand 19666 states and 60576 transitions. Second operand 9 states. [2019-12-27 01:27:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:55,146 INFO L93 Difference]: Finished difference Result 55818 states and 167465 transitions. [2019-12-27 01:27:55,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:27:55,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:27:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:55,218 INFO L225 Difference]: With dead ends: 55818 [2019-12-27 01:27:55,218 INFO L226 Difference]: Without dead ends: 52885 [2019-12-27 01:27:55,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:27:55,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52885 states. [2019-12-27 01:27:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52885 to 19731. [2019-12-27 01:27:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19731 states. [2019-12-27 01:27:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19731 states to 19731 states and 60809 transitions. [2019-12-27 01:27:55,960 INFO L78 Accepts]: Start accepts. Automaton has 19731 states and 60809 transitions. Word has length 65 [2019-12-27 01:27:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:55,960 INFO L462 AbstractCegarLoop]: Abstraction has 19731 states and 60809 transitions. [2019-12-27 01:27:55,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:27:55,960 INFO L276 IsEmpty]: Start isEmpty. Operand 19731 states and 60809 transitions. [2019-12-27 01:27:55,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:27:55,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:55,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:55,980 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:55,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:55,980 INFO L82 PathProgramCache]: Analyzing trace with hash 938389066, now seen corresponding path program 2 times [2019-12-27 01:27:55,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:55,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67779759] [2019-12-27 01:27:55,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:56,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67779759] [2019-12-27 01:27:56,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:56,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:27:56,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698536809] [2019-12-27 01:27:56,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:27:56,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:56,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:27:56,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:27:56,081 INFO L87 Difference]: Start difference. First operand 19731 states and 60809 transitions. Second operand 9 states. [2019-12-27 01:27:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:57,250 INFO L93 Difference]: Finished difference Result 60486 states and 181076 transitions. [2019-12-27 01:27:57,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:27:57,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:27:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:57,323 INFO L225 Difference]: With dead ends: 60486 [2019-12-27 01:27:57,324 INFO L226 Difference]: Without dead ends: 57568 [2019-12-27 01:27:57,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:27:57,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57568 states. [2019-12-27 01:27:57,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57568 to 19623. [2019-12-27 01:27:57,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19623 states. [2019-12-27 01:27:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19623 states to 19623 states and 60279 transitions. [2019-12-27 01:27:57,940 INFO L78 Accepts]: Start accepts. Automaton has 19623 states and 60279 transitions. Word has length 65 [2019-12-27 01:27:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:57,940 INFO L462 AbstractCegarLoop]: Abstraction has 19623 states and 60279 transitions. [2019-12-27 01:27:57,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:27:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 19623 states and 60279 transitions. [2019-12-27 01:27:57,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:27:57,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:57,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:57,963 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:57,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:57,963 INFO L82 PathProgramCache]: Analyzing trace with hash -848247963, now seen corresponding path program 1 times [2019-12-27 01:27:57,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:57,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884905299] [2019-12-27 01:27:57,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:58,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884905299] [2019-12-27 01:27:58,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:58,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:58,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92297133] [2019-12-27 01:27:58,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:58,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:58,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:58,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:58,035 INFO L87 Difference]: Start difference. First operand 19623 states and 60279 transitions. Second operand 3 states. [2019-12-27 01:27:58,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:58,123 INFO L93 Difference]: Finished difference Result 19622 states and 60277 transitions. [2019-12-27 01:27:58,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:58,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:27:58,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:58,159 INFO L225 Difference]: With dead ends: 19622 [2019-12-27 01:27:58,159 INFO L226 Difference]: Without dead ends: 19622 [2019-12-27 01:27:58,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19622 states. [2019-12-27 01:27:58,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19622 to 16561. [2019-12-27 01:27:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16561 states. [2019-12-27 01:27:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16561 states to 16561 states and 51733 transitions. [2019-12-27 01:27:58,719 INFO L78 Accepts]: Start accepts. Automaton has 16561 states and 51733 transitions. Word has length 65 [2019-12-27 01:27:58,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:58,719 INFO L462 AbstractCegarLoop]: Abstraction has 16561 states and 51733 transitions. [2019-12-27 01:27:58,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 16561 states and 51733 transitions. [2019-12-27 01:27:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:27:58,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:58,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:58,755 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:58,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:58,756 INFO L82 PathProgramCache]: Analyzing trace with hash -458333570, now seen corresponding path program 1 times [2019-12-27 01:27:58,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:58,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917897614] [2019-12-27 01:27:58,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:58,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917897614] [2019-12-27 01:27:58,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:58,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:58,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052286507] [2019-12-27 01:27:58,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:58,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:58,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:58,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:58,901 INFO L87 Difference]: Start difference. First operand 16561 states and 51733 transitions. Second operand 3 states. [2019-12-27 01:27:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:58,992 INFO L93 Difference]: Finished difference Result 13763 states and 41987 transitions. [2019-12-27 01:27:58,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:58,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 01:27:58,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:59,022 INFO L225 Difference]: With dead ends: 13763 [2019-12-27 01:27:59,022 INFO L226 Difference]: Without dead ends: 13763 [2019-12-27 01:27:59,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13763 states. [2019-12-27 01:27:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13763 to 12314. [2019-12-27 01:27:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12314 states. [2019-12-27 01:27:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12314 states to 12314 states and 37568 transitions. [2019-12-27 01:27:59,506 INFO L78 Accepts]: Start accepts. Automaton has 12314 states and 37568 transitions. Word has length 66 [2019-12-27 01:27:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:59,506 INFO L462 AbstractCegarLoop]: Abstraction has 12314 states and 37568 transitions. [2019-12-27 01:27:59,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 12314 states and 37568 transitions. [2019-12-27 01:27:59,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:27:59,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:59,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:59,527 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:59,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:59,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1169670237, now seen corresponding path program 1 times [2019-12-27 01:27:59,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:59,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518466206] [2019-12-27 01:27:59,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:59,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518466206] [2019-12-27 01:27:59,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:59,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:27:59,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693835825] [2019-12-27 01:27:59,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:27:59,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:59,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:27:59,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:27:59,734 INFO L87 Difference]: Start difference. First operand 12314 states and 37568 transitions. Second operand 10 states. [2019-12-27 01:28:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:28:01,391 INFO L93 Difference]: Finished difference Result 23748 states and 72005 transitions. [2019-12-27 01:28:01,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:28:01,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:28:01,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:28:01,418 INFO L225 Difference]: With dead ends: 23748 [2019-12-27 01:28:01,418 INFO L226 Difference]: Without dead ends: 18285 [2019-12-27 01:28:01,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:28:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18285 states. [2019-12-27 01:28:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18285 to 12800. [2019-12-27 01:28:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12800 states. [2019-12-27 01:28:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12800 states to 12800 states and 38914 transitions. [2019-12-27 01:28:01,657 INFO L78 Accepts]: Start accepts. Automaton has 12800 states and 38914 transitions. Word has length 67 [2019-12-27 01:28:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:28:01,657 INFO L462 AbstractCegarLoop]: Abstraction has 12800 states and 38914 transitions. [2019-12-27 01:28:01,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:28:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 12800 states and 38914 transitions. [2019-12-27 01:28:01,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:28:01,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:28:01,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:28:01,670 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:28:01,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:28:01,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1087519045, now seen corresponding path program 2 times [2019-12-27 01:28:01,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:28:01,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854554154] [2019-12-27 01:28:01,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:28:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:28:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:28:01,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854554154] [2019-12-27 01:28:01,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:28:01,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:28:01,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872634090] [2019-12-27 01:28:01,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:28:01,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:28:01,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:28:01,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:28:01,861 INFO L87 Difference]: Start difference. First operand 12800 states and 38914 transitions. Second operand 11 states. [2019-12-27 01:28:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:28:03,770 INFO L93 Difference]: Finished difference Result 22768 states and 68521 transitions. [2019-12-27 01:28:03,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 01:28:03,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:28:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:28:03,795 INFO L225 Difference]: With dead ends: 22768 [2019-12-27 01:28:03,796 INFO L226 Difference]: Without dead ends: 18941 [2019-12-27 01:28:03,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:28:03,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18941 states. [2019-12-27 01:28:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18941 to 12836. [2019-12-27 01:28:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12836 states. [2019-12-27 01:28:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12836 states to 12836 states and 38868 transitions. [2019-12-27 01:28:04,028 INFO L78 Accepts]: Start accepts. Automaton has 12836 states and 38868 transitions. Word has length 67 [2019-12-27 01:28:04,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:28:04,028 INFO L462 AbstractCegarLoop]: Abstraction has 12836 states and 38868 transitions. [2019-12-27 01:28:04,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:28:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 12836 states and 38868 transitions. [2019-12-27 01:28:04,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:28:04,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:28:04,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:28:04,042 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:28:04,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:28:04,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1951872541, now seen corresponding path program 3 times [2019-12-27 01:28:04,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:28:04,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312982212] [2019-12-27 01:28:04,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:28:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:28:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:28:04,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312982212] [2019-12-27 01:28:04,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:28:04,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:28:04,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980004548] [2019-12-27 01:28:04,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:28:04,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:28:04,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:28:04,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:28:04,256 INFO L87 Difference]: Start difference. First operand 12836 states and 38868 transitions. Second operand 11 states. [2019-12-27 01:28:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:28:05,398 INFO L93 Difference]: Finished difference Result 29550 states and 89174 transitions. [2019-12-27 01:28:05,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 01:28:05,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:28:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:28:05,435 INFO L225 Difference]: With dead ends: 29550 [2019-12-27 01:28:05,435 INFO L226 Difference]: Without dead ends: 27007 [2019-12-27 01:28:05,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 01:28:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27007 states. [2019-12-27 01:28:05,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27007 to 15068. [2019-12-27 01:28:05,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15068 states. [2019-12-27 01:28:05,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15068 states to 15068 states and 45337 transitions. [2019-12-27 01:28:05,777 INFO L78 Accepts]: Start accepts. Automaton has 15068 states and 45337 transitions. Word has length 67 [2019-12-27 01:28:05,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:28:05,777 INFO L462 AbstractCegarLoop]: Abstraction has 15068 states and 45337 transitions. [2019-12-27 01:28:05,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:28:05,777 INFO L276 IsEmpty]: Start isEmpty. Operand 15068 states and 45337 transitions. [2019-12-27 01:28:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:28:05,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:28:05,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:28:05,794 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:28:05,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:28:05,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1574036275, now seen corresponding path program 4 times [2019-12-27 01:28:05,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:28:05,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919105252] [2019-12-27 01:28:05,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:28:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:28:06,006 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-27 01:28:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:28:06,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919105252] [2019-12-27 01:28:06,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:28:06,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:28:06,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135039963] [2019-12-27 01:28:06,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:28:06,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:28:06,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:28:06,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:28:06,107 INFO L87 Difference]: Start difference. First operand 15068 states and 45337 transitions. Second operand 11 states. [2019-12-27 01:28:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:28:07,007 INFO L93 Difference]: Finished difference Result 27573 states and 82492 transitions. [2019-12-27 01:28:07,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:28:07,007 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:28:07,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:28:07,036 INFO L225 Difference]: With dead ends: 27573 [2019-12-27 01:28:07,036 INFO L226 Difference]: Without dead ends: 22650 [2019-12-27 01:28:07,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:28:07,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22650 states. [2019-12-27 01:28:07,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22650 to 11994. [2019-12-27 01:28:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11994 states. [2019-12-27 01:28:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11994 states to 11994 states and 36244 transitions. [2019-12-27 01:28:07,294 INFO L78 Accepts]: Start accepts. Automaton has 11994 states and 36244 transitions. Word has length 67 [2019-12-27 01:28:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:28:07,294 INFO L462 AbstractCegarLoop]: Abstraction has 11994 states and 36244 transitions. [2019-12-27 01:28:07,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:28:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 11994 states and 36244 transitions. [2019-12-27 01:28:07,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:28:07,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:28:07,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:28:07,307 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:28:07,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:28:07,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1709159453, now seen corresponding path program 5 times [2019-12-27 01:28:07,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:28:07,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190748127] [2019-12-27 01:28:07,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:28:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:28:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:28:07,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190748127] [2019-12-27 01:28:07,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:28:07,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:28:07,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778399771] [2019-12-27 01:28:07,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:28:07,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:28:07,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:28:07,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:28:07,470 INFO L87 Difference]: Start difference. First operand 11994 states and 36244 transitions. Second operand 12 states. [2019-12-27 01:28:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:28:08,488 INFO L93 Difference]: Finished difference Result 22640 states and 68126 transitions. [2019-12-27 01:28:08,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:28:08,489 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 01:28:08,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:28:08,519 INFO L225 Difference]: With dead ends: 22640 [2019-12-27 01:28:08,519 INFO L226 Difference]: Without dead ends: 22413 [2019-12-27 01:28:08,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:28:08,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22413 states. [2019-12-27 01:28:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22413 to 11818. [2019-12-27 01:28:08,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11818 states. [2019-12-27 01:28:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11818 states to 11818 states and 35760 transitions. [2019-12-27 01:28:08,778 INFO L78 Accepts]: Start accepts. Automaton has 11818 states and 35760 transitions. Word has length 67 [2019-12-27 01:28:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:28:08,779 INFO L462 AbstractCegarLoop]: Abstraction has 11818 states and 35760 transitions. [2019-12-27 01:28:08,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:28:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 11818 states and 35760 transitions. [2019-12-27 01:28:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:28:08,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:28:08,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:28:08,790 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:28:08,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:28:08,791 INFO L82 PathProgramCache]: Analyzing trace with hash 656134515, now seen corresponding path program 6 times [2019-12-27 01:28:08,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:28:08,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220020597] [2019-12-27 01:28:08,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:28:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:28:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:28:08,904 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:28:08,904 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:28:08,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~a$r_buff1_thd0~0_203 0) (= 0 v_~a$r_buff1_thd1~0_191) (= v_~z~0_36 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t293~0.base_37|) 0) (= v_~a$r_buff0_thd0~0_228 0) (= 0 v_~a$r_buff0_thd1~0_317) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~a$r_buff0_thd2~0_205) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t293~0.base_37| 4)) (= v_~main$tmp_guard1~0_42 0) (= v_~a$r_buff0_thd3~0_430 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t293~0.base_37|) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= v_~__unbuffered_cnt~0_111 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x~0_176) (= v_~__unbuffered_p1_EBX~0_55 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= 0 |v_#NULL.base_4|) (= v_~a$mem_tmp~0_16 0) (= 0 v_~a$w_buff0_used~0_889) (= v_~a$w_buff0~0_416 0) (= v_~a$r_buff1_thd3~0_333 0) (= 0 v_~a$w_buff1_used~0_596) (= |v_#NULL.offset_4| 0) (= 0 v_~a$w_buff1~0_333) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t293~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t293~0.base_37|) |v_ULTIMATE.start_main_~#t293~0.offset_26| 0)) |v_#memory_int_23|) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t293~0.base_37| 1)) (= 0 v_~a$r_buff1_thd2~0_185) (= v_~a~0_191 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~__unbuffered_p2_EBX~0_48 0) (= 0 v_~weak$$choice0~0_13) (= v_~weak$$choice2~0_131 0) (= |v_ULTIMATE.start_main_~#t293~0.offset_26| 0) (= v_~y~0_31 0) (= 0 v_~a$read_delayed~0_8) (= v_~a$flush_delayed~0_26 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_59|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_228, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_127|, ~a~0=v_~a~0_191, ULTIMATE.start_main_~#t293~0.offset=|v_ULTIMATE.start_main_~#t293~0.offset_26|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_83|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ULTIMATE.start_main_~#t294~0.base=|v_ULTIMATE.start_main_~#t294~0.base_38|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_333, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_889, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_317, ULTIMATE.start_main_~#t295~0.base=|v_ULTIMATE.start_main_~#t295~0.base_30|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t295~0.offset=|v_ULTIMATE.start_main_~#t295~0.offset_18|, ~a$w_buff0~0=v_~a$w_buff0~0_416, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_203, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~x~0=v_~x~0_176, ULTIMATE.start_main_~#t294~0.offset=|v_ULTIMATE.start_main_~#t294~0.offset_26|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_67|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~a$w_buff1~0=v_~a$w_buff1~0_333, ~y~0=v_~y~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_55, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_191, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_430, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_26, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_36, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_596, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t293~0.base=|v_ULTIMATE.start_main_~#t293~0.base_37|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_~#t293~0.offset, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t294~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t295~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t295~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t294~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t293~0.base] because there is no mapped edge [2019-12-27 01:28:08,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L835-1-->L837: Formula: (and (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t294~0.base_13|) 0) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t294~0.base_13| 1) |v_#valid_40|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t294~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t294~0.base_13|) |v_ULTIMATE.start_main_~#t294~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t294~0.base_13|)) (= |v_ULTIMATE.start_main_~#t294~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t294~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t294~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t294~0.offset=|v_ULTIMATE.start_main_~#t294~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, ULTIMATE.start_main_~#t294~0.base=|v_ULTIMATE.start_main_~#t294~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t294~0.offset, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t294~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 01:28:08,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L4-->L750: Formula: (and (= v_~a$r_buff0_thd1~0_28 v_~a$r_buff1_thd1~0_23) (= v_~a$r_buff0_thd2~0_20 v_~a$r_buff1_thd2~0_16) (= v_~a$r_buff0_thd0~0_18 v_~a$r_buff1_thd0~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~a$r_buff0_thd1~0_27 1) (= 1 v_~x~0_7) (= v_~a$r_buff0_thd3~0_73 v_~a$r_buff1_thd3~0_40)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18} OutVars{~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_40, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_17, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 01:28:08,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L776-2-->L776-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In212748244 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In212748244 256)))) (or (and (or .cse0 .cse1) (= ~a~0_In212748244 |P1Thread1of1ForFork2_#t~ite9_Out212748244|)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out212748244| ~a$w_buff1~0_In212748244) (not .cse1)))) InVars {~a~0=~a~0_In212748244, ~a$w_buff1~0=~a$w_buff1~0_In212748244, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In212748244, ~a$w_buff1_used~0=~a$w_buff1_used~0_In212748244} OutVars{~a~0=~a~0_In212748244, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out212748244|, ~a$w_buff1~0=~a$w_buff1~0_In212748244, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In212748244, ~a$w_buff1_used~0=~a$w_buff1_used~0_In212748244} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 01:28:08,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_47) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_47, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:28:08,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1949462127 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1949462127 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1949462127 |P0Thread1of1ForFork1_#t~ite5_Out1949462127|)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out1949462127| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1949462127, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1949462127} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1949462127|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1949462127, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1949462127} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:28:08,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-1652142290 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-1652142290 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1652142290 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1652142290 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1652142290| 0)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1652142290| ~a$w_buff1_used~0_In-1652142290) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1652142290, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1652142290, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1652142290, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1652142290} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1652142290|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1652142290, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1652142290, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1652142290, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1652142290} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:28:08,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L753-->L754: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In610777824 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In610777824 256) 0))) (or (and (not .cse0) (not .cse1) (= ~a$r_buff0_thd1~0_Out610777824 0)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_Out610777824 ~a$r_buff0_thd1~0_In610777824)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In610777824, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In610777824} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out610777824|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In610777824, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out610777824} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:28:08,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In1671431857 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1671431857 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd1~0_In1671431857 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In1671431857 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out1671431857| ~a$r_buff1_thd1~0_In1671431857)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite8_Out1671431857| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1671431857, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1671431857, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1671431857, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1671431857} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1671431857|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1671431857, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1671431857, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1671431857, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1671431857} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:28:08,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L754-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_148 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_148, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:28:08,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t295~0.base_12| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t295~0.base_12|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t295~0.base_12|)) (= |v_ULTIMATE.start_main_~#t295~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t295~0.base_12| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t295~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t295~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t295~0.base_12|) |v_ULTIMATE.start_main_~#t295~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t295~0.offset=|v_ULTIMATE.start_main_~#t295~0.offset_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t295~0.base=|v_ULTIMATE.start_main_~#t295~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t295~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t295~0.base] because there is no mapped edge [2019-12-27 01:28:08,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In660041933 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In660041933| |P2Thread1of1ForFork0_#t~ite20_Out660041933|) (= |P2Thread1of1ForFork0_#t~ite21_Out660041933| ~a$w_buff0~0_In660041933) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out660041933| |P2Thread1of1ForFork0_#t~ite20_Out660041933|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In660041933 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In660041933 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In660041933 256)) (and (= 0 (mod ~a$w_buff1_used~0_In660041933 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite20_Out660041933| ~a$w_buff0~0_In660041933) .cse0))) InVars {~a$w_buff0~0=~a$w_buff0~0_In660041933, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In660041933, ~a$w_buff0_used~0=~a$w_buff0_used~0_In660041933, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In660041933, ~a$w_buff1_used~0=~a$w_buff1_used~0_In660041933, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In660041933|, ~weak$$choice2~0=~weak$$choice2~0_In660041933} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out660041933|, ~a$w_buff0~0=~a$w_buff0~0_In660041933, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In660041933, ~a$w_buff0_used~0=~a$w_buff0_used~0_In660041933, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In660041933, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out660041933|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In660041933, ~weak$$choice2~0=~weak$$choice2~0_In660041933} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 01:28:08,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L803-->L803-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1552736590 256)))) (or (and (= ~a$w_buff0_used~0_In-1552736590 |P2Thread1of1ForFork0_#t~ite26_Out-1552736590|) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1552736590 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-1552736590 256)) (and (= (mod ~a$w_buff1_used~0_In-1552736590 256) 0) .cse0) (and (= 0 (mod ~a$r_buff1_thd3~0_In-1552736590 256)) .cse0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite27_Out-1552736590| |P2Thread1of1ForFork0_#t~ite26_Out-1552736590|)) (and (= |P2Thread1of1ForFork0_#t~ite26_In-1552736590| |P2Thread1of1ForFork0_#t~ite26_Out-1552736590|) (= ~a$w_buff0_used~0_In-1552736590 |P2Thread1of1ForFork0_#t~ite27_Out-1552736590|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1552736590|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1552736590, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1552736590, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1552736590, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1552736590, ~weak$$choice2~0=~weak$$choice2~0_In-1552736590} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1552736590|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1552736590|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1552736590, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1552736590, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1552736590, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1552736590, ~weak$$choice2~0=~weak$$choice2~0_In-1552736590} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 01:28:08,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L804-->L804-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-852017631 256) 0))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-852017631 256) 0))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-852017631 256)) .cse0) (and (= (mod ~a$w_buff1_used~0_In-852017631 256) 0) .cse0) (= (mod ~a$w_buff0_used~0_In-852017631 256) 0))) (= |P2Thread1of1ForFork0_#t~ite30_Out-852017631| |P2Thread1of1ForFork0_#t~ite29_Out-852017631|) .cse1 (= ~a$w_buff1_used~0_In-852017631 |P2Thread1of1ForFork0_#t~ite29_Out-852017631|)) (and (= |P2Thread1of1ForFork0_#t~ite29_In-852017631| |P2Thread1of1ForFork0_#t~ite29_Out-852017631|) (= ~a$w_buff1_used~0_In-852017631 |P2Thread1of1ForFork0_#t~ite30_Out-852017631|) (not .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-852017631, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-852017631, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-852017631, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-852017631, ~weak$$choice2~0=~weak$$choice2~0_In-852017631, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-852017631|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-852017631, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-852017631, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-852017631, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-852017631|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-852017631, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-852017631|, ~weak$$choice2~0=~weak$$choice2~0_In-852017631} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:28:08,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L805-->L806: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~a$r_buff0_thd3~0_136 v_~a$r_buff0_thd3~0_135)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_135, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 01:28:08,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_12 0) (= v_~a~0_57 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_13 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_13} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_57, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 01:28:08,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L812-2-->L812-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1445556187 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1445556187 256)))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1445556187 |P2Thread1of1ForFork0_#t~ite38_Out1445556187|)) (and (or .cse0 .cse1) (= ~a~0_In1445556187 |P2Thread1of1ForFork0_#t~ite38_Out1445556187|)))) InVars {~a~0=~a~0_In1445556187, ~a$w_buff1~0=~a$w_buff1~0_In1445556187, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1445556187, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1445556187} OutVars{~a~0=~a~0_In1445556187, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1445556187|, ~a$w_buff1~0=~a$w_buff1~0_In1445556187, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1445556187, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1445556187} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:28:08,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L812-4-->L813: Formula: (= v_~a~0_20 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_20, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:28:08,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In955290594 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In955290594 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out955290594| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out955290594| ~a$w_buff0_used~0_In955290594)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In955290594, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In955290594} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out955290594|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In955290594, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In955290594} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:28:08,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1641501946 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1641501946 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In1641501946 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd3~0_In1641501946 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1641501946|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1641501946 |P2Thread1of1ForFork0_#t~ite41_Out1641501946|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1641501946, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1641501946, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1641501946, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1641501946} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1641501946, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1641501946, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1641501946, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1641501946, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1641501946|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:28:08,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1013845949 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1013845949 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1013845949| ~a$r_buff0_thd3~0_In-1013845949) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1013845949| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1013845949, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1013845949} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1013845949, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1013845949, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1013845949|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:28:08,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In1062392187 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1062392187 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In1062392187 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In1062392187 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1062392187|)) (and (= ~a$r_buff1_thd3~0_In1062392187 |P2Thread1of1ForFork0_#t~ite43_Out1062392187|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1062392187, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1062392187, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1062392187, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1062392187} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1062392187|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1062392187, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1062392187, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1062392187, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1062392187} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:28:08,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= v_~a$r_buff1_thd3~0_122 |v_P2Thread1of1ForFork0_#t~ite43_34|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_122, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:28:08,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1087242938 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In1087242938 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out1087242938| ~a$w_buff0_used~0_In1087242938) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1087242938| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1087242938, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1087242938} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1087242938, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1087242938, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1087242938|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:28:08,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1809014556 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1809014556 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1809014556 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-1809014556 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out-1809014556| ~a$w_buff1_used~0_In-1809014556)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1809014556|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1809014556, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1809014556, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1809014556, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1809014556} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1809014556, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1809014556, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1809014556, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1809014556|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1809014556} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:28:08,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1353326776 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1353326776 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In1353326776 |P1Thread1of1ForFork2_#t~ite13_Out1353326776|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1353326776|) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1353326776, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1353326776} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1353326776, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1353326776, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1353326776|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:28:08,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd2~0_In500004059 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In500004059 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In500004059 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In500004059 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out500004059| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out500004059| ~a$r_buff1_thd2~0_In500004059)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In500004059, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In500004059, ~a$w_buff0_used~0=~a$w_buff0_used~0_In500004059, ~a$w_buff1_used~0=~a$w_buff1_used~0_In500004059} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In500004059, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In500004059, ~a$w_buff0_used~0=~a$w_buff0_used~0_In500004059, ~a$w_buff1_used~0=~a$w_buff1_used~0_In500004059, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out500004059|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:28:08,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L780-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_79) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 01:28:08,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:28:08,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L845-2-->L845-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In1884599990 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1884599990 256) 0))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1884599990 |ULTIMATE.start_main_#t~ite47_Out1884599990|)) (and (= |ULTIMATE.start_main_#t~ite47_Out1884599990| ~a~0_In1884599990) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In1884599990, ~a$w_buff1~0=~a$w_buff1~0_In1884599990, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1884599990, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1884599990} OutVars{~a~0=~a~0_In1884599990, ~a$w_buff1~0=~a$w_buff1~0_In1884599990, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1884599990|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1884599990, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1884599990} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 01:28:08,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L845-4-->L846: Formula: (= v_~a~0_30 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_30, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 01:28:08,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1546674284 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1546674284 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1546674284| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1546674284| ~a$w_buff0_used~0_In-1546674284)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1546674284, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1546674284} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1546674284, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1546674284|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1546674284} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:28:08,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L847-->L847-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-1323231876 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-1323231876 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1323231876 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1323231876 256)))) (or (and (= ~a$w_buff1_used~0_In-1323231876 |ULTIMATE.start_main_#t~ite50_Out-1323231876|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1323231876|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1323231876, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1323231876, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1323231876, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1323231876} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1323231876|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1323231876, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1323231876, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1323231876, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1323231876} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:28:08,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1505735165 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1505735165 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1505735165| 0)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1505735165 |ULTIMATE.start_main_#t~ite51_Out1505735165|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1505735165, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1505735165} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1505735165|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1505735165, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1505735165} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:28:08,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1753602379 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1753602379 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1753602379 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-1753602379 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1753602379| ~a$r_buff1_thd0~0_In-1753602379) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1753602379| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1753602379, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1753602379, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1753602379, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1753602379} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1753602379|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1753602379, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1753602379, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1753602379, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1753602379} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:28:08,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~main$tmp_guard1~0_18 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_~a$r_buff1_thd0~0_158 |v_ULTIMATE.start_main_#t~ite52_40|) (= 2 v_~x~0_125) (= v_~__unbuffered_p1_EBX~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_18 256)) (= v_~__unbuffered_p2_EBX~0_24 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_158, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:28:09,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:28:09 BasicIcfg [2019-12-27 01:28:09,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:28:09,051 INFO L168 Benchmark]: Toolchain (without parser) took 104328.92 ms. Allocated memory was 146.3 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 101.3 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 01:28:09,051 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 01:28:09,052 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.95 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 155.8 MB in the end (delta: -54.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:28:09,052 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.47 ms. Allocated memory is still 203.4 MB. Free memory was 155.8 MB in the beginning and 153.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:28:09,056 INFO L168 Benchmark]: Boogie Preprocessor took 42.18 ms. Allocated memory is still 203.4 MB. Free memory was 153.2 MB in the beginning and 150.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:28:09,056 INFO L168 Benchmark]: RCFGBuilder took 835.12 ms. Allocated memory is still 203.4 MB. Free memory was 150.7 MB in the beginning and 100.1 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:28:09,057 INFO L168 Benchmark]: TraceAbstraction took 102562.88 ms. Allocated memory was 203.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 01:28:09,062 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.56 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.95 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 155.8 MB in the end (delta: -54.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.47 ms. Allocated memory is still 203.4 MB. Free memory was 155.8 MB in the beginning and 153.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.18 ms. Allocated memory is still 203.4 MB. Free memory was 153.2 MB in the beginning and 150.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.12 ms. Allocated memory is still 203.4 MB. Free memory was 150.7 MB in the beginning and 100.1 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102562.88 ms. Allocated memory was 203.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7568 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 97 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 90866 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t293, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t294, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 2 x = 2 [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y [L773] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L839] FCALL, FORK 0 pthread_create(&t295, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L790] 3 z = 1 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=2, y=1, z=1] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L812] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L845] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 102.2s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7179 SDtfs, 9886 SDslu, 27647 SDs, 0 SdLazy, 11185 SolverSat, 406 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 42 SyntacticMatches, 10 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162755occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 302204 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1379 NumberOfCodeBlocks, 1379 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1285 ConstructedInterpolants, 0 QuantifiedInterpolants, 236197 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...