/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:16:26,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:16:26,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:16:26,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:16:26,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:16:26,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:16:26,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:16:26,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:16:26,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:16:26,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:16:26,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:16:26,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:16:26,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:16:26,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:16:26,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:16:26,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:16:26,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:16:26,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:16:26,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:16:26,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:16:26,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:16:26,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:16:26,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:16:26,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:16:26,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:16:26,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:16:26,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:16:26,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:16:26,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:16:26,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:16:26,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:16:26,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:16:26,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:16:26,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:16:26,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:16:26,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:16:26,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:16:26,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:16:26,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:16:26,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:16:26,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:16:26,537 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:16:26,551 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:16:26,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:16:26,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:16:26,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:16:26,553 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:16:26,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:16:26,553 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:16:26,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:16:26,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:16:26,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:16:26,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:16:26,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:16:26,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:16:26,554 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:16:26,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:16:26,558 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:16:26,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:16:26,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:16:26,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:16:26,559 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:16:26,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:16:26,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:16:26,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:16:26,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:16:26,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:16:26,560 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:16:26,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:16:26,560 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:16:26,561 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:16:26,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:16:26,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:16:26,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:16:26,894 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:16:26,895 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:16:26,895 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:16:26,897 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.oepc.i [2019-12-27 06:16:26,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91bef1c0f/bbde0c15efa74df38f29a23a9c7ecd73/FLAG835aaea11 [2019-12-27 06:16:27,506 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:16:27,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_rmo.oepc.i [2019-12-27 06:16:27,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91bef1c0f/bbde0c15efa74df38f29a23a9c7ecd73/FLAG835aaea11 [2019-12-27 06:16:27,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91bef1c0f/bbde0c15efa74df38f29a23a9c7ecd73 [2019-12-27 06:16:27,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:16:27,794 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:16:27,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:16:27,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:16:27,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:16:27,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:16:27" (1/1) ... [2019-12-27 06:16:27,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@746c584f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:27, skipping insertion in model container [2019-12-27 06:16:27,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:16:27" (1/1) ... [2019-12-27 06:16:27,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:16:27,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:16:28,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:16:28,445 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:16:28,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:16:28,576 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:16:28,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:28 WrapperNode [2019-12-27 06:16:28,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:16:28,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:16:28,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:16:28,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:16:28,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:28" (1/1) ... [2019-12-27 06:16:28,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:28" (1/1) ... [2019-12-27 06:16:28,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:16:28,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:16:28,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:16:28,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:16:28,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:28" (1/1) ... [2019-12-27 06:16:28,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:28" (1/1) ... [2019-12-27 06:16:28,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:28" (1/1) ... [2019-12-27 06:16:28,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:28" (1/1) ... [2019-12-27 06:16:28,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:28" (1/1) ... [2019-12-27 06:16:28,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:28" (1/1) ... [2019-12-27 06:16:28,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:28" (1/1) ... [2019-12-27 06:16:28,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:16:28,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:16:28,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:16:28,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:16:28,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:28" (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 06:16:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:16:28,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:16:28,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:16:28,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:16:28,782 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:16:28,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:16:28,783 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:16:28,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:16:28,784 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:16:28,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:16:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:16:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:16:28,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:16:28,788 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 06:16:29,703 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:16:29,704 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:16:29,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:16:29 BoogieIcfgContainer [2019-12-27 06:16:29,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:16:29,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:16:29,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:16:29,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:16:29,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:16:27" (1/3) ... [2019-12-27 06:16:29,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ce1410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:16:29, skipping insertion in model container [2019-12-27 06:16:29,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:28" (2/3) ... [2019-12-27 06:16:29,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ce1410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:16:29, skipping insertion in model container [2019-12-27 06:16:29,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:16:29" (3/3) ... [2019-12-27 06:16:29,715 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_rmo.oepc.i [2019-12-27 06:16:29,726 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:16:29,726 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:16:29,734 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:16:29,735 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:16:29,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,781 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,782 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,782 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,784 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,785 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,798 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,815 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,831 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,831 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,858 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,860 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,868 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,868 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,868 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,870 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,870 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:29,887 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:16:29,907 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:16:29,908 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:16:29,908 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:16:29,908 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:16:29,908 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:16:29,908 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:16:29,908 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:16:29,908 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:16:29,925 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 06:16:29,927 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 06:16:30,026 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 06:16:30,026 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:16:30,043 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 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:16:30,073 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 06:16:30,132 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 06:16:30,132 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:16:30,150 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 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:16:30,173 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:16:30,175 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:16:33,668 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 06:16:33,809 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 06:16:33,845 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86659 [2019-12-27 06:16:33,845 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 06:16:33,850 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 107 transitions [2019-12-27 06:16:54,384 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123932 states. [2019-12-27 06:16:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 123932 states. [2019-12-27 06:16:54,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:16:54,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:54,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:16:54,392 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 06:16:54,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:54,398 INFO L82 PathProgramCache]: Analyzing trace with hash 916959, now seen corresponding path program 1 times [2019-12-27 06:16:54,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:54,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670872961] [2019-12-27 06:16:54,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:54,701 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 06:16:54,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670872961] [2019-12-27 06:16:54,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:54,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:16:54,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019902780] [2019-12-27 06:16:54,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:16:54,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:54,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:16:54,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:16:54,730 INFO L87 Difference]: Start difference. First operand 123932 states. Second operand 3 states. [2019-12-27 06:16:56,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:56,441 INFO L93 Difference]: Finished difference Result 123002 states and 528862 transitions. [2019-12-27 06:16:56,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:16:56,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:16:56,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:00,714 INFO L225 Difference]: With dead ends: 123002 [2019-12-27 06:17:00,714 INFO L226 Difference]: Without dead ends: 115358 [2019-12-27 06:17:00,715 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 06:17:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115358 states. [2019-12-27 06:17:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115358 to 115358. [2019-12-27 06:17:08,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115358 states. [2019-12-27 06:17:08,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115358 states to 115358 states and 495332 transitions. [2019-12-27 06:17:08,683 INFO L78 Accepts]: Start accepts. Automaton has 115358 states and 495332 transitions. Word has length 3 [2019-12-27 06:17:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:08,684 INFO L462 AbstractCegarLoop]: Abstraction has 115358 states and 495332 transitions. [2019-12-27 06:17:08,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand 115358 states and 495332 transitions. [2019-12-27 06:17:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:17:08,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:08,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:08,690 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 06:17:08,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1587788746, now seen corresponding path program 1 times [2019-12-27 06:17:08,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:08,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471133617] [2019-12-27 06:17:08,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:08,801 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 06:17:08,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471133617] [2019-12-27 06:17:08,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:08,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:08,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876540818] [2019-12-27 06:17:08,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:08,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:08,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:08,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:08,806 INFO L87 Difference]: Start difference. First operand 115358 states and 495332 transitions. Second operand 4 states. [2019-12-27 06:17:13,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:13,621 INFO L93 Difference]: Finished difference Result 179368 states and 739568 transitions. [2019-12-27 06:17:13,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:13,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:17:13,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:14,242 INFO L225 Difference]: With dead ends: 179368 [2019-12-27 06:17:14,242 INFO L226 Difference]: Without dead ends: 179319 [2019-12-27 06:17:14,243 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 06:17:20,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179319 states. [2019-12-27 06:17:28,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179319 to 163842. [2019-12-27 06:17:28,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163842 states. [2019-12-27 06:17:29,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163842 states to 163842 states and 684578 transitions. [2019-12-27 06:17:29,313 INFO L78 Accepts]: Start accepts. Automaton has 163842 states and 684578 transitions. Word has length 11 [2019-12-27 06:17:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:29,313 INFO L462 AbstractCegarLoop]: Abstraction has 163842 states and 684578 transitions. [2019-12-27 06:17:29,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 163842 states and 684578 transitions. [2019-12-27 06:17:29,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:17:29,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:29,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:29,320 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 06:17:29,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:29,320 INFO L82 PathProgramCache]: Analyzing trace with hash 245340836, now seen corresponding path program 1 times [2019-12-27 06:17:29,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:29,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608156316] [2019-12-27 06:17:29,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:29,377 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 06:17:29,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608156316] [2019-12-27 06:17:29,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:29,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:29,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962178086] [2019-12-27 06:17:29,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:29,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:29,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:29,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:29,380 INFO L87 Difference]: Start difference. First operand 163842 states and 684578 transitions. Second operand 3 states. [2019-12-27 06:17:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:29,548 INFO L93 Difference]: Finished difference Result 35474 states and 116324 transitions. [2019-12-27 06:17:29,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:29,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:17:29,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:29,630 INFO L225 Difference]: With dead ends: 35474 [2019-12-27 06:17:29,630 INFO L226 Difference]: Without dead ends: 35474 [2019-12-27 06:17:29,631 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 06:17:29,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35474 states. [2019-12-27 06:17:30,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35474 to 35474. [2019-12-27 06:17:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35474 states. [2019-12-27 06:17:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35474 states to 35474 states and 116324 transitions. [2019-12-27 06:17:35,831 INFO L78 Accepts]: Start accepts. Automaton has 35474 states and 116324 transitions. Word has length 13 [2019-12-27 06:17:35,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:35,832 INFO L462 AbstractCegarLoop]: Abstraction has 35474 states and 116324 transitions. [2019-12-27 06:17:35,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:35,832 INFO L276 IsEmpty]: Start isEmpty. Operand 35474 states and 116324 transitions. [2019-12-27 06:17:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:17:35,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:35,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:35,835 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 06:17:35,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:35,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1764199357, now seen corresponding path program 1 times [2019-12-27 06:17:35,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:35,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965193125] [2019-12-27 06:17:35,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:35,923 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 06:17:35,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965193125] [2019-12-27 06:17:35,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:35,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:35,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802726811] [2019-12-27 06:17:35,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:35,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:35,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:35,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:35,926 INFO L87 Difference]: Start difference. First operand 35474 states and 116324 transitions. Second operand 3 states. [2019-12-27 06:17:36,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:36,158 INFO L93 Difference]: Finished difference Result 53873 states and 176061 transitions. [2019-12-27 06:17:36,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:36,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 06:17:36,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:36,258 INFO L225 Difference]: With dead ends: 53873 [2019-12-27 06:17:36,258 INFO L226 Difference]: Without dead ends: 53873 [2019-12-27 06:17:36,259 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 06:17:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53873 states. [2019-12-27 06:17:36,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53873 to 40386. [2019-12-27 06:17:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40386 states. [2019-12-27 06:17:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40386 states to 40386 states and 133919 transitions. [2019-12-27 06:17:37,053 INFO L78 Accepts]: Start accepts. Automaton has 40386 states and 133919 transitions. Word has length 16 [2019-12-27 06:17:37,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:37,054 INFO L462 AbstractCegarLoop]: Abstraction has 40386 states and 133919 transitions. [2019-12-27 06:17:37,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 40386 states and 133919 transitions. [2019-12-27 06:17:37,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:17:37,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:37,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:37,058 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 06:17:37,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:37,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1679414171, now seen corresponding path program 1 times [2019-12-27 06:17:37,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:37,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298989015] [2019-12-27 06:17:37,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:37,123 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 06:17:37,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298989015] [2019-12-27 06:17:37,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:37,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:37,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106184564] [2019-12-27 06:17:37,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:37,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:37,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:37,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:37,126 INFO L87 Difference]: Start difference. First operand 40386 states and 133919 transitions. Second operand 4 states. [2019-12-27 06:17:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:37,505 INFO L93 Difference]: Finished difference Result 48153 states and 157153 transitions. [2019-12-27 06:17:37,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:37,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:17:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:37,582 INFO L225 Difference]: With dead ends: 48153 [2019-12-27 06:17:37,582 INFO L226 Difference]: Without dead ends: 48153 [2019-12-27 06:17:37,582 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 06:17:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48153 states. [2019-12-27 06:17:38,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48153 to 44290. [2019-12-27 06:17:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44290 states. [2019-12-27 06:17:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44290 states to 44290 states and 145673 transitions. [2019-12-27 06:17:38,736 INFO L78 Accepts]: Start accepts. Automaton has 44290 states and 145673 transitions. Word has length 16 [2019-12-27 06:17:38,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:38,736 INFO L462 AbstractCegarLoop]: Abstraction has 44290 states and 145673 transitions. [2019-12-27 06:17:38,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:38,736 INFO L276 IsEmpty]: Start isEmpty. Operand 44290 states and 145673 transitions. [2019-12-27 06:17:38,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:17:38,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:38,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:38,740 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 06:17:38,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:38,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1745863415, now seen corresponding path program 1 times [2019-12-27 06:17:38,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:38,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220314301] [2019-12-27 06:17:38,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:38,797 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 06:17:38,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220314301] [2019-12-27 06:17:38,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:38,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:38,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047183876] [2019-12-27 06:17:38,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:38,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:38,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:38,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:38,800 INFO L87 Difference]: Start difference. First operand 44290 states and 145673 transitions. Second operand 4 states. [2019-12-27 06:17:39,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:39,186 INFO L93 Difference]: Finished difference Result 52593 states and 171527 transitions. [2019-12-27 06:17:39,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:39,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:17:39,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:39,274 INFO L225 Difference]: With dead ends: 52593 [2019-12-27 06:17:39,274 INFO L226 Difference]: Without dead ends: 52593 [2019-12-27 06:17:39,275 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 06:17:39,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52593 states. [2019-12-27 06:17:40,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52593 to 45862. [2019-12-27 06:17:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45862 states. [2019-12-27 06:17:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45862 states to 45862 states and 150892 transitions. [2019-12-27 06:17:40,100 INFO L78 Accepts]: Start accepts. Automaton has 45862 states and 150892 transitions. Word has length 16 [2019-12-27 06:17:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:40,101 INFO L462 AbstractCegarLoop]: Abstraction has 45862 states and 150892 transitions. [2019-12-27 06:17:40,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 45862 states and 150892 transitions. [2019-12-27 06:17:40,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:17:40,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:40,111 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 06:17:40,111 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 06:17:40,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:40,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1921236917, now seen corresponding path program 1 times [2019-12-27 06:17:40,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:40,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172285545] [2019-12-27 06:17:40,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:40,221 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 06:17:40,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172285545] [2019-12-27 06:17:40,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:40,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:40,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084064057] [2019-12-27 06:17:40,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:40,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:40,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:40,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:40,223 INFO L87 Difference]: Start difference. First operand 45862 states and 150892 transitions. Second operand 5 states. [2019-12-27 06:17:41,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:41,197 INFO L93 Difference]: Finished difference Result 62673 states and 200938 transitions. [2019-12-27 06:17:41,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:17:41,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 06:17:41,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:41,307 INFO L225 Difference]: With dead ends: 62673 [2019-12-27 06:17:41,308 INFO L226 Difference]: Without dead ends: 62666 [2019-12-27 06:17:41,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:17:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62666 states. [2019-12-27 06:17:42,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62666 to 47202. [2019-12-27 06:17:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47202 states. [2019-12-27 06:17:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47202 states to 47202 states and 154985 transitions. [2019-12-27 06:17:42,224 INFO L78 Accepts]: Start accepts. Automaton has 47202 states and 154985 transitions. Word has length 22 [2019-12-27 06:17:42,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:42,224 INFO L462 AbstractCegarLoop]: Abstraction has 47202 states and 154985 transitions. [2019-12-27 06:17:42,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 47202 states and 154985 transitions. [2019-12-27 06:17:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:17:42,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:42,235 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 06:17:42,235 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 06:17:42,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:42,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1854787673, now seen corresponding path program 1 times [2019-12-27 06:17:42,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:42,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314234486] [2019-12-27 06:17:42,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:42,310 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 06:17:42,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314234486] [2019-12-27 06:17:42,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:42,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:42,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272919156] [2019-12-27 06:17:42,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:42,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:42,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:42,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:42,312 INFO L87 Difference]: Start difference. First operand 47202 states and 154985 transitions. Second operand 5 states. [2019-12-27 06:17:43,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:43,114 INFO L93 Difference]: Finished difference Result 65940 states and 210721 transitions. [2019-12-27 06:17:43,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:17:43,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 06:17:43,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:43,287 INFO L225 Difference]: With dead ends: 65940 [2019-12-27 06:17:43,287 INFO L226 Difference]: Without dead ends: 65933 [2019-12-27 06:17:43,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:17:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65933 states. [2019-12-27 06:17:44,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65933 to 45465. [2019-12-27 06:17:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45465 states. [2019-12-27 06:17:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45465 states to 45465 states and 149394 transitions. [2019-12-27 06:17:44,681 INFO L78 Accepts]: Start accepts. Automaton has 45465 states and 149394 transitions. Word has length 22 [2019-12-27 06:17:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:44,681 INFO L462 AbstractCegarLoop]: Abstraction has 45465 states and 149394 transitions. [2019-12-27 06:17:44,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 45465 states and 149394 transitions. [2019-12-27 06:17:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:17:44,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:44,693 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 06:17:44,694 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 06:17:44,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:44,694 INFO L82 PathProgramCache]: Analyzing trace with hash 145172187, now seen corresponding path program 1 times [2019-12-27 06:17:44,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:44,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740015974] [2019-12-27 06:17:44,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:44,759 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 06:17:44,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740015974] [2019-12-27 06:17:44,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:44,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:44,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276138750] [2019-12-27 06:17:44,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:44,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:44,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:44,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:44,762 INFO L87 Difference]: Start difference. First operand 45465 states and 149394 transitions. Second operand 4 states. [2019-12-27 06:17:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:44,838 INFO L93 Difference]: Finished difference Result 18727 states and 58359 transitions. [2019-12-27 06:17:44,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:17:44,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:17:44,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:44,867 INFO L225 Difference]: With dead ends: 18727 [2019-12-27 06:17:44,868 INFO L226 Difference]: Without dead ends: 18727 [2019-12-27 06:17:44,868 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 06:17:44,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18727 states. [2019-12-27 06:17:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18727 to 18364. [2019-12-27 06:17:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18364 states. [2019-12-27 06:17:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18364 states to 18364 states and 57323 transitions. [2019-12-27 06:17:45,142 INFO L78 Accepts]: Start accepts. Automaton has 18364 states and 57323 transitions. Word has length 25 [2019-12-27 06:17:45,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:45,142 INFO L462 AbstractCegarLoop]: Abstraction has 18364 states and 57323 transitions. [2019-12-27 06:17:45,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 18364 states and 57323 transitions. [2019-12-27 06:17:45,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:17:45,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:45,157 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 06:17:45,157 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 06:17:45,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:45,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2016642455, now seen corresponding path program 1 times [2019-12-27 06:17:45,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:45,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312078118] [2019-12-27 06:17:45,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:45,205 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 06:17:45,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312078118] [2019-12-27 06:17:45,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:45,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:45,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18710519] [2019-12-27 06:17:45,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:45,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:45,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:45,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:45,207 INFO L87 Difference]: Start difference. First operand 18364 states and 57323 transitions. Second operand 3 states. [2019-12-27 06:17:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:45,304 INFO L93 Difference]: Finished difference Result 24105 states and 71434 transitions. [2019-12-27 06:17:45,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:45,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 06:17:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:45,335 INFO L225 Difference]: With dead ends: 24105 [2019-12-27 06:17:45,336 INFO L226 Difference]: Without dead ends: 24105 [2019-12-27 06:17:45,336 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 06:17:45,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24105 states. [2019-12-27 06:17:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24105 to 18364. [2019-12-27 06:17:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18364 states. [2019-12-27 06:17:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18364 states to 18364 states and 54802 transitions. [2019-12-27 06:17:45,654 INFO L78 Accepts]: Start accepts. Automaton has 18364 states and 54802 transitions. Word has length 27 [2019-12-27 06:17:45,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:45,654 INFO L462 AbstractCegarLoop]: Abstraction has 18364 states and 54802 transitions. [2019-12-27 06:17:45,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 18364 states and 54802 transitions. [2019-12-27 06:17:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:17:45,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:45,667 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 06:17:45,667 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 06:17:45,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:45,667 INFO L82 PathProgramCache]: Analyzing trace with hash -364349975, now seen corresponding path program 1 times [2019-12-27 06:17:45,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:45,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422352818] [2019-12-27 06:17:45,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:45,731 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 06:17:45,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422352818] [2019-12-27 06:17:45,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:45,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:45,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785230541] [2019-12-27 06:17:45,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:45,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:45,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:45,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:45,733 INFO L87 Difference]: Start difference. First operand 18364 states and 54802 transitions. Second operand 5 states. [2019-12-27 06:17:46,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:46,168 INFO L93 Difference]: Finished difference Result 22570 states and 66509 transitions. [2019-12-27 06:17:46,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:17:46,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 06:17:46,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:46,212 INFO L225 Difference]: With dead ends: 22570 [2019-12-27 06:17:46,212 INFO L226 Difference]: Without dead ends: 22570 [2019-12-27 06:17:46,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22570 states. [2019-12-27 06:17:46,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22570 to 21200. [2019-12-27 06:17:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21200 states. [2019-12-27 06:17:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21200 states to 21200 states and 63046 transitions. [2019-12-27 06:17:46,616 INFO L78 Accepts]: Start accepts. Automaton has 21200 states and 63046 transitions. Word has length 27 [2019-12-27 06:17:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:46,617 INFO L462 AbstractCegarLoop]: Abstraction has 21200 states and 63046 transitions. [2019-12-27 06:17:46,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 21200 states and 63046 transitions. [2019-12-27 06:17:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:17:46,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:46,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:46,631 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 06:17:46,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:46,632 INFO L82 PathProgramCache]: Analyzing trace with hash 587647727, now seen corresponding path program 1 times [2019-12-27 06:17:46,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:46,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004904450] [2019-12-27 06:17:46,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:46,931 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 06:17:46,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004904450] [2019-12-27 06:17:46,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:46,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:46,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504576657] [2019-12-27 06:17:46,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:46,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:46,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:46,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:46,933 INFO L87 Difference]: Start difference. First operand 21200 states and 63046 transitions. Second operand 5 states. [2019-12-27 06:17:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:47,271 INFO L93 Difference]: Finished difference Result 24672 states and 72522 transitions. [2019-12-27 06:17:47,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:17:47,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 06:17:47,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:47,312 INFO L225 Difference]: With dead ends: 24672 [2019-12-27 06:17:47,312 INFO L226 Difference]: Without dead ends: 24672 [2019-12-27 06:17:47,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24672 states. [2019-12-27 06:17:47,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24672 to 21106. [2019-12-27 06:17:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21106 states. [2019-12-27 06:17:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21106 states to 21106 states and 62614 transitions. [2019-12-27 06:17:47,632 INFO L78 Accepts]: Start accepts. Automaton has 21106 states and 62614 transitions. Word has length 28 [2019-12-27 06:17:47,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:47,632 INFO L462 AbstractCegarLoop]: Abstraction has 21106 states and 62614 transitions. [2019-12-27 06:17:47,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:47,633 INFO L276 IsEmpty]: Start isEmpty. Operand 21106 states and 62614 transitions. [2019-12-27 06:17:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:17:47,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:47,652 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 06:17:47,653 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 06:17:47,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:47,653 INFO L82 PathProgramCache]: Analyzing trace with hash 688173209, now seen corresponding path program 1 times [2019-12-27 06:17:47,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:47,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123334242] [2019-12-27 06:17:47,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:47,733 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 06:17:47,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123334242] [2019-12-27 06:17:47,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:47,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:17:47,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169081717] [2019-12-27 06:17:47,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:17:47,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:47,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:17:47,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:17:47,736 INFO L87 Difference]: Start difference. First operand 21106 states and 62614 transitions. Second operand 6 states. [2019-12-27 06:17:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:48,433 INFO L93 Difference]: Finished difference Result 28374 states and 82992 transitions. [2019-12-27 06:17:48,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:17:48,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 06:17:48,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:48,470 INFO L225 Difference]: With dead ends: 28374 [2019-12-27 06:17:48,470 INFO L226 Difference]: Without dead ends: 28374 [2019-12-27 06:17:48,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:17:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28374 states. [2019-12-27 06:17:48,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28374 to 22550. [2019-12-27 06:17:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22550 states. [2019-12-27 06:17:48,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22550 states to 22550 states and 66975 transitions. [2019-12-27 06:17:48,832 INFO L78 Accepts]: Start accepts. Automaton has 22550 states and 66975 transitions. Word has length 33 [2019-12-27 06:17:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:48,833 INFO L462 AbstractCegarLoop]: Abstraction has 22550 states and 66975 transitions. [2019-12-27 06:17:48,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:17:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 22550 states and 66975 transitions. [2019-12-27 06:17:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:17:48,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:48,853 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] [2019-12-27 06:17:48,853 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 06:17:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:48,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1143871937, now seen corresponding path program 1 times [2019-12-27 06:17:48,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:48,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909785681] [2019-12-27 06:17:48,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:48,949 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 06:17:48,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909785681] [2019-12-27 06:17:48,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:48,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:17:48,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877300008] [2019-12-27 06:17:48,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:17:48,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:48,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:17:48,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:17:48,951 INFO L87 Difference]: Start difference. First operand 22550 states and 66975 transitions. Second operand 6 states. [2019-12-27 06:17:49,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:49,560 INFO L93 Difference]: Finished difference Result 27535 states and 80686 transitions. [2019-12-27 06:17:49,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:17:49,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 06:17:49,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:49,597 INFO L225 Difference]: With dead ends: 27535 [2019-12-27 06:17:49,597 INFO L226 Difference]: Without dead ends: 27535 [2019-12-27 06:17:49,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:17:49,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27535 states. [2019-12-27 06:17:49,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27535 to 19269. [2019-12-27 06:17:49,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19269 states. [2019-12-27 06:17:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19269 states to 19269 states and 57413 transitions. [2019-12-27 06:17:49,940 INFO L78 Accepts]: Start accepts. Automaton has 19269 states and 57413 transitions. Word has length 34 [2019-12-27 06:17:49,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:49,940 INFO L462 AbstractCegarLoop]: Abstraction has 19269 states and 57413 transitions. [2019-12-27 06:17:49,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:17:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 19269 states and 57413 transitions. [2019-12-27 06:17:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:17:49,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:49,960 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 06:17:49,960 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 06:17:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:49,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1024843726, now seen corresponding path program 1 times [2019-12-27 06:17:49,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:49,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244211233] [2019-12-27 06:17:49,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:50,028 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 06:17:50,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244211233] [2019-12-27 06:17:50,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:50,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:17:50,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057336065] [2019-12-27 06:17:50,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:50,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:50,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:50,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:50,031 INFO L87 Difference]: Start difference. First operand 19269 states and 57413 transitions. Second operand 3 states. [2019-12-27 06:17:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:50,103 INFO L93 Difference]: Finished difference Result 19268 states and 57411 transitions. [2019-12-27 06:17:50,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:50,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 06:17:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:50,129 INFO L225 Difference]: With dead ends: 19268 [2019-12-27 06:17:50,129 INFO L226 Difference]: Without dead ends: 19268 [2019-12-27 06:17:50,129 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 06:17:50,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2019-12-27 06:17:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 19268. [2019-12-27 06:17:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19268 states. [2019-12-27 06:17:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19268 states to 19268 states and 57411 transitions. [2019-12-27 06:17:50,563 INFO L78 Accepts]: Start accepts. Automaton has 19268 states and 57411 transitions. Word has length 39 [2019-12-27 06:17:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:50,564 INFO L462 AbstractCegarLoop]: Abstraction has 19268 states and 57411 transitions. [2019-12-27 06:17:50,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 19268 states and 57411 transitions. [2019-12-27 06:17:50,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:17:50,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:50,587 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 06:17:50,587 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 06:17:50,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:50,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1293195895, now seen corresponding path program 1 times [2019-12-27 06:17:50,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:50,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538570341] [2019-12-27 06:17:50,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:50,748 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 06:17:50,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538570341] [2019-12-27 06:17:50,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:50,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:50,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310487375] [2019-12-27 06:17:50,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:50,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:50,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:50,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:50,752 INFO L87 Difference]: Start difference. First operand 19268 states and 57411 transitions. Second operand 3 states. [2019-12-27 06:17:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:50,834 INFO L93 Difference]: Finished difference Result 19268 states and 57334 transitions. [2019-12-27 06:17:50,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:50,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 06:17:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:50,869 INFO L225 Difference]: With dead ends: 19268 [2019-12-27 06:17:50,869 INFO L226 Difference]: Without dead ends: 19268 [2019-12-27 06:17:50,870 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 06:17:50,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2019-12-27 06:17:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 17219. [2019-12-27 06:17:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17219 states. [2019-12-27 06:17:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17219 states to 17219 states and 51708 transitions. [2019-12-27 06:17:51,250 INFO L78 Accepts]: Start accepts. Automaton has 17219 states and 51708 transitions. Word has length 40 [2019-12-27 06:17:51,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:51,250 INFO L462 AbstractCegarLoop]: Abstraction has 17219 states and 51708 transitions. [2019-12-27 06:17:51,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand 17219 states and 51708 transitions. [2019-12-27 06:17:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 06:17:51,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:51,272 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] [2019-12-27 06:17:51,272 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 06:17:51,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:51,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1998295176, now seen corresponding path program 1 times [2019-12-27 06:17:51,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:51,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108293773] [2019-12-27 06:17:51,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:51,324 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 06:17:51,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108293773] [2019-12-27 06:17:51,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:51,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:17:51,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072585434] [2019-12-27 06:17:51,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:51,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:51,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:51,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:51,326 INFO L87 Difference]: Start difference. First operand 17219 states and 51708 transitions. Second operand 5 states. [2019-12-27 06:17:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:51,404 INFO L93 Difference]: Finished difference Result 16023 states and 49133 transitions. [2019-12-27 06:17:51,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:51,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 06:17:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:51,432 INFO L225 Difference]: With dead ends: 16023 [2019-12-27 06:17:51,433 INFO L226 Difference]: Without dead ends: 16023 [2019-12-27 06:17:51,433 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 06:17:51,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16023 states. [2019-12-27 06:17:51,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16023 to 16023. [2019-12-27 06:17:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16023 states. [2019-12-27 06:17:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16023 states to 16023 states and 49133 transitions. [2019-12-27 06:17:51,807 INFO L78 Accepts]: Start accepts. Automaton has 16023 states and 49133 transitions. Word has length 41 [2019-12-27 06:17:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:51,807 INFO L462 AbstractCegarLoop]: Abstraction has 16023 states and 49133 transitions. [2019-12-27 06:17:51,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 16023 states and 49133 transitions. [2019-12-27 06:17:51,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:17:51,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:51,832 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 06:17:51,832 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 06:17:51,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:51,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1498292074, now seen corresponding path program 1 times [2019-12-27 06:17:51,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:51,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290820064] [2019-12-27 06:17:51,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:51,922 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 06:17:51,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290820064] [2019-12-27 06:17:51,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:51,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:17:51,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065707732] [2019-12-27 06:17:51,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:17:51,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:51,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:17:51,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:51,924 INFO L87 Difference]: Start difference. First operand 16023 states and 49133 transitions. Second operand 7 states. [2019-12-27 06:17:52,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:52,356 INFO L93 Difference]: Finished difference Result 44825 states and 136460 transitions. [2019-12-27 06:17:52,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:17:52,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:17:52,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:52,404 INFO L225 Difference]: With dead ends: 44825 [2019-12-27 06:17:52,404 INFO L226 Difference]: Without dead ends: 34913 [2019-12-27 06:17:52,404 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 06:17:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34913 states. [2019-12-27 06:17:52,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34913 to 19456. [2019-12-27 06:17:52,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19456 states. [2019-12-27 06:17:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19456 states to 19456 states and 59789 transitions. [2019-12-27 06:17:52,824 INFO L78 Accepts]: Start accepts. Automaton has 19456 states and 59789 transitions. Word has length 65 [2019-12-27 06:17:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:52,824 INFO L462 AbstractCegarLoop]: Abstraction has 19456 states and 59789 transitions. [2019-12-27 06:17:52,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:17:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 19456 states and 59789 transitions. [2019-12-27 06:17:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:17:52,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:52,844 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 06:17:52,844 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 06:17:52,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:52,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1514990150, now seen corresponding path program 2 times [2019-12-27 06:17:52,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:52,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397610457] [2019-12-27 06:17:52,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:52,938 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 06:17:52,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397610457] [2019-12-27 06:17:52,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:52,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:17:52,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323073031] [2019-12-27 06:17:52,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:17:52,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:52,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:17:52,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:52,941 INFO L87 Difference]: Start difference. First operand 19456 states and 59789 transitions. Second operand 7 states. [2019-12-27 06:17:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:53,468 INFO L93 Difference]: Finished difference Result 51791 states and 156015 transitions. [2019-12-27 06:17:53,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:17:53,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:17:53,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:53,519 INFO L225 Difference]: With dead ends: 51791 [2019-12-27 06:17:53,519 INFO L226 Difference]: Without dead ends: 38002 [2019-12-27 06:17:53,520 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 06:17:53,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38002 states. [2019-12-27 06:17:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38002 to 23226. [2019-12-27 06:17:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23226 states. [2019-12-27 06:17:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23226 states to 23226 states and 70989 transitions. [2019-12-27 06:17:54,173 INFO L78 Accepts]: Start accepts. Automaton has 23226 states and 70989 transitions. Word has length 65 [2019-12-27 06:17:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:54,173 INFO L462 AbstractCegarLoop]: Abstraction has 23226 states and 70989 transitions. [2019-12-27 06:17:54,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:17:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 23226 states and 70989 transitions. [2019-12-27 06:17:54,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:17:54,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:54,199 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 06:17:54,199 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 06:17:54,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:54,200 INFO L82 PathProgramCache]: Analyzing trace with hash -118142618, now seen corresponding path program 3 times [2019-12-27 06:17:54,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:54,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093206617] [2019-12-27 06:17:54,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:54,279 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 06:17:54,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093206617] [2019-12-27 06:17:54,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:54,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:17:54,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730209653] [2019-12-27 06:17:54,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:17:54,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:54,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:17:54,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:54,281 INFO L87 Difference]: Start difference. First operand 23226 states and 70989 transitions. Second operand 7 states. [2019-12-27 06:17:54,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:54,826 INFO L93 Difference]: Finished difference Result 43950 states and 132286 transitions. [2019-12-27 06:17:54,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:17:54,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:17:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:54,913 INFO L225 Difference]: With dead ends: 43950 [2019-12-27 06:17:54,913 INFO L226 Difference]: Without dead ends: 41239 [2019-12-27 06:17:54,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:17:55,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41239 states. [2019-12-27 06:17:55,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41239 to 23322. [2019-12-27 06:17:55,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23322 states. [2019-12-27 06:17:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23322 states to 23322 states and 71333 transitions. [2019-12-27 06:17:55,426 INFO L78 Accepts]: Start accepts. Automaton has 23322 states and 71333 transitions. Word has length 65 [2019-12-27 06:17:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:55,426 INFO L462 AbstractCegarLoop]: Abstraction has 23322 states and 71333 transitions. [2019-12-27 06:17:55,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:17:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 23322 states and 71333 transitions. [2019-12-27 06:17:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:17:55,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:55,450 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 06:17:55,450 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 06:17:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:55,450 INFO L82 PathProgramCache]: Analyzing trace with hash 659589900, now seen corresponding path program 4 times [2019-12-27 06:17:55,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:55,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758931620] [2019-12-27 06:17:55,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:55,508 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 06:17:55,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758931620] [2019-12-27 06:17:55,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:55,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:55,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814407071] [2019-12-27 06:17:55,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:55,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:55,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:55,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:55,510 INFO L87 Difference]: Start difference. First operand 23322 states and 71333 transitions. Second operand 3 states. [2019-12-27 06:17:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:55,587 INFO L93 Difference]: Finished difference Result 19336 states and 58062 transitions. [2019-12-27 06:17:55,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:55,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:17:55,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:55,619 INFO L225 Difference]: With dead ends: 19336 [2019-12-27 06:17:55,619 INFO L226 Difference]: Without dead ends: 19336 [2019-12-27 06:17:55,619 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 06:17:55,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19336 states. [2019-12-27 06:17:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19336 to 18026. [2019-12-27 06:17:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18026 states. [2019-12-27 06:17:55,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18026 states to 18026 states and 54104 transitions. [2019-12-27 06:17:55,891 INFO L78 Accepts]: Start accepts. Automaton has 18026 states and 54104 transitions. Word has length 65 [2019-12-27 06:17:55,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:55,891 INFO L462 AbstractCegarLoop]: Abstraction has 18026 states and 54104 transitions. [2019-12-27 06:17:55,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 18026 states and 54104 transitions. [2019-12-27 06:17:55,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:17:55,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:55,916 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 06:17:55,916 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 06:17:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1170584375, now seen corresponding path program 1 times [2019-12-27 06:17:55,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:55,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447000664] [2019-12-27 06:17:55,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:56,089 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 06:17:56,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447000664] [2019-12-27 06:17:56,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:56,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:17:56,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017778252] [2019-12-27 06:17:56,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:17:56,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:56,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:17:56,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:17:56,093 INFO L87 Difference]: Start difference. First operand 18026 states and 54104 transitions. Second operand 10 states. [2019-12-27 06:17:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:57,288 INFO L93 Difference]: Finished difference Result 26751 states and 79972 transitions. [2019-12-27 06:17:57,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:17:57,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 06:17:57,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:57,316 INFO L225 Difference]: With dead ends: 26751 [2019-12-27 06:17:57,316 INFO L226 Difference]: Without dead ends: 21704 [2019-12-27 06:17:57,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:17:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21704 states. [2019-12-27 06:17:57,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21704 to 18388. [2019-12-27 06:17:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18388 states. [2019-12-27 06:17:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18388 states to 18388 states and 55085 transitions. [2019-12-27 06:17:57,615 INFO L78 Accepts]: Start accepts. Automaton has 18388 states and 55085 transitions. Word has length 66 [2019-12-27 06:17:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:57,615 INFO L462 AbstractCegarLoop]: Abstraction has 18388 states and 55085 transitions. [2019-12-27 06:17:57,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:17:57,615 INFO L276 IsEmpty]: Start isEmpty. Operand 18388 states and 55085 transitions. [2019-12-27 06:17:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:17:57,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:57,636 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 06:17:57,636 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 06:17:57,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:57,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1395385759, now seen corresponding path program 2 times [2019-12-27 06:17:57,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:57,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512010638] [2019-12-27 06:17:57,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:57,783 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 06:17:57,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512010638] [2019-12-27 06:17:57,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:57,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:17:57,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626603622] [2019-12-27 06:17:57,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:17:57,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:57,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:17:57,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:17:57,789 INFO L87 Difference]: Start difference. First operand 18388 states and 55085 transitions. Second operand 9 states. [2019-12-27 06:18:00,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:00,192 INFO L93 Difference]: Finished difference Result 32317 states and 95157 transitions. [2019-12-27 06:18:00,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 06:18:00,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 06:18:00,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:00,234 INFO L225 Difference]: With dead ends: 32317 [2019-12-27 06:18:00,234 INFO L226 Difference]: Without dead ends: 32101 [2019-12-27 06:18:00,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-27 06:18:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32101 states. [2019-12-27 06:18:00,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32101 to 21436. [2019-12-27 06:18:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21436 states. [2019-12-27 06:18:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21436 states to 21436 states and 63981 transitions. [2019-12-27 06:18:00,614 INFO L78 Accepts]: Start accepts. Automaton has 21436 states and 63981 transitions. Word has length 66 [2019-12-27 06:18:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:00,614 INFO L462 AbstractCegarLoop]: Abstraction has 21436 states and 63981 transitions. [2019-12-27 06:18:00,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:18:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 21436 states and 63981 transitions. [2019-12-27 06:18:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:18:00,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:00,635 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 06:18:00,635 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 06:18:00,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:00,635 INFO L82 PathProgramCache]: Analyzing trace with hash 562079971, now seen corresponding path program 3 times [2019-12-27 06:18:00,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:00,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250497254] [2019-12-27 06:18:00,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:00,811 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 06:18:00,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250497254] [2019-12-27 06:18:00,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:00,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:18:00,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500745064] [2019-12-27 06:18:00,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:18:00,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:00,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:18:00,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:18:00,813 INFO L87 Difference]: Start difference. First operand 21436 states and 63981 transitions. Second operand 10 states. [2019-12-27 06:18:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:02,037 INFO L93 Difference]: Finished difference Result 33465 states and 98764 transitions. [2019-12-27 06:18:02,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:18:02,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 06:18:02,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:02,075 INFO L225 Difference]: With dead ends: 33465 [2019-12-27 06:18:02,075 INFO L226 Difference]: Without dead ends: 27949 [2019-12-27 06:18:02,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:18:02,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27949 states. [2019-12-27 06:18:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27949 to 22039. [2019-12-27 06:18:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22039 states. [2019-12-27 06:18:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22039 states to 22039 states and 65385 transitions. [2019-12-27 06:18:02,427 INFO L78 Accepts]: Start accepts. Automaton has 22039 states and 65385 transitions. Word has length 66 [2019-12-27 06:18:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:02,428 INFO L462 AbstractCegarLoop]: Abstraction has 22039 states and 65385 transitions. [2019-12-27 06:18:02,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:18:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 22039 states and 65385 transitions. [2019-12-27 06:18:02,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:18:02,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:02,448 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 06:18:02,449 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 06:18:02,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:02,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2145503905, now seen corresponding path program 4 times [2019-12-27 06:18:02,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:02,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173066909] [2019-12-27 06:18:02,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:02,680 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 06:18:02,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173066909] [2019-12-27 06:18:02,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:02,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:18:02,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698710474] [2019-12-27 06:18:02,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:18:02,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:02,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:18:02,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:18:02,682 INFO L87 Difference]: Start difference. First operand 22039 states and 65385 transitions. Second operand 11 states. [2019-12-27 06:18:04,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:04,015 INFO L93 Difference]: Finished difference Result 32079 states and 94432 transitions. [2019-12-27 06:18:04,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:18:04,016 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 06:18:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:04,053 INFO L225 Difference]: With dead ends: 32079 [2019-12-27 06:18:04,054 INFO L226 Difference]: Without dead ends: 27629 [2019-12-27 06:18:04,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:18:04,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27629 states. [2019-12-27 06:18:04,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27629 to 21567. [2019-12-27 06:18:04,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21567 states. [2019-12-27 06:18:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21567 states to 21567 states and 64023 transitions. [2019-12-27 06:18:04,569 INFO L78 Accepts]: Start accepts. Automaton has 21567 states and 64023 transitions. Word has length 66 [2019-12-27 06:18:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:04,570 INFO L462 AbstractCegarLoop]: Abstraction has 21567 states and 64023 transitions. [2019-12-27 06:18:04,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:18:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 21567 states and 64023 transitions. [2019-12-27 06:18:04,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:18:04,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:04,590 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 06:18:04,590 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 06:18:04,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:04,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1023003475, now seen corresponding path program 5 times [2019-12-27 06:18:04,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:04,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637042118] [2019-12-27 06:18:04,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:04,763 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 06:18:04,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637042118] [2019-12-27 06:18:04,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:04,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:18:04,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383703182] [2019-12-27 06:18:04,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:18:04,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:04,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:18:04,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:18:04,766 INFO L87 Difference]: Start difference. First operand 21567 states and 64023 transitions. Second operand 11 states. [2019-12-27 06:18:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:05,961 INFO L93 Difference]: Finished difference Result 46782 states and 138339 transitions. [2019-12-27 06:18:05,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 06:18:05,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 06:18:05,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:06,011 INFO L225 Difference]: With dead ends: 46782 [2019-12-27 06:18:06,011 INFO L226 Difference]: Without dead ends: 35869 [2019-12-27 06:18:06,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 06:18:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35869 states. [2019-12-27 06:18:06,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35869 to 20487. [2019-12-27 06:18:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20487 states. [2019-12-27 06:18:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20487 states to 20487 states and 60660 transitions. [2019-12-27 06:18:06,416 INFO L78 Accepts]: Start accepts. Automaton has 20487 states and 60660 transitions. Word has length 66 [2019-12-27 06:18:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:06,416 INFO L462 AbstractCegarLoop]: Abstraction has 20487 states and 60660 transitions. [2019-12-27 06:18:06,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:18:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 20487 states and 60660 transitions. [2019-12-27 06:18:06,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:18:06,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:06,437 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 06:18:06,437 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 06:18:06,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:06,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1192462261, now seen corresponding path program 6 times [2019-12-27 06:18:06,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:06,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115592789] [2019-12-27 06:18:06,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:06,560 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 06:18:06,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115592789] [2019-12-27 06:18:06,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:06,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:18:06,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194727921] [2019-12-27 06:18:06,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:18:06,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:06,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:18:06,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:18:06,562 INFO L87 Difference]: Start difference. First operand 20487 states and 60660 transitions. Second operand 9 states. [2019-12-27 06:18:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:09,276 INFO L93 Difference]: Finished difference Result 36391 states and 105669 transitions. [2019-12-27 06:18:09,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:18:09,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 06:18:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:09,326 INFO L225 Difference]: With dead ends: 36391 [2019-12-27 06:18:09,326 INFO L226 Difference]: Without dead ends: 36007 [2019-12-27 06:18:09,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:18:09,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36007 states. [2019-12-27 06:18:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36007 to 21924. [2019-12-27 06:18:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21924 states. [2019-12-27 06:18:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21924 states to 21924 states and 65160 transitions. [2019-12-27 06:18:09,734 INFO L78 Accepts]: Start accepts. Automaton has 21924 states and 65160 transitions. Word has length 66 [2019-12-27 06:18:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:09,735 INFO L462 AbstractCegarLoop]: Abstraction has 21924 states and 65160 transitions. [2019-12-27 06:18:09,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:18:09,735 INFO L276 IsEmpty]: Start isEmpty. Operand 21924 states and 65160 transitions. [2019-12-27 06:18:09,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:18:09,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:09,757 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 06:18:09,757 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 06:18:09,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:09,757 INFO L82 PathProgramCache]: Analyzing trace with hash 781937257, now seen corresponding path program 7 times [2019-12-27 06:18:09,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:09,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042632325] [2019-12-27 06:18:09,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:10,041 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 06:18:10,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042632325] [2019-12-27 06:18:10,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:10,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 06:18:10,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042157611] [2019-12-27 06:18:10,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:18:10,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:10,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:18:10,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:18:10,044 INFO L87 Difference]: Start difference. First operand 21924 states and 65160 transitions. Second operand 14 states. [2019-12-27 06:18:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:13,738 INFO L93 Difference]: Finished difference Result 41514 states and 121028 transitions. [2019-12-27 06:18:13,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 06:18:13,739 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 06:18:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:13,792 INFO L225 Difference]: With dead ends: 41514 [2019-12-27 06:18:13,792 INFO L226 Difference]: Without dead ends: 41318 [2019-12-27 06:18:13,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 06:18:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41318 states. [2019-12-27 06:18:14,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41318 to 24806. [2019-12-27 06:18:14,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24806 states. [2019-12-27 06:18:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24806 states to 24806 states and 73390 transitions. [2019-12-27 06:18:14,282 INFO L78 Accepts]: Start accepts. Automaton has 24806 states and 73390 transitions. Word has length 66 [2019-12-27 06:18:14,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:14,282 INFO L462 AbstractCegarLoop]: Abstraction has 24806 states and 73390 transitions. [2019-12-27 06:18:14,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:18:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 24806 states and 73390 transitions. [2019-12-27 06:18:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:18:14,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:14,306 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 06:18:14,307 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:14,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:14,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2031770045, now seen corresponding path program 8 times [2019-12-27 06:18:14,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:14,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981205921] [2019-12-27 06:18:14,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:14,391 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 06:18:14,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981205921] [2019-12-27 06:18:14,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:14,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:18:14,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151320008] [2019-12-27 06:18:14,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:18:14,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:14,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:18:14,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:18:14,394 INFO L87 Difference]: Start difference. First operand 24806 states and 73390 transitions. Second operand 4 states. [2019-12-27 06:18:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:14,565 INFO L93 Difference]: Finished difference Result 28382 states and 84348 transitions. [2019-12-27 06:18:14,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:18:14,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 06:18:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:14,611 INFO L225 Difference]: With dead ends: 28382 [2019-12-27 06:18:14,611 INFO L226 Difference]: Without dead ends: 28382 [2019-12-27 06:18:14,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 06:18:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28382 states. [2019-12-27 06:18:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28382 to 21820. [2019-12-27 06:18:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21820 states. [2019-12-27 06:18:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21820 states to 21820 states and 65363 transitions. [2019-12-27 06:18:14,967 INFO L78 Accepts]: Start accepts. Automaton has 21820 states and 65363 transitions. Word has length 66 [2019-12-27 06:18:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:14,968 INFO L462 AbstractCegarLoop]: Abstraction has 21820 states and 65363 transitions. [2019-12-27 06:18:14,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:18:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 21820 states and 65363 transitions. [2019-12-27 06:18:14,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:14,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:14,991 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 06:18:14,991 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:14,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:14,991 INFO L82 PathProgramCache]: Analyzing trace with hash -328200473, now seen corresponding path program 1 times [2019-12-27 06:18:14,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:14,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768184965] [2019-12-27 06:18:14,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:15,029 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 06:18:15,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768184965] [2019-12-27 06:18:15,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:15,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:18:15,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984107715] [2019-12-27 06:18:15,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:18:15,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:15,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:18:15,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:15,031 INFO L87 Difference]: Start difference. First operand 21820 states and 65363 transitions. Second operand 3 states. [2019-12-27 06:18:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:15,334 INFO L93 Difference]: Finished difference Result 30013 states and 90034 transitions. [2019-12-27 06:18:15,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:18:15,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 06:18:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:15,404 INFO L225 Difference]: With dead ends: 30013 [2019-12-27 06:18:15,404 INFO L226 Difference]: Without dead ends: 30013 [2019-12-27 06:18:15,405 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 06:18:15,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30013 states. [2019-12-27 06:18:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30013 to 22502. [2019-12-27 06:18:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22502 states. [2019-12-27 06:18:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22502 states to 22502 states and 67565 transitions. [2019-12-27 06:18:15,873 INFO L78 Accepts]: Start accepts. Automaton has 22502 states and 67565 transitions. Word has length 67 [2019-12-27 06:18:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:15,874 INFO L462 AbstractCegarLoop]: Abstraction has 22502 states and 67565 transitions. [2019-12-27 06:18:15,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:18:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 22502 states and 67565 transitions. [2019-12-27 06:18:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:15,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:15,899 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 06:18:15,899 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:15,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:15,900 INFO L82 PathProgramCache]: Analyzing trace with hash 608064189, now seen corresponding path program 1 times [2019-12-27 06:18:15,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:15,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571932322] [2019-12-27 06:18:15,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:16,067 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 06:18:16,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571932322] [2019-12-27 06:18:16,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:16,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:18:16,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726351255] [2019-12-27 06:18:16,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:18:16,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:16,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:18:16,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:18:16,069 INFO L87 Difference]: Start difference. First operand 22502 states and 67565 transitions. Second operand 11 states. [2019-12-27 06:18:16,252 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-27 06:18:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:17,358 INFO L93 Difference]: Finished difference Result 26810 states and 79657 transitions. [2019-12-27 06:18:17,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:18:17,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:18:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:17,394 INFO L225 Difference]: With dead ends: 26810 [2019-12-27 06:18:17,394 INFO L226 Difference]: Without dead ends: 26415 [2019-12-27 06:18:17,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:18:17,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26415 states. [2019-12-27 06:18:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26415 to 22494. [2019-12-27 06:18:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22494 states. [2019-12-27 06:18:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22494 states to 22494 states and 67535 transitions. [2019-12-27 06:18:17,758 INFO L78 Accepts]: Start accepts. Automaton has 22494 states and 67535 transitions. Word has length 67 [2019-12-27 06:18:17,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:17,758 INFO L462 AbstractCegarLoop]: Abstraction has 22494 states and 67535 transitions. [2019-12-27 06:18:17,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:18:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 22494 states and 67535 transitions. [2019-12-27 06:18:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:17,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:17,783 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 06:18:17,783 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:17,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:17,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1394809923, now seen corresponding path program 2 times [2019-12-27 06:18:17,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:17,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709735419] [2019-12-27 06:18:17,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:17,941 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 06:18:17,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709735419] [2019-12-27 06:18:17,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:17,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:18:17,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131121402] [2019-12-27 06:18:17,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:18:17,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:17,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:18:17,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:18:17,943 INFO L87 Difference]: Start difference. First operand 22494 states and 67535 transitions. Second operand 11 states. [2019-12-27 06:18:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:18,890 INFO L93 Difference]: Finished difference Result 38442 states and 115758 transitions. [2019-12-27 06:18:18,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:18:18,891 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:18:18,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:18,945 INFO L225 Difference]: With dead ends: 38442 [2019-12-27 06:18:18,945 INFO L226 Difference]: Without dead ends: 37971 [2019-12-27 06:18:18,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:18:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37971 states. [2019-12-27 06:18:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37971 to 22234. [2019-12-27 06:18:19,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22234 states. [2019-12-27 06:18:19,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22234 states to 22234 states and 66869 transitions. [2019-12-27 06:18:19,390 INFO L78 Accepts]: Start accepts. Automaton has 22234 states and 66869 transitions. Word has length 67 [2019-12-27 06:18:19,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:19,390 INFO L462 AbstractCegarLoop]: Abstraction has 22234 states and 66869 transitions. [2019-12-27 06:18:19,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:18:19,391 INFO L276 IsEmpty]: Start isEmpty. Operand 22234 states and 66869 transitions. [2019-12-27 06:18:19,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:18:19,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:19,416 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 06:18:19,416 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:19,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:19,417 INFO L82 PathProgramCache]: Analyzing trace with hash -614399051, now seen corresponding path program 3 times [2019-12-27 06:18:19,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:19,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350177128] [2019-12-27 06:18:19,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:18:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:18:19,545 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:18:19,546 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:18:19,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= |v_ULTIMATE.start_main_~#t925~0.offset_19| 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~a$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~a$read_delayed~0_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t925~0.base_26| 1) |v_#valid_64|) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~a$r_buff1_thd3~0_48) (= v_~__unbuffered_p2_EBX~0_16 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z~0_7) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff1~0_23) (= 0 v_~a$w_buff0_used~0_113) (= v_~a$flush_delayed~0_13 0) (= 0 v_~a$r_buff1_thd1~0_18) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 v_~weak$$choice0~0_7) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t925~0.base_26| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t925~0.base_26|) |v_ULTIMATE.start_main_~#t925~0.offset_19| 0)) |v_#memory_int_19|) (= v_~a$r_buff0_thd1~0_28 0) (= v_~a$mem_tmp~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_#NULL.base_7|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t925~0.base_26| 4)) (= 0 v_~y~0_8) (= v_~a$r_buff0_thd2~0_21 0) (= v_~main$tmp_guard1~0_15 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t925~0.base_26|) 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t925~0.base_26|) (= 0 v_~a$w_buff0~0_26) (= v_~a$r_buff0_thd3~0_79 0) (= 0 v_~a$w_buff1_used~0_68) (= 0 v_~a$r_buff1_thd2~0_18) (= v_~a~0_27 0) (= v_~a$r_buff0_thd0~0_21 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ULTIMATE.start_main_~#t926~0.offset=|v_ULTIMATE.start_main_~#t926~0.offset_16|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ULTIMATE.start_main_~#t926~0.base=|v_ULTIMATE.start_main_~#t926~0.base_21|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ULTIMATE.start_main_~#t927~0.offset=|v_ULTIMATE.start_main_~#t927~0.offset_14|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ULTIMATE.start_main_~#t925~0.base=|v_ULTIMATE.start_main_~#t925~0.base_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t927~0.base=|v_ULTIMATE.start_main_~#t927~0.base_17|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ULTIMATE.start_main_~#t925~0.offset=|v_ULTIMATE.start_main_~#t925~0.offset_19|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~a$w_buff1~0=v_~a$w_buff1~0_23, ~y~0=v_~y~0_8, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_7, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} 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_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t926~0.offset, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t926~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t927~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t925~0.base, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t927~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t925~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~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] because there is no mapped edge [2019-12-27 06:18:19,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L750: Formula: (and (= 1 ~a$r_buff0_thd1~0_Out323824096) (= ~a$r_buff0_thd2~0_In323824096 ~a$r_buff1_thd2~0_Out323824096) (= ~x~0_In323824096 ~__unbuffered_p0_EAX~0_Out323824096) (= ~a$r_buff1_thd1~0_Out323824096 ~a$r_buff0_thd1~0_In323824096) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In323824096)) (= ~a$r_buff0_thd0~0_In323824096 ~a$r_buff1_thd0~0_Out323824096) (= ~a$r_buff1_thd3~0_Out323824096 ~a$r_buff0_thd3~0_In323824096)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In323824096, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In323824096, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In323824096, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In323824096, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In323824096, ~x~0=~x~0_In323824096} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out323824096, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out323824096, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out323824096, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out323824096, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In323824096, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out323824096, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In323824096, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In323824096, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out323824096, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In323824096, ~x~0=~x~0_In323824096} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~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] because there is no mapped edge [2019-12-27 06:18:19,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t926~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t926~0.base_11|) |v_ULTIMATE.start_main_~#t926~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t926~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t926~0.base_11|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t926~0.base_11|) 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t926~0.base_11| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t926~0.base_11| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t926~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t926~0.offset=|v_ULTIMATE.start_main_~#t926~0.offset_10|, ULTIMATE.start_main_~#t926~0.base=|v_ULTIMATE.start_main_~#t926~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t926~0.offset, ULTIMATE.start_main_~#t926~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 06:18:19,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In136233075 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In136233075 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out136233075| ~a$w_buff1~0_In136233075)) (and (or .cse0 .cse1) (= ~a~0_In136233075 |P1Thread1of1ForFork2_#t~ite9_Out136233075|)))) InVars {~a~0=~a~0_In136233075, ~a$w_buff1~0=~a$w_buff1~0_In136233075, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In136233075, ~a$w_buff1_used~0=~a$w_buff1_used~0_In136233075} OutVars{~a~0=~a~0_In136233075, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out136233075|, ~a$w_buff1~0=~a$w_buff1~0_In136233075, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In136233075, ~a$w_buff1_used~0=~a$w_buff1_used~0_In136233075} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 06:18:19,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= v_~a~0_22 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_22, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 06:18:19,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-844192812 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-844192812 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-844192812|) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-844192812| ~a$w_buff0_used~0_In-844192812) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-844192812, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-844192812} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-844192812, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-844192812, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-844192812|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:18:19,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In257458210 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In257458210 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In257458210 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In257458210 256)))) (or (and (= ~a$w_buff1_used~0_In257458210 |P1Thread1of1ForFork2_#t~ite12_Out257458210|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite12_Out257458210| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In257458210, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In257458210, ~a$w_buff0_used~0=~a$w_buff0_used~0_In257458210, ~a$w_buff1_used~0=~a$w_buff1_used~0_In257458210} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In257458210, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In257458210, ~a$w_buff0_used~0=~a$w_buff0_used~0_In257458210, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out257458210|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In257458210} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 06:18:19,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1811078579 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1811078579 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1811078579| 0)) (and (= ~a$r_buff0_thd2~0_In-1811078579 |P1Thread1of1ForFork2_#t~ite13_Out-1811078579|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1811078579, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1811078579} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1811078579, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1811078579, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1811078579|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 06:18:19,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In18673597 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In18673597 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In18673597 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In18673597 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out18673597| ~a$r_buff1_thd2~0_In18673597)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite14_Out18673597| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In18673597, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In18673597, ~a$w_buff0_used~0=~a$w_buff0_used~0_In18673597, ~a$w_buff1_used~0=~a$w_buff1_used~0_In18673597} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In18673597, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In18673597, ~a$w_buff0_used~0=~a$w_buff0_used~0_In18673597, ~a$w_buff1_used~0=~a$w_buff1_used~0_In18673597, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out18673597|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 06:18:19,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, 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 06:18:19,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1859028873 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1859028873 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out1859028873| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1859028873 |P0Thread1of1ForFork1_#t~ite5_Out1859028873|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1859028873, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1859028873} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1859028873|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1859028873, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1859028873} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 06:18:19,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In484703055 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd1~0_In484703055 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In484703055 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In484703055 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out484703055|)) (and (= ~a$w_buff1_used~0_In484703055 |P0Thread1of1ForFork1_#t~ite6_Out484703055|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In484703055, ~a$w_buff0_used~0=~a$w_buff0_used~0_In484703055, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In484703055, ~a$w_buff1_used~0=~a$w_buff1_used~0_In484703055} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out484703055|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In484703055, ~a$w_buff0_used~0=~a$w_buff0_used~0_In484703055, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In484703055, ~a$w_buff1_used~0=~a$w_buff1_used~0_In484703055} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 06:18:19,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In383160270 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In383160270 256) 0))) (or (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out383160270) (not .cse1)) (and (= ~a$r_buff0_thd1~0_In383160270 ~a$r_buff0_thd1~0_Out383160270) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In383160270, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In383160270} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out383160270|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In383160270, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out383160270} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:18:19,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In1303759065 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In1303759065 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In1303759065 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In1303759065 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out1303759065| 0)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out1303759065| ~a$r_buff1_thd1~0_In1303759065) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1303759065, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1303759065, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1303759065, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1303759065} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1303759065|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1303759065, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1303759065, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1303759065, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1303759065} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:18:19,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L754-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~a$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} 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 06:18:19,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L834-1-->L836: Formula: (and (= |v_ULTIMATE.start_main_~#t927~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t927~0.base_11|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t927~0.base_11|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t927~0.base_11| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t927~0.base_11|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t927~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t927~0.base_11|) |v_ULTIMATE.start_main_~#t927~0.offset_10| 2))) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t927~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t927~0.base=|v_ULTIMATE.start_main_~#t927~0.base_11|, ULTIMATE.start_main_~#t927~0.offset=|v_ULTIMATE.start_main_~#t927~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t927~0.base, ULTIMATE.start_main_~#t927~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 06:18:19,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L801-->L801-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2069744263 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-2069744263 256)))) (or (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-2069744263 256))) (and (= (mod ~a$w_buff1_used~0_In-2069744263 256) 0) .cse0) (= 0 (mod ~a$w_buff0_used~0_In-2069744263 256)))) (= ~a$w_buff1_used~0_In-2069744263 |P2Thread1of1ForFork0_#t~ite29_Out-2069744263|) .cse1 (= |P2Thread1of1ForFork0_#t~ite30_Out-2069744263| |P2Thread1of1ForFork0_#t~ite29_Out-2069744263|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite29_In-2069744263| |P2Thread1of1ForFork0_#t~ite29_Out-2069744263|) (= |P2Thread1of1ForFork0_#t~ite30_Out-2069744263| ~a$w_buff1_used~0_In-2069744263)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2069744263, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2069744263, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2069744263, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2069744263, ~weak$$choice2~0=~weak$$choice2~0_In-2069744263, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-2069744263|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2069744263, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2069744263, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2069744263, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2069744263, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-2069744263|, ~weak$$choice2~0=~weak$$choice2~0_In-2069744263, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-2069744263|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 06:18:19,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (= v_~a$r_buff0_thd3~0_52 v_~a$r_buff0_thd3~0_51) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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 06:18:19,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_20 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 06:18:19,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1308231617 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In1308231617 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1308231617| ~a$w_buff1~0_In1308231617)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out1308231617| ~a~0_In1308231617)))) InVars {~a~0=~a~0_In1308231617, ~a$w_buff1~0=~a$w_buff1~0_In1308231617, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1308231617, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1308231617} OutVars{~a~0=~a~0_In1308231617, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1308231617|, ~a$w_buff1~0=~a$w_buff1~0_In1308231617, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1308231617, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1308231617} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:18:19,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_18 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_18, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:18:19,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1305987893 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1305987893 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1305987893| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1305987893| ~a$w_buff0_used~0_In-1305987893)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1305987893, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1305987893} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1305987893|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1305987893, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1305987893} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 06:18:19,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In127247595 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In127247595 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In127247595 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In127247595 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out127247595|)) (and (= ~a$w_buff1_used~0_In127247595 |P2Thread1of1ForFork0_#t~ite41_Out127247595|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In127247595, ~a$w_buff0_used~0=~a$w_buff0_used~0_In127247595, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In127247595, ~a$w_buff1_used~0=~a$w_buff1_used~0_In127247595} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In127247595, ~a$w_buff0_used~0=~a$w_buff0_used~0_In127247595, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In127247595, ~a$w_buff1_used~0=~a$w_buff1_used~0_In127247595, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out127247595|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 06:18:19,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In965041285 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In965041285 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd3~0_In965041285 |P2Thread1of1ForFork0_#t~ite42_Out965041285|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out965041285| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In965041285, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In965041285} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In965041285, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In965041285, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out965041285|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 06:18:19,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In1366200556 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In1366200556 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1366200556 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1366200556 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out1366200556| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd3~0_In1366200556 |P2Thread1of1ForFork0_#t~ite43_Out1366200556|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1366200556, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1366200556, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1366200556, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1366200556} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1366200556|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1366200556, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1366200556, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1366200556, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1366200556} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 06:18:19,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, 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 06:18:19,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:18:19,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out65451477| |ULTIMATE.start_main_#t~ite47_Out65451477|)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In65451477 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In65451477 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out65451477| ~a$w_buff1~0_In65451477) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out65451477| ~a~0_In65451477)))) InVars {~a~0=~a~0_In65451477, ~a$w_buff1~0=~a$w_buff1~0_In65451477, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In65451477, ~a$w_buff1_used~0=~a$w_buff1_used~0_In65451477} OutVars{~a~0=~a~0_In65451477, ~a$w_buff1~0=~a$w_buff1~0_In65451477, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out65451477|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In65451477, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out65451477|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In65451477} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:18:19,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1561346370 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In1561346370 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1561346370 |ULTIMATE.start_main_#t~ite49_Out1561346370|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out1561346370|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1561346370, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1561346370} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1561346370, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1561346370|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1561346370} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:18:19,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In289511840 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In289511840 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In289511840 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In289511840 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out289511840| ~a$w_buff1_used~0_In289511840)) (and (= |ULTIMATE.start_main_#t~ite50_Out289511840| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In289511840, ~a$w_buff0_used~0=~a$w_buff0_used~0_In289511840, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In289511840, ~a$w_buff1_used~0=~a$w_buff1_used~0_In289511840} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out289511840|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In289511840, ~a$w_buff0_used~0=~a$w_buff0_used~0_In289511840, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In289511840, ~a$w_buff1_used~0=~a$w_buff1_used~0_In289511840} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:18:19,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-713457658 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-713457658 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-713457658 |ULTIMATE.start_main_#t~ite51_Out-713457658|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-713457658|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-713457658, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-713457658} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-713457658|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-713457658, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-713457658} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:18:19,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1323368393 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1323368393 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1323368393 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In1323368393 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1323368393|)) (and (or .cse1 .cse0) (= ~a$r_buff1_thd0~0_In1323368393 |ULTIMATE.start_main_#t~ite52_Out1323368393|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1323368393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1323368393, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1323368393, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1323368393} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1323368393|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1323368393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1323368393, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1323368393, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1323368393} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:18:19,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite52_13| v_~a$r_buff1_thd0~0_19) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_9 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 06:18:19,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:18:19 BasicIcfg [2019-12-27 06:18:19,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:18:19,698 INFO L168 Benchmark]: Toolchain (without parser) took 111904.89 ms. Allocated memory was 144.7 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 100.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 06:18:19,704 INFO L168 Benchmark]: CDTParser took 1.92 ms. Allocated memory is still 144.7 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 06:18:19,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.10 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.2 MB in the beginning and 154.0 MB in the end (delta: -53.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:19,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.31 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:19,705 INFO L168 Benchmark]: Boogie Preprocessor took 39.87 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 149.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:19,705 INFO L168 Benchmark]: RCFGBuilder took 1019.03 ms. Allocated memory is still 202.9 MB. Free memory was 149.0 MB in the beginning and 97.9 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:19,706 INFO L168 Benchmark]: TraceAbstraction took 109989.79 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 97.9 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 06:18:19,708 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.92 ms. Allocated memory is still 144.7 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.10 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.2 MB in the beginning and 154.0 MB in the end (delta: -53.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.31 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.87 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 149.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1019.03 ms. Allocated memory is still 202.9 MB. Free memory was 149.0 MB in the beginning and 97.9 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109989.79 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 97.9 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 178 ProgramPointsBefore, 96 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7337 VarBasedMoverChecksPositive, 224 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 86659 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t925, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [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_p0_EAX=0, __unbuffered_p1_EAX=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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t926, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y=0, z=0] [L770] 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_p0_EAX=0, __unbuffered_p1_EAX=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=1, y=0, 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) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 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 [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [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 [L836] FCALL, FORK 0 pthread_create(&t927, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 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, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 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) [L798] EXPR 3 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=8, weak$$choice2=1, 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))=1, x=1, y=1, z=1] [L798] 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)) [L799] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=8, 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=1, y=1, z=1] [L799] 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)) [L800] EXPR 3 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=8, weak$$choice2=1, 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))=0, x=1, y=1, z=1] [L800] 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)) [L801] 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)) [L803] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=8, 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=1, y=1, z=1] [L803] 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)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 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 [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 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_p0_EAX=0, __unbuffered_p1_EAX=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=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 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 [L845] 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: 109.6s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 36.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8369 SDtfs, 8871 SDslu, 29201 SDs, 0 SdLazy, 17176 SolverSat, 293 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 50 SyntacticMatches, 17 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163842occurred 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: 43.8s AutomataMinimizationTime, 32 MinimizatonAttempts, 257790 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1469 NumberOfCodeBlocks, 1469 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1370 ConstructedInterpolants, 0 QuantifiedInterpolants, 289697 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...