/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/mix052_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:49:51,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:49:51,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:49:51,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:49:51,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:49:51,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:49:51,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:49:51,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:49:51,438 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:49:51,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:49:51,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:49:51,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:49:51,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:49:51,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:49:51,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:49:51,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:49:51,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:49:51,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:49:51,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:49:51,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:49:51,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:49:51,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:49:51,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:49:51,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:49:51,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:49:51,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:49:51,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:49:51,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:49:51,458 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:49:51,459 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:49:51,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:49:51,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:49:51,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:49:51,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:49:51,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:49:51,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:49:51,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:49:51,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:49:51,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:49:51,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:49:51,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:49:51,466 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:49:51,480 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:49:51,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:49:51,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:49:51,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:49:51,482 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:49:51,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:49:51,482 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:49:51,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:49:51,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:49:51,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:49:51,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:49:51,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:49:51,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:49:51,484 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:49:51,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:49:51,484 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:49:51,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:49:51,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:49:51,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:49:51,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:49:51,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:49:51,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:49:51,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:49:51,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:49:51,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:49:51,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:49:51,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:49:51,486 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:49:51,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:49:51,487 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:49:51,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:49:51,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:49:51,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:49:51,790 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:49:51,790 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:49:51,791 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.opt.i [2019-12-27 06:49:51,857 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ee9119dd/90f25621bf814b27a14576dc435164c0/FLAG9687e0b47 [2019-12-27 06:49:52,466 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:49:52,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.opt.i [2019-12-27 06:49:52,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ee9119dd/90f25621bf814b27a14576dc435164c0/FLAG9687e0b47 [2019-12-27 06:49:52,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ee9119dd/90f25621bf814b27a14576dc435164c0 [2019-12-27 06:49:52,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:49:52,776 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:49:52,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:49:52,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:49:52,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:49:52,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:49:52" (1/1) ... [2019-12-27 06:49:52,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c94d1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:52, skipping insertion in model container [2019-12-27 06:49:52,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:49:52" (1/1) ... [2019-12-27 06:49:52,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:49:52,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:49:53,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:49:53,400 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:49:53,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:49:53,549 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:49:53,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:53 WrapperNode [2019-12-27 06:49:53,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:49:53,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:49:53,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:49:53,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:49:53,558 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:49:53" (1/1) ... [2019-12-27 06:49:53,580 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:49:53" (1/1) ... [2019-12-27 06:49:53,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:49:53,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:49:53,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:49:53,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:49:53,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:53" (1/1) ... [2019-12-27 06:49:53,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:53" (1/1) ... [2019-12-27 06:49:53,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:53" (1/1) ... [2019-12-27 06:49:53,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:53" (1/1) ... [2019-12-27 06:49:53,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:53" (1/1) ... [2019-12-27 06:49:53,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:53" (1/1) ... [2019-12-27 06:49:53,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:53" (1/1) ... [2019-12-27 06:49:53,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:49:53,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:49:53,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:49:53,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:49:53,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:53" (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:49:53,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:49:53,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:49:53,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:49:53,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:49:53,735 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:49:53,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:49:53,735 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:49:53,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:49:53,736 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:49:53,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:49:53,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:49:53,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:49:53,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:49:53,738 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:49:54,509 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:49:54,510 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:49:54,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:49:54 BoogieIcfgContainer [2019-12-27 06:49:54,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:49:54,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:49:54,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:49:54,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:49:54,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:49:52" (1/3) ... [2019-12-27 06:49:54,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18305bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:49:54, skipping insertion in model container [2019-12-27 06:49:54,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:49:53" (2/3) ... [2019-12-27 06:49:54,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18305bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:49:54, skipping insertion in model container [2019-12-27 06:49:54,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:49:54" (3/3) ... [2019-12-27 06:49:54,522 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_power.opt.i [2019-12-27 06:49:54,534 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:49:54,534 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:49:54,542 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:49:54,543 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:49:54,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,609 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,609 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,610 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,610 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,611 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,624 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,624 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,656 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,657 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,695 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,695 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,695 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,698 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,698 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,703 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,705 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:49:54,729 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:49:54,749 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:49:54,750 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:49:54,750 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:49:54,750 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:49:54,750 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:49:54,750 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:49:54,750 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:49:54,750 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:49:54,766 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 06:49:54,768 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 06:49:54,876 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 06:49:54,876 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:49:54,892 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:49:54,918 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 06:49:54,974 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 06:49:54,974 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:49:54,982 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:49:55,004 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:49:55,005 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:49:58,736 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 06:49:58,878 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 06:49:58,899 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-27 06:49:58,900 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 06:49:58,903 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 06:50:14,986 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-27 06:50:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-27 06:50:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:50:14,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:50:14,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:50:14,996 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:50:15,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:50:15,002 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-27 06:50:15,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:50:15,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43236660] [2019-12-27 06:50:15,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:50:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:50:15,212 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:50:15,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43236660] [2019-12-27 06:50:15,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:50:15,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:50:15,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075476334] [2019-12-27 06:50:15,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:50:15,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:50:15,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:50:15,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:50:15,238 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-27 06:50:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:50:16,932 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-27 06:50:16,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:50:16,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:50:16,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:50:20,425 INFO L225 Difference]: With dead ends: 106230 [2019-12-27 06:50:20,425 INFO L226 Difference]: Without dead ends: 99639 [2019-12-27 06:50:20,427 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:50:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-27 06:50:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-27 06:50:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-27 06:50:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-27 06:50:31,689 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-27 06:50:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:50:31,689 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-27 06:50:31,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:50:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-27 06:50:31,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:50:31,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:50:31,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:50:31,695 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:50:31,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:50:31,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-27 06:50:31,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:50:31,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914302706] [2019-12-27 06:50:31,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:50:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:50:31,821 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:50:31,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914302706] [2019-12-27 06:50:31,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:50:31,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:50:31,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681626385] [2019-12-27 06:50:31,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:50:31,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:50:31,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:50:31,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:50:31,825 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-27 06:50:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:50:37,129 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-27 06:50:37,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:50:37,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:50:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:50:37,836 INFO L225 Difference]: With dead ends: 159197 [2019-12-27 06:50:37,836 INFO L226 Difference]: Without dead ends: 159148 [2019-12-27 06:50:37,837 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:50:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-27 06:50:46,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-27 06:50:46,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-27 06:50:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-27 06:50:46,683 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-27 06:50:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:50:46,684 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-27 06:50:46,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:50:46,684 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-27 06:50:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:50:46,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:50:46,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:50:46,691 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:50:46,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:50:46,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-27 06:50:46,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:50:46,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507447154] [2019-12-27 06:50:46,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:50:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:50:46,773 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:50:46,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507447154] [2019-12-27 06:50:46,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:50:46,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:50:46,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379472290] [2019-12-27 06:50:46,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:50:46,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:50:46,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:50:46,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:50:46,775 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-27 06:50:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:50:46,897 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-27 06:50:46,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:50:46,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:50:46,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:50:46,990 INFO L225 Difference]: With dead ends: 32092 [2019-12-27 06:50:46,990 INFO L226 Difference]: Without dead ends: 32092 [2019-12-27 06:50:46,991 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:50:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-27 06:50:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-27 06:50:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-27 06:50:52,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-27 06:50:52,202 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-27 06:50:52,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:50:52,202 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-27 06:50:52,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:50:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-27 06:50:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:50:52,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:50:52,205 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:50:52,205 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:50:52,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:50:52,205 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-27 06:50:52,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:50:52,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318775778] [2019-12-27 06:50:52,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:50:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:50:52,353 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:50:52,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318775778] [2019-12-27 06:50:52,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:50:52,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:50:52,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646312122] [2019-12-27 06:50:52,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:50:52,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:50:52,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:50:52,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:50:52,360 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-27 06:50:52,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:50:52,869 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-27 06:50:52,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:50:52,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 06:50:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:50:52,959 INFO L225 Difference]: With dead ends: 43827 [2019-12-27 06:50:52,959 INFO L226 Difference]: Without dead ends: 43827 [2019-12-27 06:50:52,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:50:53,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-27 06:50:53,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-27 06:50:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-27 06:50:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-27 06:50:54,009 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-27 06:50:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:50:54,010 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-27 06:50:54,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:50:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-27 06:50:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:50:54,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:50:54,021 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:50:54,021 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:50:54,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:50:54,021 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-27 06:50:54,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:50:54,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125896375] [2019-12-27 06:50:54,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:50:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:50:54,190 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:50:54,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125896375] [2019-12-27 06:50:54,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:50:54,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:50:54,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909826001] [2019-12-27 06:50:54,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:50:54,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:50:54,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:50:54,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:50:54,193 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-27 06:50:55,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:50:55,273 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-27 06:50:55,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:50:55,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 06:50:55,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:50:55,365 INFO L225 Difference]: With dead ends: 56855 [2019-12-27 06:50:55,365 INFO L226 Difference]: Without dead ends: 56848 [2019-12-27 06:50:55,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:50:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-27 06:50:56,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-27 06:50:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-27 06:50:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-27 06:50:56,561 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-27 06:50:56,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:50:56,562 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-27 06:50:56,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:50:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-27 06:50:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:50:56,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:50:56,576 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:50:56,577 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:50:56,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:50:56,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-27 06:50:56,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:50:56,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20476304] [2019-12-27 06:50:56,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:50:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:50:56,643 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:50:56,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20476304] [2019-12-27 06:50:56,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:50:56,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:50:56,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582898056] [2019-12-27 06:50:56,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:50:56,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:50:56,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:50:56,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:50:56,646 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 4 states. [2019-12-27 06:50:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:50:56,711 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-27 06:50:56,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:50:56,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:50:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:50:56,733 INFO L225 Difference]: With dead ends: 15569 [2019-12-27 06:50:56,733 INFO L226 Difference]: Without dead ends: 15569 [2019-12-27 06:50:56,733 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:50:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-27 06:50:56,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-27 06:50:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 06:50:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-27 06:50:56,962 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-27 06:50:56,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:50:56,963 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-27 06:50:56,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:50:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-27 06:50:56,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:50:56,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:50:56,973 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:50:56,973 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:50:56,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:50:56,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-27 06:50:56,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:50:56,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55902990] [2019-12-27 06:50:56,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:50:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:50:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:50:57,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55902990] [2019-12-27 06:50:57,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:50:57,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:50:57,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961538331] [2019-12-27 06:50:57,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:50:57,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:50:57,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:50:57,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:50:57,082 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 6 states. [2019-12-27 06:50:57,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:50:57,672 INFO L93 Difference]: Finished difference Result 21967 states and 64800 transitions. [2019-12-27 06:50:57,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:50:57,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 06:50:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:50:57,712 INFO L225 Difference]: With dead ends: 21967 [2019-12-27 06:50:57,712 INFO L226 Difference]: Without dead ends: 21967 [2019-12-27 06:50:57,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:50:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-12-27 06:50:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 17627. [2019-12-27 06:50:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-27 06:50:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-27 06:50:58,099 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-27 06:50:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:50:58,100 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-27 06:50:58,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:50:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-27 06:50:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:50:58,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:50:58,120 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:50:58,120 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:50:58,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:50:58,120 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-27 06:50:58,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:50:58,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846247712] [2019-12-27 06:50:58,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:50:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:50:58,314 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:50:58,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846247712] [2019-12-27 06:50:58,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:50:58,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:50:58,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553523492] [2019-12-27 06:50:58,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:50:58,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:50:58,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:50:58,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:50:58,317 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 8 states. [2019-12-27 06:50:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:50:59,786 INFO L93 Difference]: Finished difference Result 24849 states and 72852 transitions. [2019-12-27 06:50:59,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 06:50:59,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 06:50:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:50:59,820 INFO L225 Difference]: With dead ends: 24849 [2019-12-27 06:50:59,820 INFO L226 Difference]: Without dead ends: 24849 [2019-12-27 06:50:59,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-12-27 06:50:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24849 states. [2019-12-27 06:51:00,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24849 to 17725. [2019-12-27 06:51:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17725 states. [2019-12-27 06:51:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17725 states to 17725 states and 53335 transitions. [2019-12-27 06:51:00,137 INFO L78 Accepts]: Start accepts. Automaton has 17725 states and 53335 transitions. Word has length 33 [2019-12-27 06:51:00,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:00,137 INFO L462 AbstractCegarLoop]: Abstraction has 17725 states and 53335 transitions. [2019-12-27 06:51:00,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:51:00,138 INFO L276 IsEmpty]: Start isEmpty. Operand 17725 states and 53335 transitions. [2019-12-27 06:51:00,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:51:00,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:00,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, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:00,158 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:51:00,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:00,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1052383531, now seen corresponding path program 2 times [2019-12-27 06:51:00,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:00,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117157285] [2019-12-27 06:51:00,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:00,270 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:51:00,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117157285] [2019-12-27 06:51:00,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:00,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:51:00,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801329427] [2019-12-27 06:51:00,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:51:00,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:00,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:51:00,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:51:00,274 INFO L87 Difference]: Start difference. First operand 17725 states and 53335 transitions. Second operand 7 states. [2019-12-27 06:51:01,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:01,532 INFO L93 Difference]: Finished difference Result 24587 states and 72060 transitions. [2019-12-27 06:51:01,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:51:01,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:51:01,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:01,565 INFO L225 Difference]: With dead ends: 24587 [2019-12-27 06:51:01,565 INFO L226 Difference]: Without dead ends: 24587 [2019-12-27 06:51:01,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:51:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24587 states. [2019-12-27 06:51:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24587 to 16954. [2019-12-27 06:51:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 06:51:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-27 06:51:01,864 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-27 06:51:01,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:01,864 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-27 06:51:01,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:51:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-27 06:51:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:51:01,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:01,886 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:51:01,886 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:51:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:01,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-27 06:51:01,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:01,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139908181] [2019-12-27 06:51:01,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:01,956 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:51:01,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139908181] [2019-12-27 06:51:01,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:01,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:51:01,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936122907] [2019-12-27 06:51:01,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:51:01,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:01,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:51:01,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:51:01,959 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 5 states. [2019-12-27 06:51:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:02,773 INFO L93 Difference]: Finished difference Result 23664 states and 70656 transitions. [2019-12-27 06:51:02,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:51:02,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 06:51:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:02,807 INFO L225 Difference]: With dead ends: 23664 [2019-12-27 06:51:02,807 INFO L226 Difference]: Without dead ends: 23664 [2019-12-27 06:51:02,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:51:02,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23664 states. [2019-12-27 06:51:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23664 to 22129. [2019-12-27 06:51:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22129 states. [2019-12-27 06:51:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22129 states to 22129 states and 66460 transitions. [2019-12-27 06:51:03,152 INFO L78 Accepts]: Start accepts. Automaton has 22129 states and 66460 transitions. Word has length 39 [2019-12-27 06:51:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:03,153 INFO L462 AbstractCegarLoop]: Abstraction has 22129 states and 66460 transitions. [2019-12-27 06:51:03,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:51:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 22129 states and 66460 transitions. [2019-12-27 06:51:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:51:03,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:03,179 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:51:03,179 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:51:03,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:03,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1240175328, now seen corresponding path program 2 times [2019-12-27 06:51:03,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:03,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009015942] [2019-12-27 06:51:03,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:03,252 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:51:03,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009015942] [2019-12-27 06:51:03,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:03,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:51:03,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049490432] [2019-12-27 06:51:03,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:51:03,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:03,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:51:03,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:51:03,254 INFO L87 Difference]: Start difference. First operand 22129 states and 66460 transitions. Second operand 5 states. [2019-12-27 06:51:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:03,361 INFO L93 Difference]: Finished difference Result 20882 states and 63572 transitions. [2019-12-27 06:51:03,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:51:03,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 06:51:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:03,398 INFO L225 Difference]: With dead ends: 20882 [2019-12-27 06:51:03,398 INFO L226 Difference]: Without dead ends: 20882 [2019-12-27 06:51:03,398 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:51:03,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20882 states. [2019-12-27 06:51:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20882 to 20042. [2019-12-27 06:51:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20042 states. [2019-12-27 06:51:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20042 states to 20042 states and 61305 transitions. [2019-12-27 06:51:03,705 INFO L78 Accepts]: Start accepts. Automaton has 20042 states and 61305 transitions. Word has length 39 [2019-12-27 06:51:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:03,705 INFO L462 AbstractCegarLoop]: Abstraction has 20042 states and 61305 transitions. [2019-12-27 06:51:03,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:51:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 20042 states and 61305 transitions. [2019-12-27 06:51:03,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:51:03,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:03,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:03,726 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:51:03,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:03,726 INFO L82 PathProgramCache]: Analyzing trace with hash 480370435, now seen corresponding path program 1 times [2019-12-27 06:51:03,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:03,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747080318] [2019-12-27 06:51:03,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:03,771 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:51:03,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747080318] [2019-12-27 06:51:03,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:03,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:51:03,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293187617] [2019-12-27 06:51:03,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:51:03,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:03,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:51:03,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:03,773 INFO L87 Difference]: Start difference. First operand 20042 states and 61305 transitions. Second operand 3 states. [2019-12-27 06:51:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:03,898 INFO L93 Difference]: Finished difference Result 29777 states and 91217 transitions. [2019-12-27 06:51:03,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:51:03,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:51:03,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:03,938 INFO L225 Difference]: With dead ends: 29777 [2019-12-27 06:51:03,939 INFO L226 Difference]: Without dead ends: 29777 [2019-12-27 06:51:03,939 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:51:04,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29777 states. [2019-12-27 06:51:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29777 to 22663. [2019-12-27 06:51:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22663 states. [2019-12-27 06:51:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22663 states to 22663 states and 70163 transitions. [2019-12-27 06:51:04,582 INFO L78 Accepts]: Start accepts. Automaton has 22663 states and 70163 transitions. Word has length 64 [2019-12-27 06:51:04,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:04,583 INFO L462 AbstractCegarLoop]: Abstraction has 22663 states and 70163 transitions. [2019-12-27 06:51:04,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:51:04,583 INFO L276 IsEmpty]: Start isEmpty. Operand 22663 states and 70163 transitions. [2019-12-27 06:51:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:51:04,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:04,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:04,615 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:51:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:04,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2036276616, now seen corresponding path program 1 times [2019-12-27 06:51:04,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:04,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015958550] [2019-12-27 06:51:04,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:04,712 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:51:04,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015958550] [2019-12-27 06:51:04,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:04,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:51:04,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595248131] [2019-12-27 06:51:04,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:51:04,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:04,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:51:04,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:51:04,715 INFO L87 Difference]: Start difference. First operand 22663 states and 70163 transitions. Second operand 4 states. [2019-12-27 06:51:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:04,907 INFO L93 Difference]: Finished difference Result 42597 states and 132112 transitions. [2019-12-27 06:51:04,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:51:04,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 06:51:04,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:04,958 INFO L225 Difference]: With dead ends: 42597 [2019-12-27 06:51:04,958 INFO L226 Difference]: Without dead ends: 21217 [2019-12-27 06:51:04,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:51:05,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21217 states. [2019-12-27 06:51:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21217 to 21217. [2019-12-27 06:51:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21217 states. [2019-12-27 06:51:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21217 states to 21217 states and 65595 transitions. [2019-12-27 06:51:05,326 INFO L78 Accepts]: Start accepts. Automaton has 21217 states and 65595 transitions. Word has length 64 [2019-12-27 06:51:05,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:05,326 INFO L462 AbstractCegarLoop]: Abstraction has 21217 states and 65595 transitions. [2019-12-27 06:51:05,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:51:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 21217 states and 65595 transitions. [2019-12-27 06:51:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:51:05,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:05,360 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:05,360 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:51:05,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:05,361 INFO L82 PathProgramCache]: Analyzing trace with hash -776574144, now seen corresponding path program 2 times [2019-12-27 06:51:05,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:05,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068019579] [2019-12-27 06:51:05,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:05,439 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:51:05,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068019579] [2019-12-27 06:51:05,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:05,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:51:05,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975201314] [2019-12-27 06:51:05,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:51:05,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:05,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:51:05,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:51:05,441 INFO L87 Difference]: Start difference. First operand 21217 states and 65595 transitions. Second operand 7 states. [2019-12-27 06:51:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:06,098 INFO L93 Difference]: Finished difference Result 62594 states and 191097 transitions. [2019-12-27 06:51:06,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:51:06,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:51:06,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:06,186 INFO L225 Difference]: With dead ends: 62594 [2019-12-27 06:51:06,187 INFO L226 Difference]: Without dead ends: 42982 [2019-12-27 06:51:06,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:51:06,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42982 states. [2019-12-27 06:51:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42982 to 24204. [2019-12-27 06:51:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24204 states. [2019-12-27 06:51:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24204 states to 24204 states and 74744 transitions. [2019-12-27 06:51:07,020 INFO L78 Accepts]: Start accepts. Automaton has 24204 states and 74744 transitions. Word has length 64 [2019-12-27 06:51:07,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:07,020 INFO L462 AbstractCegarLoop]: Abstraction has 24204 states and 74744 transitions. [2019-12-27 06:51:07,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:51:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 24204 states and 74744 transitions. [2019-12-27 06:51:07,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:51:07,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:07,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:07,046 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:51:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:07,047 INFO L82 PathProgramCache]: Analyzing trace with hash 4176110, now seen corresponding path program 3 times [2019-12-27 06:51:07,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:07,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061597876] [2019-12-27 06:51:07,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:07,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:51:07,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061597876] [2019-12-27 06:51:07,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:07,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:51:07,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968172601] [2019-12-27 06:51:07,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:51:07,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:07,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:51:07,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:51:07,125 INFO L87 Difference]: Start difference. First operand 24204 states and 74744 transitions. Second operand 7 states. [2019-12-27 06:51:07,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:07,721 INFO L93 Difference]: Finished difference Result 70069 states and 215496 transitions. [2019-12-27 06:51:07,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 06:51:07,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:51:07,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:07,822 INFO L225 Difference]: With dead ends: 70069 [2019-12-27 06:51:07,822 INFO L226 Difference]: Without dead ends: 52756 [2019-12-27 06:51:07,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:51:07,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52756 states. [2019-12-27 06:51:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52756 to 28331. [2019-12-27 06:51:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28331 states. [2019-12-27 06:51:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28331 states to 28331 states and 88059 transitions. [2019-12-27 06:51:08,467 INFO L78 Accepts]: Start accepts. Automaton has 28331 states and 88059 transitions. Word has length 64 [2019-12-27 06:51:08,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:08,468 INFO L462 AbstractCegarLoop]: Abstraction has 28331 states and 88059 transitions. [2019-12-27 06:51:08,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:51:08,468 INFO L276 IsEmpty]: Start isEmpty. Operand 28331 states and 88059 transitions. [2019-12-27 06:51:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:51:08,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:08,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:08,498 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:51:08,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:08,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1890015084, now seen corresponding path program 4 times [2019-12-27 06:51:08,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:08,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205554143] [2019-12-27 06:51:08,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:08,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205554143] [2019-12-27 06:51:08,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:08,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:51:08,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980855121] [2019-12-27 06:51:08,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:51:08,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:08,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:51:08,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:51:08,600 INFO L87 Difference]: Start difference. First operand 28331 states and 88059 transitions. Second operand 7 states. [2019-12-27 06:51:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:09,384 INFO L93 Difference]: Finished difference Result 60139 states and 184623 transitions. [2019-12-27 06:51:09,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:51:09,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:51:09,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:09,462 INFO L225 Difference]: With dead ends: 60139 [2019-12-27 06:51:09,463 INFO L226 Difference]: Without dead ends: 52780 [2019-12-27 06:51:09,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:51:09,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52780 states. [2019-12-27 06:51:10,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52780 to 28639. [2019-12-27 06:51:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28639 states. [2019-12-27 06:51:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28639 states to 28639 states and 89010 transitions. [2019-12-27 06:51:10,081 INFO L78 Accepts]: Start accepts. Automaton has 28639 states and 89010 transitions. Word has length 64 [2019-12-27 06:51:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:10,082 INFO L462 AbstractCegarLoop]: Abstraction has 28639 states and 89010 transitions. [2019-12-27 06:51:10,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:51:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 28639 states and 89010 transitions. [2019-12-27 06:51:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:51:10,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:10,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:51:10,113 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:51:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:10,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1583546656, now seen corresponding path program 5 times [2019-12-27 06:51:10,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:10,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709054718] [2019-12-27 06:51:10,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:10,192 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:51:10,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709054718] [2019-12-27 06:51:10,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:10,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:51:10,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007070885] [2019-12-27 06:51:10,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:51:10,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:10,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:51:10,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:10,195 INFO L87 Difference]: Start difference. First operand 28639 states and 89010 transitions. Second operand 3 states. [2019-12-27 06:51:10,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:10,394 INFO L93 Difference]: Finished difference Result 34404 states and 106219 transitions. [2019-12-27 06:51:10,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:51:10,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:51:10,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:10,441 INFO L225 Difference]: With dead ends: 34404 [2019-12-27 06:51:10,442 INFO L226 Difference]: Without dead ends: 34404 [2019-12-27 06:51:10,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34404 states. [2019-12-27 06:51:10,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34404 to 30218. [2019-12-27 06:51:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30218 states. [2019-12-27 06:51:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30218 states to 30218 states and 93973 transitions. [2019-12-27 06:51:10,964 INFO L78 Accepts]: Start accepts. Automaton has 30218 states and 93973 transitions. Word has length 64 [2019-12-27 06:51:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:10,964 INFO L462 AbstractCegarLoop]: Abstraction has 30218 states and 93973 transitions. [2019-12-27 06:51:10,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:51:10,964 INFO L276 IsEmpty]: Start isEmpty. Operand 30218 states and 93973 transitions. [2019-12-27 06:51:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:51:11,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:11,368 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:51:11,368 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:51:11,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:11,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1838532524, now seen corresponding path program 1 times [2019-12-27 06:51:11,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:11,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456280843] [2019-12-27 06:51:11,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:11,421 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:51:11,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456280843] [2019-12-27 06:51:11,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:11,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:51:11,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202112768] [2019-12-27 06:51:11,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:51:11,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:11,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:51:11,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:51:11,423 INFO L87 Difference]: Start difference. First operand 30218 states and 93973 transitions. Second operand 4 states. [2019-12-27 06:51:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:11,687 INFO L93 Difference]: Finished difference Result 38058 states and 117223 transitions. [2019-12-27 06:51:11,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:51:11,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 06:51:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:11,753 INFO L225 Difference]: With dead ends: 38058 [2019-12-27 06:51:11,754 INFO L226 Difference]: Without dead ends: 38058 [2019-12-27 06:51:11,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:51:11,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38058 states. [2019-12-27 06:51:12,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38058 to 30836. [2019-12-27 06:51:12,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30836 states. [2019-12-27 06:51:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30836 states to 30836 states and 95961 transitions. [2019-12-27 06:51:12,312 INFO L78 Accepts]: Start accepts. Automaton has 30836 states and 95961 transitions. Word has length 65 [2019-12-27 06:51:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:12,312 INFO L462 AbstractCegarLoop]: Abstraction has 30836 states and 95961 transitions. [2019-12-27 06:51:12,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:51:12,312 INFO L276 IsEmpty]: Start isEmpty. Operand 30836 states and 95961 transitions. [2019-12-27 06:51:12,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:51:12,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:12,346 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:51:12,346 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:51:12,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:12,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1450523796, now seen corresponding path program 2 times [2019-12-27 06:51:12,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:12,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809693485] [2019-12-27 06:51:12,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:12,396 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:51:12,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809693485] [2019-12-27 06:51:12,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:12,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:51:12,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25610099] [2019-12-27 06:51:12,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:51:12,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:12,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:51:12,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:51:12,398 INFO L87 Difference]: Start difference. First operand 30836 states and 95961 transitions. Second operand 4 states. [2019-12-27 06:51:12,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:12,824 INFO L93 Difference]: Finished difference Result 48141 states and 150231 transitions. [2019-12-27 06:51:12,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:51:12,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 06:51:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:12,898 INFO L225 Difference]: With dead ends: 48141 [2019-12-27 06:51:12,898 INFO L226 Difference]: Without dead ends: 48141 [2019-12-27 06:51:12,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:51:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48141 states. [2019-12-27 06:51:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48141 to 32995. [2019-12-27 06:51:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32995 states. [2019-12-27 06:51:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32995 states to 32995 states and 103746 transitions. [2019-12-27 06:51:13,977 INFO L78 Accepts]: Start accepts. Automaton has 32995 states and 103746 transitions. Word has length 65 [2019-12-27 06:51:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:13,977 INFO L462 AbstractCegarLoop]: Abstraction has 32995 states and 103746 transitions. [2019-12-27 06:51:13,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:51:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 32995 states and 103746 transitions. [2019-12-27 06:51:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:51:14,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:14,016 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:51:14,017 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:51:14,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:14,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1631986328, now seen corresponding path program 3 times [2019-12-27 06:51:14,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:14,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392879240] [2019-12-27 06:51:14,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:14,099 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:51:14,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392879240] [2019-12-27 06:51:14,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:14,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:51:14,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137413583] [2019-12-27 06:51:14,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:51:14,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:14,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:51:14,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:51:14,101 INFO L87 Difference]: Start difference. First operand 32995 states and 103746 transitions. Second operand 7 states. [2019-12-27 06:51:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:14,660 INFO L93 Difference]: Finished difference Result 72421 states and 224911 transitions. [2019-12-27 06:51:14,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:51:14,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:51:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:14,765 INFO L225 Difference]: With dead ends: 72421 [2019-12-27 06:51:14,766 INFO L226 Difference]: Without dead ends: 66202 [2019-12-27 06:51:14,766 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:51:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66202 states. [2019-12-27 06:51:15,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66202 to 33027. [2019-12-27 06:51:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33027 states. [2019-12-27 06:51:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33027 states to 33027 states and 103864 transitions. [2019-12-27 06:51:15,536 INFO L78 Accepts]: Start accepts. Automaton has 33027 states and 103864 transitions. Word has length 65 [2019-12-27 06:51:15,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:15,536 INFO L462 AbstractCegarLoop]: Abstraction has 33027 states and 103864 transitions. [2019-12-27 06:51:15,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:51:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 33027 states and 103864 transitions. [2019-12-27 06:51:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:51:15,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:15,576 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:51:15,576 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:51:15,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:15,577 INFO L82 PathProgramCache]: Analyzing trace with hash -855143256, now seen corresponding path program 4 times [2019-12-27 06:51:15,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:15,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065650825] [2019-12-27 06:51:15,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:15,662 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:51:15,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065650825] [2019-12-27 06:51:15,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:15,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:51:15,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935458526] [2019-12-27 06:51:15,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:51:15,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:15,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:51:15,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:51:15,664 INFO L87 Difference]: Start difference. First operand 33027 states and 103864 transitions. Second operand 7 states. [2019-12-27 06:51:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:16,652 INFO L93 Difference]: Finished difference Result 53845 states and 170272 transitions. [2019-12-27 06:51:16,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:51:16,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:51:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:16,743 INFO L225 Difference]: With dead ends: 53845 [2019-12-27 06:51:16,743 INFO L226 Difference]: Without dead ends: 53845 [2019-12-27 06:51:16,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:51:16,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53845 states. [2019-12-27 06:51:17,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53845 to 34199. [2019-12-27 06:51:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34199 states. [2019-12-27 06:51:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34199 states to 34199 states and 107426 transitions. [2019-12-27 06:51:17,439 INFO L78 Accepts]: Start accepts. Automaton has 34199 states and 107426 transitions. Word has length 65 [2019-12-27 06:51:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:17,439 INFO L462 AbstractCegarLoop]: Abstraction has 34199 states and 107426 transitions. [2019-12-27 06:51:17,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:51:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 34199 states and 107426 transitions. [2019-12-27 06:51:17,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:51:17,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:17,480 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:51:17,480 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:51:17,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:17,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1607407314, now seen corresponding path program 1 times [2019-12-27 06:51:17,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:17,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181722065] [2019-12-27 06:51:17,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:17,550 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:51:17,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181722065] [2019-12-27 06:51:17,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:17,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:51:17,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654259398] [2019-12-27 06:51:17,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:51:17,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:17,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:51:17,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:51:17,553 INFO L87 Difference]: Start difference. First operand 34199 states and 107426 transitions. Second operand 5 states. [2019-12-27 06:51:18,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:18,207 INFO L93 Difference]: Finished difference Result 49777 states and 152916 transitions. [2019-12-27 06:51:18,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:51:18,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 06:51:18,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:18,284 INFO L225 Difference]: With dead ends: 49777 [2019-12-27 06:51:18,284 INFO L226 Difference]: Without dead ends: 49557 [2019-12-27 06:51:18,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 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:51:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49557 states. [2019-12-27 06:51:19,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49557 to 39728. [2019-12-27 06:51:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39728 states. [2019-12-27 06:51:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39728 states to 39728 states and 124203 transitions. [2019-12-27 06:51:19,451 INFO L78 Accepts]: Start accepts. Automaton has 39728 states and 124203 transitions. Word has length 65 [2019-12-27 06:51:19,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:19,451 INFO L462 AbstractCegarLoop]: Abstraction has 39728 states and 124203 transitions. [2019-12-27 06:51:19,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:51:19,452 INFO L276 IsEmpty]: Start isEmpty. Operand 39728 states and 124203 transitions. [2019-12-27 06:51:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:51:19,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:19,495 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:51:19,495 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:51:19,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:19,495 INFO L82 PathProgramCache]: Analyzing trace with hash 99240326, now seen corresponding path program 2 times [2019-12-27 06:51:19,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:19,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819315317] [2019-12-27 06:51:19,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:19,647 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:51:19,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819315317] [2019-12-27 06:51:19,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:19,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:51:19,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606400087] [2019-12-27 06:51:19,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:51:19,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:19,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:51:19,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:51:19,652 INFO L87 Difference]: Start difference. First operand 39728 states and 124203 transitions. Second operand 9 states. [2019-12-27 06:51:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:21,182 INFO L93 Difference]: Finished difference Result 59625 states and 183241 transitions. [2019-12-27 06:51:21,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:51:21,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:51:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:21,277 INFO L225 Difference]: With dead ends: 59625 [2019-12-27 06:51:21,277 INFO L226 Difference]: Without dead ends: 59513 [2019-12-27 06:51:21,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:51:21,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59513 states. [2019-12-27 06:51:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59513 to 40852. [2019-12-27 06:51:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40852 states. [2019-12-27 06:51:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40852 states to 40852 states and 127127 transitions. [2019-12-27 06:51:22,085 INFO L78 Accepts]: Start accepts. Automaton has 40852 states and 127127 transitions. Word has length 65 [2019-12-27 06:51:22,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:22,086 INFO L462 AbstractCegarLoop]: Abstraction has 40852 states and 127127 transitions. [2019-12-27 06:51:22,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:51:22,086 INFO L276 IsEmpty]: Start isEmpty. Operand 40852 states and 127127 transitions. [2019-12-27 06:51:22,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:51:22,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:22,138 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:51:22,138 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:51:22,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:22,139 INFO L82 PathProgramCache]: Analyzing trace with hash -154311598, now seen corresponding path program 3 times [2019-12-27 06:51:22,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:22,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086710730] [2019-12-27 06:51:22,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:22,194 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:51:22,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086710730] [2019-12-27 06:51:22,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:22,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:51:22,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821350531] [2019-12-27 06:51:22,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:51:22,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:22,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:51:22,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:22,197 INFO L87 Difference]: Start difference. First operand 40852 states and 127127 transitions. Second operand 3 states. [2019-12-27 06:51:22,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:22,394 INFO L93 Difference]: Finished difference Result 40852 states and 127126 transitions. [2019-12-27 06:51:22,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:51:22,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:51:22,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:22,479 INFO L225 Difference]: With dead ends: 40852 [2019-12-27 06:51:22,479 INFO L226 Difference]: Without dead ends: 40852 [2019-12-27 06:51:22,480 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:51:23,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40852 states. [2019-12-27 06:51:23,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40852 to 35500. [2019-12-27 06:51:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35500 states. [2019-12-27 06:51:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35500 states to 35500 states and 112016 transitions. [2019-12-27 06:51:23,731 INFO L78 Accepts]: Start accepts. Automaton has 35500 states and 112016 transitions. Word has length 65 [2019-12-27 06:51:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:23,731 INFO L462 AbstractCegarLoop]: Abstraction has 35500 states and 112016 transitions. [2019-12-27 06:51:23,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:51:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 35500 states and 112016 transitions. [2019-12-27 06:51:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:51:23,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:23,778 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:51:23,779 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:51:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:23,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1323575748, now seen corresponding path program 1 times [2019-12-27 06:51:23,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:23,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857408690] [2019-12-27 06:51:23,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:24,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:51:24,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857408690] [2019-12-27 06:51:24,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:24,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:51:24,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444528607] [2019-12-27 06:51:24,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:51:24,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:24,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:51:24,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:51:24,031 INFO L87 Difference]: Start difference. First operand 35500 states and 112016 transitions. Second operand 11 states. [2019-12-27 06:51:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:26,338 INFO L93 Difference]: Finished difference Result 56953 states and 176068 transitions. [2019-12-27 06:51:26,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:51:26,339 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 06:51:26,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:26,429 INFO L225 Difference]: With dead ends: 56953 [2019-12-27 06:51:26,429 INFO L226 Difference]: Without dead ends: 56953 [2019-12-27 06:51:26,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:51:26,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56953 states. [2019-12-27 06:51:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56953 to 37282. [2019-12-27 06:51:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37282 states. [2019-12-27 06:51:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37282 states to 37282 states and 117991 transitions. [2019-12-27 06:51:27,660 INFO L78 Accepts]: Start accepts. Automaton has 37282 states and 117991 transitions. Word has length 66 [2019-12-27 06:51:27,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:27,660 INFO L462 AbstractCegarLoop]: Abstraction has 37282 states and 117991 transitions. [2019-12-27 06:51:27,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:51:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 37282 states and 117991 transitions. [2019-12-27 06:51:27,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:51:27,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:27,703 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:51:27,703 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:51:27,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:27,704 INFO L82 PathProgramCache]: Analyzing trace with hash -871413024, now seen corresponding path program 2 times [2019-12-27 06:51:27,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:27,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301485554] [2019-12-27 06:51:27,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:27,781 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:51:27,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301485554] [2019-12-27 06:51:27,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:27,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:51:27,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453117424] [2019-12-27 06:51:27,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:51:27,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:27,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:51:27,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:27,783 INFO L87 Difference]: Start difference. First operand 37282 states and 117991 transitions. Second operand 3 states. [2019-12-27 06:51:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:27,893 INFO L93 Difference]: Finished difference Result 28208 states and 87803 transitions. [2019-12-27 06:51:27,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:51:27,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:51:27,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:27,934 INFO L225 Difference]: With dead ends: 28208 [2019-12-27 06:51:27,935 INFO L226 Difference]: Without dead ends: 28208 [2019-12-27 06:51:27,935 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:51:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28208 states. [2019-12-27 06:51:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28208 to 26620. [2019-12-27 06:51:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26620 states. [2019-12-27 06:51:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26620 states to 26620 states and 82769 transitions. [2019-12-27 06:51:28,362 INFO L78 Accepts]: Start accepts. Automaton has 26620 states and 82769 transitions. Word has length 66 [2019-12-27 06:51:28,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:28,362 INFO L462 AbstractCegarLoop]: Abstraction has 26620 states and 82769 transitions. [2019-12-27 06:51:28,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:51:28,362 INFO L276 IsEmpty]: Start isEmpty. Operand 26620 states and 82769 transitions. [2019-12-27 06:51:28,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:51:28,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:28,394 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:51:28,394 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:51:28,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:28,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1781917276, now seen corresponding path program 1 times [2019-12-27 06:51:28,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:28,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737885848] [2019-12-27 06:51:28,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:28,452 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:51:28,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737885848] [2019-12-27 06:51:28,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:28,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:51:28,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215077917] [2019-12-27 06:51:28,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:51:28,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:28,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:51:28,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:51:28,454 INFO L87 Difference]: Start difference. First operand 26620 states and 82769 transitions. Second operand 4 states. [2019-12-27 06:51:28,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:28,696 INFO L93 Difference]: Finished difference Result 26620 states and 82521 transitions. [2019-12-27 06:51:28,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:51:28,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 06:51:28,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:28,764 INFO L225 Difference]: With dead ends: 26620 [2019-12-27 06:51:28,764 INFO L226 Difference]: Without dead ends: 26620 [2019-12-27 06:51:28,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:51:28,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26620 states. [2019-12-27 06:51:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26620 to 22685. [2019-12-27 06:51:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22685 states. [2019-12-27 06:51:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22685 states to 22685 states and 70116 transitions. [2019-12-27 06:51:29,459 INFO L78 Accepts]: Start accepts. Automaton has 22685 states and 70116 transitions. Word has length 67 [2019-12-27 06:51:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:29,459 INFO L462 AbstractCegarLoop]: Abstraction has 22685 states and 70116 transitions. [2019-12-27 06:51:29,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:51:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 22685 states and 70116 transitions. [2019-12-27 06:51:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:51:29,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:29,494 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:51:29,494 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:51:29,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:29,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1134321916, now seen corresponding path program 1 times [2019-12-27 06:51:29,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:29,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385055921] [2019-12-27 06:51:29,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:29,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:51:29,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385055921] [2019-12-27 06:51:29,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:29,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:51:29,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242162078] [2019-12-27 06:51:29,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:51:29,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:29,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:51:29,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:51:29,943 INFO L87 Difference]: Start difference. First operand 22685 states and 70116 transitions. Second operand 15 states. [2019-12-27 06:51:34,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:34,581 INFO L93 Difference]: Finished difference Result 48554 states and 148304 transitions. [2019-12-27 06:51:34,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 06:51:34,582 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 06:51:34,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:34,640 INFO L225 Difference]: With dead ends: 48554 [2019-12-27 06:51:34,641 INFO L226 Difference]: Without dead ends: 41280 [2019-12-27 06:51:34,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=620, Invalid=3412, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 06:51:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41280 states. [2019-12-27 06:51:35,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41280 to 23469. [2019-12-27 06:51:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23469 states. [2019-12-27 06:51:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23469 states to 23469 states and 72183 transitions. [2019-12-27 06:51:35,112 INFO L78 Accepts]: Start accepts. Automaton has 23469 states and 72183 transitions. Word has length 67 [2019-12-27 06:51:35,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:35,112 INFO L462 AbstractCegarLoop]: Abstraction has 23469 states and 72183 transitions. [2019-12-27 06:51:35,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:51:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 23469 states and 72183 transitions. [2019-12-27 06:51:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:51:35,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:35,138 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:51:35,138 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:51:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:35,139 INFO L82 PathProgramCache]: Analyzing trace with hash 744299942, now seen corresponding path program 2 times [2019-12-27 06:51:35,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:35,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744235516] [2019-12-27 06:51:35,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:35,597 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:51:35,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744235516] [2019-12-27 06:51:35,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:35,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:51:35,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316509505] [2019-12-27 06:51:35,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:51:35,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:35,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:51:35,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:51:35,600 INFO L87 Difference]: Start difference. First operand 23469 states and 72183 transitions. Second operand 15 states. [2019-12-27 06:51:40,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:40,040 INFO L93 Difference]: Finished difference Result 41573 states and 126422 transitions. [2019-12-27 06:51:40,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 06:51:40,041 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 06:51:40,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:40,093 INFO L225 Difference]: With dead ends: 41573 [2019-12-27 06:51:40,094 INFO L226 Difference]: Without dead ends: 41214 [2019-12-27 06:51:40,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=497, Invalid=2473, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 06:51:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41214 states. [2019-12-27 06:51:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41214 to 23229. [2019-12-27 06:51:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23229 states. [2019-12-27 06:51:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23229 states to 23229 states and 71515 transitions. [2019-12-27 06:51:40,540 INFO L78 Accepts]: Start accepts. Automaton has 23229 states and 71515 transitions. Word has length 67 [2019-12-27 06:51:40,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:40,540 INFO L462 AbstractCegarLoop]: Abstraction has 23229 states and 71515 transitions. [2019-12-27 06:51:40,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:51:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 23229 states and 71515 transitions. [2019-12-27 06:51:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:51:40,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:40,566 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:51:40,566 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:51:40,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:40,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1579837296, now seen corresponding path program 3 times [2019-12-27 06:51:40,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:40,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831396220] [2019-12-27 06:51:40,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:41,110 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:51:41,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831396220] [2019-12-27 06:51:41,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:41,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 06:51:41,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532240699] [2019-12-27 06:51:41,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 06:51:41,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:41,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 06:51:41,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:51:41,112 INFO L87 Difference]: Start difference. First operand 23229 states and 71515 transitions. Second operand 17 states. [2019-12-27 06:51:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:46,295 INFO L93 Difference]: Finished difference Result 41794 states and 126908 transitions. [2019-12-27 06:51:46,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 06:51:46,296 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 06:51:46,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:46,342 INFO L225 Difference]: With dead ends: 41794 [2019-12-27 06:51:46,342 INFO L226 Difference]: Without dead ends: 32377 [2019-12-27 06:51:46,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=411, Invalid=2139, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 06:51:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32377 states. [2019-12-27 06:51:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32377 to 24124. [2019-12-27 06:51:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24124 states. [2019-12-27 06:51:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24124 states to 24124 states and 73631 transitions. [2019-12-27 06:51:47,029 INFO L78 Accepts]: Start accepts. Automaton has 24124 states and 73631 transitions. Word has length 67 [2019-12-27 06:51:47,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:47,029 INFO L462 AbstractCegarLoop]: Abstraction has 24124 states and 73631 transitions. [2019-12-27 06:51:47,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 06:51:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 24124 states and 73631 transitions. [2019-12-27 06:51:47,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:51:47,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:47,053 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:51:47,053 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:51:47,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:47,054 INFO L82 PathProgramCache]: Analyzing trace with hash 2122626696, now seen corresponding path program 4 times [2019-12-27 06:51:47,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:47,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817060506] [2019-12-27 06:51:47,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:47,627 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:51:47,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817060506] [2019-12-27 06:51:47,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:47,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 06:51:47,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476575790] [2019-12-27 06:51:47,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 06:51:47,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:47,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 06:51:47,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-27 06:51:47,629 INFO L87 Difference]: Start difference. First operand 24124 states and 73631 transitions. Second operand 18 states. [2019-12-27 06:51:52,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:52,409 INFO L93 Difference]: Finished difference Result 35332 states and 106385 transitions. [2019-12-27 06:51:52,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 06:51:52,410 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 06:51:52,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:52,456 INFO L225 Difference]: With dead ends: 35332 [2019-12-27 06:51:52,456 INFO L226 Difference]: Without dead ends: 32691 [2019-12-27 06:51:52,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=368, Invalid=1612, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 06:51:52,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32691 states. [2019-12-27 06:51:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32691 to 24240. [2019-12-27 06:51:52,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24240 states. [2019-12-27 06:51:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24240 states to 24240 states and 73931 transitions. [2019-12-27 06:51:52,885 INFO L78 Accepts]: Start accepts. Automaton has 24240 states and 73931 transitions. Word has length 67 [2019-12-27 06:51:52,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:52,885 INFO L462 AbstractCegarLoop]: Abstraction has 24240 states and 73931 transitions. [2019-12-27 06:51:52,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 06:51:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 24240 states and 73931 transitions. [2019-12-27 06:51:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:51:52,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:52,914 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:51:52,914 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:51:52,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:52,914 INFO L82 PathProgramCache]: Analyzing trace with hash 40207360, now seen corresponding path program 5 times [2019-12-27 06:51:52,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:52,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005030234] [2019-12-27 06:51:52,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:53,502 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:51:53,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005030234] [2019-12-27 06:51:53,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:53,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 06:51:53,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137906507] [2019-12-27 06:51:53,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 06:51:53,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:53,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 06:51:53,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-27 06:51:53,504 INFO L87 Difference]: Start difference. First operand 24240 states and 73931 transitions. Second operand 18 states. [2019-12-27 06:51:54,235 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-12-27 06:51:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:51:59,031 INFO L93 Difference]: Finished difference Result 36147 states and 108975 transitions. [2019-12-27 06:51:59,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 06:51:59,031 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 06:51:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:51:59,077 INFO L225 Difference]: With dead ends: 36147 [2019-12-27 06:51:59,077 INFO L226 Difference]: Without dead ends: 32769 [2019-12-27 06:51:59,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=359, Invalid=1533, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 06:51:59,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32769 states. [2019-12-27 06:51:59,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32769 to 24068. [2019-12-27 06:51:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24068 states. [2019-12-27 06:51:59,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24068 states to 24068 states and 73492 transitions. [2019-12-27 06:51:59,497 INFO L78 Accepts]: Start accepts. Automaton has 24068 states and 73492 transitions. Word has length 67 [2019-12-27 06:51:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:51:59,497 INFO L462 AbstractCegarLoop]: Abstraction has 24068 states and 73492 transitions. [2019-12-27 06:51:59,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 06:51:59,498 INFO L276 IsEmpty]: Start isEmpty. Operand 24068 states and 73492 transitions. [2019-12-27 06:51:59,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:51:59,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:59,525 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:51:59,526 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:51:59,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:59,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1036353856, now seen corresponding path program 6 times [2019-12-27 06:51:59,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:59,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351320428] [2019-12-27 06:51:59,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:59,928 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:51:59,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351320428] [2019-12-27 06:51:59,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:59,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:51:59,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628773793] [2019-12-27 06:51:59,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:51:59,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:59,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:51:59,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:51:59,931 INFO L87 Difference]: Start difference. First operand 24068 states and 73492 transitions. Second operand 15 states. [2019-12-27 06:52:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:06,062 INFO L93 Difference]: Finished difference Result 50813 states and 154631 transitions. [2019-12-27 06:52:06,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 06:52:06,062 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 06:52:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:06,129 INFO L225 Difference]: With dead ends: 50813 [2019-12-27 06:52:06,130 INFO L226 Difference]: Without dead ends: 48598 [2019-12-27 06:52:06,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=609, Invalid=3551, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 06:52:06,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48598 states. [2019-12-27 06:52:06,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48598 to 27401. [2019-12-27 06:52:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27401 states. [2019-12-27 06:52:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27401 states to 27401 states and 84054 transitions. [2019-12-27 06:52:06,712 INFO L78 Accepts]: Start accepts. Automaton has 27401 states and 84054 transitions. Word has length 67 [2019-12-27 06:52:06,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:06,712 INFO L462 AbstractCegarLoop]: Abstraction has 27401 states and 84054 transitions. [2019-12-27 06:52:06,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:52:06,712 INFO L276 IsEmpty]: Start isEmpty. Operand 27401 states and 84054 transitions. [2019-12-27 06:52:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:52:06,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:06,741 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:52:06,741 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:06,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:06,742 INFO L82 PathProgramCache]: Analyzing trace with hash -340540590, now seen corresponding path program 7 times [2019-12-27 06:52:06,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:06,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364766094] [2019-12-27 06:52:06,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:07,092 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:52:07,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364766094] [2019-12-27 06:52:07,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:07,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:52:07,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988844893] [2019-12-27 06:52:07,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:52:07,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:07,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:52:07,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:52:07,094 INFO L87 Difference]: Start difference. First operand 27401 states and 84054 transitions. Second operand 15 states. [2019-12-27 06:52:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:12,220 INFO L93 Difference]: Finished difference Result 49291 states and 149487 transitions. [2019-12-27 06:52:12,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 06:52:12,221 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 06:52:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:12,277 INFO L225 Difference]: With dead ends: 49291 [2019-12-27 06:52:12,278 INFO L226 Difference]: Without dead ends: 41492 [2019-12-27 06:52:12,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=526, Invalid=2444, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 06:52:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41492 states. [2019-12-27 06:52:12,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41492 to 23204. [2019-12-27 06:52:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23204 states. [2019-12-27 06:52:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23204 states to 23204 states and 71102 transitions. [2019-12-27 06:52:12,746 INFO L78 Accepts]: Start accepts. Automaton has 23204 states and 71102 transitions. Word has length 67 [2019-12-27 06:52:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:12,746 INFO L462 AbstractCegarLoop]: Abstraction has 23204 states and 71102 transitions. [2019-12-27 06:52:12,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:52:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 23204 states and 71102 transitions. [2019-12-27 06:52:12,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:52:12,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:12,772 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:52:12,772 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:12,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:12,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1590486634, now seen corresponding path program 8 times [2019-12-27 06:52:12,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:12,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296215831] [2019-12-27 06:52:12,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:12,866 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:52:12,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296215831] [2019-12-27 06:52:12,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:12,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:52:12,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796422644] [2019-12-27 06:52:12,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:52:12,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:12,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:52:12,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:52:12,868 INFO L87 Difference]: Start difference. First operand 23204 states and 71102 transitions. Second operand 9 states. [2019-12-27 06:52:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:14,076 INFO L93 Difference]: Finished difference Result 37772 states and 114740 transitions. [2019-12-27 06:52:14,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:52:14,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 06:52:14,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:14,121 INFO L225 Difference]: With dead ends: 37772 [2019-12-27 06:52:14,121 INFO L226 Difference]: Without dead ends: 31372 [2019-12-27 06:52:14,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 06:52:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31372 states. [2019-12-27 06:52:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31372 to 23098. [2019-12-27 06:52:14,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23098 states. [2019-12-27 06:52:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23098 states to 23098 states and 70683 transitions. [2019-12-27 06:52:14,534 INFO L78 Accepts]: Start accepts. Automaton has 23098 states and 70683 transitions. Word has length 67 [2019-12-27 06:52:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:14,535 INFO L462 AbstractCegarLoop]: Abstraction has 23098 states and 70683 transitions. [2019-12-27 06:52:14,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:52:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 23098 states and 70683 transitions. [2019-12-27 06:52:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:52:14,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:14,558 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:52:14,558 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:14,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2065181176, now seen corresponding path program 9 times [2019-12-27 06:52:14,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:14,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144315808] [2019-12-27 06:52:14,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:14,744 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:52:14,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144315808] [2019-12-27 06:52:14,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:14,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:52:14,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314610080] [2019-12-27 06:52:14,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:52:14,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:14,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:52:14,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:52:14,745 INFO L87 Difference]: Start difference. First operand 23098 states and 70683 transitions. Second operand 11 states. [2019-12-27 06:52:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:15,812 INFO L93 Difference]: Finished difference Result 41404 states and 127241 transitions. [2019-12-27 06:52:15,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 06:52:15,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:52:15,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:15,870 INFO L225 Difference]: With dead ends: 41404 [2019-12-27 06:52:15,870 INFO L226 Difference]: Without dead ends: 39489 [2019-12-27 06:52:15,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-27 06:52:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39489 states. [2019-12-27 06:52:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39489 to 25348. [2019-12-27 06:52:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25348 states. [2019-12-27 06:52:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25348 states to 25348 states and 77949 transitions. [2019-12-27 06:52:16,595 INFO L78 Accepts]: Start accepts. Automaton has 25348 states and 77949 transitions. Word has length 67 [2019-12-27 06:52:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:16,595 INFO L462 AbstractCegarLoop]: Abstraction has 25348 states and 77949 transitions. [2019-12-27 06:52:16,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:52:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 25348 states and 77949 transitions. [2019-12-27 06:52:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:52:16,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:16,625 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:52:16,625 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:16,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:16,625 INFO L82 PathProgramCache]: Analyzing trace with hash 688286730, now seen corresponding path program 10 times [2019-12-27 06:52:16,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:16,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666484408] [2019-12-27 06:52:16,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:16,852 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:52:16,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666484408] [2019-12-27 06:52:16,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:16,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:52:16,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546789627] [2019-12-27 06:52:16,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:52:16,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:16,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:52:16,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:52:16,857 INFO L87 Difference]: Start difference. First operand 25348 states and 77949 transitions. Second operand 11 states. [2019-12-27 06:52:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:17,751 INFO L93 Difference]: Finished difference Result 40060 states and 122773 transitions. [2019-12-27 06:52:17,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 06:52:17,751 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:52:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:17,799 INFO L225 Difference]: With dead ends: 40060 [2019-12-27 06:52:17,799 INFO L226 Difference]: Without dead ends: 34711 [2019-12-27 06:52:17,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:52:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34711 states. [2019-12-27 06:52:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34711 to 22082. [2019-12-27 06:52:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22082 states. [2019-12-27 06:52:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22082 states to 22082 states and 67653 transitions. [2019-12-27 06:52:18,224 INFO L78 Accepts]: Start accepts. Automaton has 22082 states and 67653 transitions. Word has length 67 [2019-12-27 06:52:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:18,224 INFO L462 AbstractCegarLoop]: Abstraction has 22082 states and 67653 transitions. [2019-12-27 06:52:18,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:52:18,224 INFO L276 IsEmpty]: Start isEmpty. Operand 22082 states and 67653 transitions. [2019-12-27 06:52:18,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:52:18,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:18,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:18,249 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:18,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:18,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1450844730, now seen corresponding path program 11 times [2019-12-27 06:52:18,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:18,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132734167] [2019-12-27 06:52:18,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:52:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:52:18,363 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:52:18,363 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:52:18,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1388~0.base_23| 4)) (= v_~z$r_buff0_thd3~0_77 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$w_buff1_used~0_77) (= 0 v_~z$w_buff1~0_28) (= 0 v_~__unbuffered_cnt~0_21) (= v_~z$r_buff0_thd2~0_19 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1388~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1388~0.base_23|) |v_ULTIMATE.start_main_~#t1388~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~weak$$choice2~0_32) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= |v_ULTIMATE.start_main_~#t1388~0.offset_17| 0) (= 0 |v_#NULL.base_6|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1388~0.base_23|) 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1388~0.base_23|) (= v_~z$r_buff0_thd0~0_18 0) (= v_~z~0_27 0) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1388~0.base_23| 1)) (= v_~z$r_buff0_thd1~0_22 0) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_26) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~__unbuffered_p1_EAX~0_16) (= 0 v_~z$r_buff1_thd1~0_16) (= v_~z$w_buff0_used~0_116 0) (= v_~x~0_16 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_~#t1390~0.base=|v_ULTIMATE.start_main_~#t1390~0.base_18|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ULTIMATE.start_main_~#t1388~0.base=|v_ULTIMATE.start_main_~#t1388~0.base_23|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_77, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_16, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ULTIMATE.start_main_~#t1389~0.base=|v_ULTIMATE.start_main_~#t1389~0.base_22|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t1389~0.offset=|v_ULTIMATE.start_main_~#t1389~0.offset_17|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ULTIMATE.start_main_~#t1388~0.offset=|v_ULTIMATE.start_main_~#t1388~0.offset_17|, ULTIMATE.start_main_~#t1390~0.offset=|v_ULTIMATE.start_main_~#t1390~0.offset_13|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1389~0.base, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t1390~0.base, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1388~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1389~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0, ULTIMATE.start_main_~#t1388~0.offset, ULTIMATE.start_main_~#t1390~0.offset] because there is no mapped edge [2019-12-27 06:52:18,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1389~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1389~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t1389~0.offset_8| 0) (not (= |v_ULTIMATE.start_main_~#t1389~0.base_9| 0)) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1389~0.base_9| 1) |v_#valid_33|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1389~0.base_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1389~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1389~0.base_9|) |v_ULTIMATE.start_main_~#t1389~0.offset_8| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1389~0.base=|v_ULTIMATE.start_main_~#t1389~0.base_9|, ULTIMATE.start_main_~#t1389~0.offset=|v_ULTIMATE.start_main_~#t1389~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1389~0.base, ULTIMATE.start_main_~#t1389~0.offset] because there is no mapped edge [2019-12-27 06:52:18,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1_used~0_Out-2050040956 ~z$w_buff0_used~0_In-2050040956) (= 1 ~z$w_buff0_used~0_Out-2050040956) (= ~z$w_buff0~0_In-2050040956 ~z$w_buff1~0_Out-2050040956) (= (mod ~z$w_buff1_used~0_Out-2050040956 256) 0) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2050040956|) (= ~z$w_buff0~0_Out-2050040956 1) (= |P0Thread1of1ForFork0_#in~arg.base_In-2050040956| P0Thread1of1ForFork0_~arg.base_Out-2050040956) (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2050040956 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2050040956|) (= |P0Thread1of1ForFork0_#in~arg.offset_In-2050040956| P0Thread1of1ForFork0_~arg.offset_Out-2050040956)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-2050040956|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2050040956, ~z$w_buff0~0=~z$w_buff0~0_In-2050040956, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-2050040956|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-2050040956|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-2050040956, ~z$w_buff0~0=~z$w_buff0~0_Out-2050040956, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-2050040956, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2050040956, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-2050040956|, ~z$w_buff1~0=~z$w_buff1~0_Out-2050040956, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-2050040956, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2050040956|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-2050040956} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:52:18,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L822-1-->L824: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1390~0.base_11| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1390~0.base_11| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1390~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1390~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1390~0.base_11|) |v_ULTIMATE.start_main_~#t1390~0.offset_9| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1390~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1390~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t1390~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1390~0.base=|v_ULTIMATE.start_main_~#t1390~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1390~0.offset=|v_ULTIMATE.start_main_~#t1390~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1390~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1390~0.offset] because there is no mapped edge [2019-12-27 06:52:18,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1140822805 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-1140822805| |P1Thread1of1ForFork1_#t~ite10_Out-1140822805|)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1140822805 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1140822805| ~z~0_In-1140822805) .cse0 (or .cse1 .cse2)) (and (not .cse2) .cse0 (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1140822805| ~z$w_buff1~0_In-1140822805)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1140822805, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1140822805, ~z$w_buff1~0=~z$w_buff1~0_In-1140822805, ~z~0=~z~0_In-1140822805} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1140822805|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1140822805, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1140822805, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1140822805|, ~z$w_buff1~0=~z$w_buff1~0_In-1140822805, ~z~0=~z~0_In-1140822805} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 06:52:18,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1970375863 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1970375863 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out1970375863| ~z$w_buff0_used~0_In1970375863) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1970375863|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1970375863, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1970375863} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1970375863, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1970375863|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1970375863} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 06:52:18,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-22568750 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-22568750 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-22568750 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-22568750 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-22568750| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-22568750| ~z$w_buff1_used~0_In-22568750) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-22568750, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-22568750, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-22568750, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-22568750} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-22568750, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-22568750, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-22568750, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-22568750|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-22568750} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:52:18,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-156355789 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-156355789 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-156355789 |P1Thread1of1ForFork1_#t~ite13_Out-156355789|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-156355789| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-156355789, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-156355789} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-156355789, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-156355789|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-156355789} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 06:52:18,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L787-->L787-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-176424580 256) 0))) (or (and (= ~z$w_buff1~0_In-176424580 |P2Thread1of1ForFork2_#t~ite23_Out-176424580|) (= |P2Thread1of1ForFork2_#t~ite23_Out-176424580| |P2Thread1of1ForFork2_#t~ite24_Out-176424580|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-176424580 256) 0))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In-176424580 256) 0)) (and (= 0 (mod ~z$r_buff1_thd3~0_In-176424580 256)) .cse0) (= (mod ~z$w_buff0_used~0_In-176424580 256) 0))) .cse1) (and (= ~z$w_buff1~0_In-176424580 |P2Thread1of1ForFork2_#t~ite24_Out-176424580|) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite23_In-176424580| |P2Thread1of1ForFork2_#t~ite23_Out-176424580|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-176424580|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-176424580, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-176424580, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-176424580, ~z$w_buff1~0=~z$w_buff1~0_In-176424580, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-176424580, ~weak$$choice2~0=~weak$$choice2~0_In-176424580} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-176424580|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-176424580|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-176424580, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-176424580, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-176424580, ~z$w_buff1~0=~z$w_buff1~0_In-176424580, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-176424580, ~weak$$choice2~0=~weak$$choice2~0_In-176424580} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 06:52:18,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L788-->L788-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In119466838 256) 0))) (or (and (= ~z$w_buff0_used~0_In119466838 |P2Thread1of1ForFork2_#t~ite26_Out119466838|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In119466838 256)))) (or (and (= (mod ~z$w_buff1_used~0_In119466838 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In119466838 256)) (and (= (mod ~z$r_buff1_thd3~0_In119466838 256) 0) .cse1))) (= |P2Thread1of1ForFork2_#t~ite26_Out119466838| |P2Thread1of1ForFork2_#t~ite27_Out119466838|)) (and (= ~z$w_buff0_used~0_In119466838 |P2Thread1of1ForFork2_#t~ite27_Out119466838|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite26_In119466838| |P2Thread1of1ForFork2_#t~ite26_Out119466838|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In119466838|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In119466838, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In119466838, ~z$w_buff1_used~0=~z$w_buff1_used~0_In119466838, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In119466838, ~weak$$choice2~0=~weak$$choice2~0_In119466838} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out119466838|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In119466838, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In119466838, ~z$w_buff1_used~0=~z$w_buff1_used~0_In119466838, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In119466838, ~weak$$choice2~0=~weak$$choice2~0_In119466838, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out119466838|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 06:52:18,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In211988486 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In211988486 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In211988486 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In211988486 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out211988486| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out211988486| ~z$r_buff1_thd2~0_In211988486)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In211988486, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In211988486, ~z$w_buff1_used~0=~z$w_buff1_used~0_In211988486, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In211988486} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In211988486, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In211988486, ~z$w_buff1_used~0=~z$w_buff1_used~0_In211988486, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out211988486|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In211988486} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:52:18,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:52:18,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L789-->L789-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2013868143 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In2013868143 256)))) (or (= (mod ~z$w_buff0_used~0_In2013868143 256) 0) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In2013868143 256) 0)) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In2013868143 256))))) (= |P2Thread1of1ForFork2_#t~ite29_Out2013868143| ~z$w_buff1_used~0_In2013868143) (= |P2Thread1of1ForFork2_#t~ite30_Out2013868143| |P2Thread1of1ForFork2_#t~ite29_Out2013868143|) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite30_Out2013868143| ~z$w_buff1_used~0_In2013868143) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite29_In2013868143| |P2Thread1of1ForFork2_#t~ite29_Out2013868143|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2013868143, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2013868143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2013868143, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2013868143, ~weak$$choice2~0=~weak$$choice2~0_In2013868143, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In2013868143|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out2013868143|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2013868143, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2013868143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2013868143, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2013868143, ~weak$$choice2~0=~weak$$choice2~0_In2013868143, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out2013868143|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 06:52:18,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff0_thd3~0_51)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 06:52:18,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 06:52:18,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1991089566 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1991089566 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1991089566|) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1991089566| ~z$w_buff0_used~0_In1991089566)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1991089566, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1991089566} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1991089566|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1991089566, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1991089566} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:52:18,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In324049469 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In324049469 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In324049469 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In324049469 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out324049469| ~z$w_buff1_used~0_In324049469)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out324049469| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In324049469, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In324049469, ~z$w_buff1_used~0=~z$w_buff1_used~0_In324049469, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In324049469} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out324049469|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In324049469, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In324049469, ~z$w_buff1_used~0=~z$w_buff1_used~0_In324049469, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In324049469} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:52:18,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In904522855 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In904522855 256)))) (or (and (= ~z$r_buff0_thd1~0_Out904522855 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In904522855 ~z$r_buff0_thd1~0_Out904522855)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In904522855, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In904522855} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In904522855, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out904522855|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out904522855} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:52:18,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In381653671 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In381653671 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In381653671 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In381653671 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out381653671|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In381653671 |P0Thread1of1ForFork0_#t~ite8_Out381653671|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In381653671, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In381653671, ~z$w_buff1_used~0=~z$w_buff1_used~0_In381653671, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In381653671} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In381653671, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out381653671|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In381653671, ~z$w_buff1_used~0=~z$w_buff1_used~0_In381653671, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In381653671} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:52:18,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:52:18,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-217428034 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out-217428034| |P2Thread1of1ForFork2_#t~ite39_Out-217428034|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-217428034 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out-217428034| ~z~0_In-217428034) .cse2) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out-217428034| ~z$w_buff1~0_In-217428034) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-217428034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-217428034, ~z$w_buff1~0=~z$w_buff1~0_In-217428034, ~z~0=~z~0_In-217428034} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-217428034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-217428034, ~z$w_buff1~0=~z$w_buff1~0_In-217428034, ~z~0=~z~0_In-217428034, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-217428034|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-217428034|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 06:52:18,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-311091262 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-311091262 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-311091262 |P2Thread1of1ForFork2_#t~ite40_Out-311091262|)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out-311091262| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-311091262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-311091262} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-311091262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-311091262, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-311091262|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 06:52:18,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1102160365 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1102160365 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1102160365 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1102160365 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out-1102160365| ~z$w_buff1_used~0_In-1102160365) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite41_Out-1102160365| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1102160365, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1102160365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1102160365, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1102160365} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1102160365|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1102160365, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1102160365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1102160365, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1102160365} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 06:52:18,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2081563046 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-2081563046 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-2081563046| ~z$r_buff0_thd3~0_In-2081563046) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-2081563046|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2081563046, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2081563046} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-2081563046|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2081563046, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2081563046} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 06:52:18,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1428732181 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1428732181 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1428732181 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1428732181 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out1428732181|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In1428732181 |P2Thread1of1ForFork2_#t~ite43_Out1428732181|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1428732181, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1428732181, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1428732181, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1428732181} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1428732181, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1428732181, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1428732181|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1428732181, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1428732181} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 06:52:18,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_42) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 06:52:18,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~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:52:18,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1726963400 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1726963400 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite48_Out1726963400| |ULTIMATE.start_main_#t~ite47_Out1726963400|))) (or (and (= ~z$w_buff1~0_In1726963400 |ULTIMATE.start_main_#t~ite47_Out1726963400|) (not .cse0) .cse1 (not .cse2)) (and (= ~z~0_In1726963400 |ULTIMATE.start_main_#t~ite47_Out1726963400|) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1726963400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1726963400, ~z$w_buff1~0=~z$w_buff1~0_In1726963400, ~z~0=~z~0_In1726963400} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1726963400, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1726963400|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1726963400, ~z$w_buff1~0=~z$w_buff1~0_In1726963400, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1726963400|, ~z~0=~z~0_In1726963400} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:52:18,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In761353438 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In761353438 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out761353438| ~z$w_buff0_used~0_In761353438) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out761353438| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In761353438, ~z$w_buff0_used~0=~z$w_buff0_used~0_In761353438} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In761353438, ~z$w_buff0_used~0=~z$w_buff0_used~0_In761353438, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out761353438|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:52:18,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In357704020 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In357704020 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In357704020 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In357704020 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out357704020| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite50_Out357704020| ~z$w_buff1_used~0_In357704020) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In357704020, ~z$w_buff0_used~0=~z$w_buff0_used~0_In357704020, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In357704020, ~z$w_buff1_used~0=~z$w_buff1_used~0_In357704020} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out357704020|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In357704020, ~z$w_buff0_used~0=~z$w_buff0_used~0_In357704020, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In357704020, ~z$w_buff1_used~0=~z$w_buff1_used~0_In357704020} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:52:18,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1816622752 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1816622752 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1816622752|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In1816622752 |ULTIMATE.start_main_#t~ite51_Out1816622752|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1816622752, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1816622752} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1816622752, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1816622752|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1816622752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:52:18,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-572028106 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-572028106 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-572028106 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-572028106 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-572028106| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-572028106| ~z$r_buff1_thd0~0_In-572028106)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-572028106, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-572028106, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-572028106, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-572028106} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-572028106|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-572028106, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-572028106, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-572028106, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-572028106} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:52:18,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= 2 v_~x~0_8) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8, 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, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:52:18,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:52:18 BasicIcfg [2019-12-27 06:52:18,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:52:18,481 INFO L168 Benchmark]: Toolchain (without parser) took 145705.50 ms. Allocated memory was 145.2 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 101.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 06:52:18,481 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 06:52:18,482 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.30 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.2 MB in the beginning and 155.0 MB in the end (delta: -53.8 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:52:18,482 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.58 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:52:18,482 INFO L168 Benchmark]: Boogie Preprocessor took 39.12 ms. Allocated memory is still 201.9 MB. Free memory was 152.1 MB in the beginning and 150.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:52:18,483 INFO L168 Benchmark]: RCFGBuilder took 861.19 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 100.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:52:18,483 INFO L168 Benchmark]: TraceAbstraction took 143966.81 ms. Allocated memory was 201.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 06:52:18,485 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.39 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 770.30 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.2 MB in the beginning and 155.0 MB in the end (delta: -53.8 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.58 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.12 ms. Allocated memory is still 201.9 MB. Free memory was 152.1 MB in the beginning and 150.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 861.19 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 100.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 143966.81 ms. Allocated memory was 201.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6848 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1388, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1389, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1390, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 y = 1 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 143.6s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 68.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10066 SDtfs, 15055 SDslu, 42817 SDs, 0 SdLazy, 39472 SolverSat, 721 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 722 GetRequests, 62 SyntacticMatches, 41 SemanticMatches, 619 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6464 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred 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: 46.7s AutomataMinimizationTime, 37 MinimizatonAttempts, 409368 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 2036 NumberOfCodeBlocks, 2036 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1932 ConstructedInterpolants, 0 QuantifiedInterpolants, 531012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...