/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:42:56,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:42:56,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:42:56,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:42:56,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:42:56,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:42:56,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:42:56,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:42:56,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:42:56,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:42:56,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:42:56,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:42:56,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:42:56,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:42:56,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:42:56,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:42:56,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:42:56,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:42:56,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:42:56,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:42:56,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:42:56,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:42:56,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:42:56,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:42:56,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:42:56,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:42:56,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:42:56,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:42:56,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:42:56,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:42:56,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:42:56,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:42:56,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:42:56,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:42:56,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:42:56,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:42:56,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:42:56,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:42:56,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:42:56,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:42:56,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:42:56,530 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-MCR.epf [2019-12-27 21:42:56,544 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:42:56,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:42:56,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:42:56,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:42:56,546 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:42:56,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:42:56,546 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:42:56,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:42:56,547 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:42:56,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:42:56,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:42:56,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:42:56,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:42:56,547 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:42:56,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:42:56,548 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:42:56,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:42:56,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:42:56,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:42:56,549 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:42:56,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:42:56,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:42:56,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:42:56,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:42:56,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:42:56,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:42:56,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:42:56,550 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:42:56,550 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:42:56,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:42:56,551 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:42:56,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:42:56,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:42:56,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:42:56,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:42:56,875 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:42:56,875 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:42:56,876 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.oepc.i [2019-12-27 21:42:56,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb6aac9e/277d37dfed824ead88ad4dbcd1d53ea9/FLAG56dd68584 [2019-12-27 21:42:57,533 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:42:57,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_rmo.oepc.i [2019-12-27 21:42:57,549 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb6aac9e/277d37dfed824ead88ad4dbcd1d53ea9/FLAG56dd68584 [2019-12-27 21:42:57,778 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb6aac9e/277d37dfed824ead88ad4dbcd1d53ea9 [2019-12-27 21:42:57,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:42:57,788 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:42:57,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:42:57,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:42:57,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:42:57,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:42:57" (1/1) ... [2019-12-27 21:42:57,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cad934d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:57, skipping insertion in model container [2019-12-27 21:42:57,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:42:57" (1/1) ... [2019-12-27 21:42:57,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:42:57,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:42:58,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:42:58,425 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:42:58,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:42:58,604 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:42:58,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:58 WrapperNode [2019-12-27 21:42:58,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:42:58,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:42:58,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:42:58,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:42:58,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:58" (1/1) ... [2019-12-27 21:42:58,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:58" (1/1) ... [2019-12-27 21:42:58,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:42:58,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:42:58,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:42:58,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:42:58,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:58" (1/1) ... [2019-12-27 21:42:58,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:58" (1/1) ... [2019-12-27 21:42:58,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:58" (1/1) ... [2019-12-27 21:42:58,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:58" (1/1) ... [2019-12-27 21:42:58,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:58" (1/1) ... [2019-12-27 21:42:58,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:58" (1/1) ... [2019-12-27 21:42:58,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:58" (1/1) ... [2019-12-27 21:42:58,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:42:58,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:42:58,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:42:58,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:42:58,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:58" (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 21:42:58,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:42:58,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:42:58,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:42:58,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:42:58,791 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:42:58,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:42:58,791 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:42:58,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:42:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:42:58,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:42:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:42:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:42:58,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:42:58,795 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 21:42:59,602 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:42:59,603 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:42:59,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:42:59 BoogieIcfgContainer [2019-12-27 21:42:59,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:42:59,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:42:59,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:42:59,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:42:59,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:42:57" (1/3) ... [2019-12-27 21:42:59,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad2322a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:42:59, skipping insertion in model container [2019-12-27 21:42:59,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:58" (2/3) ... [2019-12-27 21:42:59,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad2322a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:42:59, skipping insertion in model container [2019-12-27 21:42:59,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:42:59" (3/3) ... [2019-12-27 21:42:59,613 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_rmo.oepc.i [2019-12-27 21:42:59,624 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:42:59,625 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:42:59,633 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:42:59,634 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:42:59,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,678 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,678 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,679 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,679 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,680 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,688 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,688 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,715 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,716 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,744 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,744 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,744 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,747 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,748 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,753 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,755 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:59,777 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:42:59,799 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:42:59,799 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:42:59,799 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:42:59,799 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:42:59,799 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:42:59,800 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:42:59,800 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:42:59,800 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:42:59,818 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 21:42:59,820 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 21:42:59,927 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 21:42:59,927 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:42:59,950 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:42:59,978 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 21:43:00,034 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 21:43:00,034 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:43:00,044 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:43:00,067 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 21:43:00,069 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:43:03,690 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 21:43:03,830 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 21:43:03,854 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81192 [2019-12-27 21:43:03,855 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 21:43:03,859 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-27 21:43:21,286 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115082 states. [2019-12-27 21:43:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 115082 states. [2019-12-27 21:43:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:43:21,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:21,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:43:21,296 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 21:43:21,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:21,305 INFO L82 PathProgramCache]: Analyzing trace with hash 906063, now seen corresponding path program 1 times [2019-12-27 21:43:21,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:21,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314149883] [2019-12-27 21:43:21,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:21,524 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 21:43:21,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314149883] [2019-12-27 21:43:21,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:21,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:43:21,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1388743941] [2019-12-27 21:43:21,528 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:21,532 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:21,544 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:43:21,545 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:21,549 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:21,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:43:21,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:21,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:43:21,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:43:21,562 INFO L87 Difference]: Start difference. First operand 115082 states. Second operand 3 states. [2019-12-27 21:43:23,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:23,237 INFO L93 Difference]: Finished difference Result 113614 states and 485598 transitions. [2019-12-27 21:43:23,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:43:23,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:43:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:23,964 INFO L225 Difference]: With dead ends: 113614 [2019-12-27 21:43:23,967 INFO L226 Difference]: Without dead ends: 106516 [2019-12-27 21:43:23,969 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 21:43:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106516 states. [2019-12-27 21:43:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106516 to 106516. [2019-12-27 21:43:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106516 states. [2019-12-27 21:43:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106516 states to 106516 states and 454632 transitions. [2019-12-27 21:43:34,090 INFO L78 Accepts]: Start accepts. Automaton has 106516 states and 454632 transitions. Word has length 3 [2019-12-27 21:43:34,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:34,090 INFO L462 AbstractCegarLoop]: Abstraction has 106516 states and 454632 transitions. [2019-12-27 21:43:34,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:43:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 106516 states and 454632 transitions. [2019-12-27 21:43:34,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:43:34,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:34,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:34,095 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 21:43:34,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:34,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2135146020, now seen corresponding path program 1 times [2019-12-27 21:43:34,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:34,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575085190] [2019-12-27 21:43:34,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:34,260 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 21:43:34,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575085190] [2019-12-27 21:43:34,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:34,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:43:34,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1775140763] [2019-12-27 21:43:34,261 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:34,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:34,266 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:43:34,267 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:34,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:34,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:43:34,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:34,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:43:34,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:43:34,270 INFO L87 Difference]: Start difference. First operand 106516 states and 454632 transitions. Second operand 4 states. [2019-12-27 21:43:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:40,034 INFO L93 Difference]: Finished difference Result 168744 states and 686980 transitions. [2019-12-27 21:43:40,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:43:40,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:43:40,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:40,550 INFO L225 Difference]: With dead ends: 168744 [2019-12-27 21:43:40,550 INFO L226 Difference]: Without dead ends: 168695 [2019-12-27 21:43:40,551 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 21:43:48,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168695 states. [2019-12-27 21:43:51,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168695 to 154366. [2019-12-27 21:43:51,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154366 states. [2019-12-27 21:43:51,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154366 states to 154366 states and 637272 transitions. [2019-12-27 21:43:51,522 INFO L78 Accepts]: Start accepts. Automaton has 154366 states and 637272 transitions. Word has length 11 [2019-12-27 21:43:51,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:51,522 INFO L462 AbstractCegarLoop]: Abstraction has 154366 states and 637272 transitions. [2019-12-27 21:43:51,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:43:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 154366 states and 637272 transitions. [2019-12-27 21:43:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:43:51,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:51,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:51,529 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 21:43:51,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:51,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1594443795, now seen corresponding path program 1 times [2019-12-27 21:43:51,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:51,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835541950] [2019-12-27 21:43:51,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:51,593 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 21:43:51,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835541950] [2019-12-27 21:43:51,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:51,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:43:51,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [240056528] [2019-12-27 21:43:51,595 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:51,596 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:51,599 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:43:51,600 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:51,603 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:51,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:43:51,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:51,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:43:51,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:43:51,604 INFO L87 Difference]: Start difference. First operand 154366 states and 637272 transitions. Second operand 3 states. [2019-12-27 21:43:56,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:56,256 INFO L93 Difference]: Finished difference Result 33669 states and 109308 transitions. [2019-12-27 21:43:56,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:43:56,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:43:56,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:56,384 INFO L225 Difference]: With dead ends: 33669 [2019-12-27 21:43:56,384 INFO L226 Difference]: Without dead ends: 33669 [2019-12-27 21:43:56,385 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 21:43:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33669 states. [2019-12-27 21:43:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33669 to 33669. [2019-12-27 21:43:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33669 states. [2019-12-27 21:43:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33669 states to 33669 states and 109308 transitions. [2019-12-27 21:43:57,091 INFO L78 Accepts]: Start accepts. Automaton has 33669 states and 109308 transitions. Word has length 13 [2019-12-27 21:43:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:57,091 INFO L462 AbstractCegarLoop]: Abstraction has 33669 states and 109308 transitions. [2019-12-27 21:43:57,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:43:57,091 INFO L276 IsEmpty]: Start isEmpty. Operand 33669 states and 109308 transitions. [2019-12-27 21:43:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:43:57,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:57,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:57,094 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 21:43:57,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:57,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1527563672, now seen corresponding path program 1 times [2019-12-27 21:43:57,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:57,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706410520] [2019-12-27 21:43:57,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:57,188 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 21:43:57,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706410520] [2019-12-27 21:43:57,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:57,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:43:57,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [78043835] [2019-12-27 21:43:57,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:57,197 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:57,199 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:43:57,200 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:57,200 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:57,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:43:57,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:57,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:43:57,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:43:57,202 INFO L87 Difference]: Start difference. First operand 33669 states and 109308 transitions. Second operand 3 states. [2019-12-27 21:43:57,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:57,432 INFO L93 Difference]: Finished difference Result 50580 states and 164138 transitions. [2019-12-27 21:43:57,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:43:57,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:43:57,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:57,558 INFO L225 Difference]: With dead ends: 50580 [2019-12-27 21:43:57,558 INFO L226 Difference]: Without dead ends: 50580 [2019-12-27 21:43:57,559 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 21:43:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50580 states. [2019-12-27 21:43:58,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50580 to 36729. [2019-12-27 21:43:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36729 states. [2019-12-27 21:43:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36729 states to 36729 states and 120582 transitions. [2019-12-27 21:43:58,932 INFO L78 Accepts]: Start accepts. Automaton has 36729 states and 120582 transitions. Word has length 16 [2019-12-27 21:43:58,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:58,933 INFO L462 AbstractCegarLoop]: Abstraction has 36729 states and 120582 transitions. [2019-12-27 21:43:58,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:43:58,933 INFO L276 IsEmpty]: Start isEmpty. Operand 36729 states and 120582 transitions. [2019-12-27 21:43:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:43:58,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:58,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:58,936 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 21:43:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1527444198, now seen corresponding path program 1 times [2019-12-27 21:43:58,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:58,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492746038] [2019-12-27 21:43:58,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:43:59,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492746038] [2019-12-27 21:43:59,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:59,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:43:59,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1041083858] [2019-12-27 21:43:59,035 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:59,037 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:59,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:43:59,040 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:59,041 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:59,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:43:59,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:59,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:43:59,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:43:59,042 INFO L87 Difference]: Start difference. First operand 36729 states and 120582 transitions. Second operand 4 states. [2019-12-27 21:43:59,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:59,470 INFO L93 Difference]: Finished difference Result 43883 states and 141848 transitions. [2019-12-27 21:43:59,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:43:59,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:43:59,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:59,543 INFO L225 Difference]: With dead ends: 43883 [2019-12-27 21:43:59,544 INFO L226 Difference]: Without dead ends: 43883 [2019-12-27 21:43:59,544 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 21:43:59,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43883 states. [2019-12-27 21:44:00,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43883 to 40260. [2019-12-27 21:44:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40260 states. [2019-12-27 21:44:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40260 states to 40260 states and 131124 transitions. [2019-12-27 21:44:00,312 INFO L78 Accepts]: Start accepts. Automaton has 40260 states and 131124 transitions. Word has length 16 [2019-12-27 21:44:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:00,312 INFO L462 AbstractCegarLoop]: Abstraction has 40260 states and 131124 transitions. [2019-12-27 21:44:00,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:44:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 40260 states and 131124 transitions. [2019-12-27 21:44:00,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:44:00,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:00,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:44:00,316 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 21:44:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:00,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1609012266, now seen corresponding path program 1 times [2019-12-27 21:44:00,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:00,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055949603] [2019-12-27 21:44:00,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:00,376 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 21:44:00,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055949603] [2019-12-27 21:44:00,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:00,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:44:00,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [573459410] [2019-12-27 21:44:00,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:00,382 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:00,385 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:44:00,385 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:00,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:00,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:44:00,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:00,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:44:00,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:44:00,387 INFO L87 Difference]: Start difference. First operand 40260 states and 131124 transitions. Second operand 4 states. [2019-12-27 21:44:00,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:00,765 INFO L93 Difference]: Finished difference Result 47608 states and 154005 transitions. [2019-12-27 21:44:00,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:44:00,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:44:00,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:00,845 INFO L225 Difference]: With dead ends: 47608 [2019-12-27 21:44:00,845 INFO L226 Difference]: Without dead ends: 47608 [2019-12-27 21:44:00,846 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 21:44:01,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47608 states. [2019-12-27 21:44:01,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47608 to 40827. [2019-12-27 21:44:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40827 states. [2019-12-27 21:44:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40827 states to 40827 states and 133422 transitions. [2019-12-27 21:44:02,058 INFO L78 Accepts]: Start accepts. Automaton has 40827 states and 133422 transitions. Word has length 16 [2019-12-27 21:44:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:02,058 INFO L462 AbstractCegarLoop]: Abstraction has 40827 states and 133422 transitions. [2019-12-27 21:44:02,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:44:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 40827 states and 133422 transitions. [2019-12-27 21:44:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:44:02,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:02,069 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 21:44:02,069 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 21:44:02,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:02,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1226017601, now seen corresponding path program 1 times [2019-12-27 21:44:02,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:02,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828899044] [2019-12-27 21:44:02,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:02,187 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 21:44:02,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828899044] [2019-12-27 21:44:02,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:02,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:44:02,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [679891895] [2019-12-27 21:44:02,188 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:02,191 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:02,200 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 58 transitions. [2019-12-27 21:44:02,200 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:02,202 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:02,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:44:02,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:02,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:44:02,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:44:02,203 INFO L87 Difference]: Start difference. First operand 40827 states and 133422 transitions. Second operand 5 states. [2019-12-27 21:44:02,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:02,896 INFO L93 Difference]: Finished difference Result 57178 states and 181649 transitions. [2019-12-27 21:44:02,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:44:02,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 21:44:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:02,996 INFO L225 Difference]: With dead ends: 57178 [2019-12-27 21:44:02,996 INFO L226 Difference]: Without dead ends: 57171 [2019-12-27 21:44:02,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:44:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57171 states. [2019-12-27 21:44:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57171 to 42171. [2019-12-27 21:44:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42171 states. [2019-12-27 21:44:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42171 states to 42171 states and 137482 transitions. [2019-12-27 21:44:03,836 INFO L78 Accepts]: Start accepts. Automaton has 42171 states and 137482 transitions. Word has length 22 [2019-12-27 21:44:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:03,837 INFO L462 AbstractCegarLoop]: Abstraction has 42171 states and 137482 transitions. [2019-12-27 21:44:03,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:44:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 42171 states and 137482 transitions. [2019-12-27 21:44:03,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:44:03,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:03,846 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 21:44:03,847 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 21:44:03,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:03,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1893580273, now seen corresponding path program 1 times [2019-12-27 21:44:03,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:03,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706723099] [2019-12-27 21:44:03,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:03,905 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 21:44:03,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706723099] [2019-12-27 21:44:03,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:03,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:44:03,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [467994044] [2019-12-27 21:44:03,906 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:03,909 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:03,915 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 44 transitions. [2019-12-27 21:44:03,915 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:03,918 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:44:03,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:44:03,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:03,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:44:03,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:44:03,919 INFO L87 Difference]: Start difference. First operand 42171 states and 137482 transitions. Second operand 5 states. [2019-12-27 21:44:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:04,592 INFO L93 Difference]: Finished difference Result 59763 states and 189217 transitions. [2019-12-27 21:44:04,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:44:04,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 21:44:04,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:04,697 INFO L225 Difference]: With dead ends: 59763 [2019-12-27 21:44:04,697 INFO L226 Difference]: Without dead ends: 59756 [2019-12-27 21:44:04,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:44:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59756 states. [2019-12-27 21:44:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59756 to 40228. [2019-12-27 21:44:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40228 states. [2019-12-27 21:44:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40228 states to 40228 states and 131220 transitions. [2019-12-27 21:44:05,885 INFO L78 Accepts]: Start accepts. Automaton has 40228 states and 131220 transitions. Word has length 22 [2019-12-27 21:44:05,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:05,885 INFO L462 AbstractCegarLoop]: Abstraction has 40228 states and 131220 transitions. [2019-12-27 21:44:05,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:44:05,885 INFO L276 IsEmpty]: Start isEmpty. Operand 40228 states and 131220 transitions. [2019-12-27 21:44:05,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:44:05,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:05,897 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 21:44:05,897 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 21:44:05,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:05,897 INFO L82 PathProgramCache]: Analyzing trace with hash -386787907, now seen corresponding path program 1 times [2019-12-27 21:44:05,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:05,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113805239] [2019-12-27 21:44:05,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:05,937 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 21:44:05,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113805239] [2019-12-27 21:44:05,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:05,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:44:05,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1571955019] [2019-12-27 21:44:05,938 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:05,941 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:05,950 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 21:44:05,951 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:05,991 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:44:05,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:44:05,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:05,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:44:05,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:44:05,993 INFO L87 Difference]: Start difference. First operand 40228 states and 131220 transitions. Second operand 5 states. [2019-12-27 21:44:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:06,079 INFO L93 Difference]: Finished difference Result 15958 states and 49114 transitions. [2019-12-27 21:44:06,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:44:06,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:44:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:06,103 INFO L225 Difference]: With dead ends: 15958 [2019-12-27 21:44:06,103 INFO L226 Difference]: Without dead ends: 15958 [2019-12-27 21:44:06,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:44:06,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15958 states. [2019-12-27 21:44:06,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15958 to 15686. [2019-12-27 21:44:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-27 21:44:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 48338 transitions. [2019-12-27 21:44:06,351 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 48338 transitions. Word has length 25 [2019-12-27 21:44:06,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:06,351 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 48338 transitions. [2019-12-27 21:44:06,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:44:06,351 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 48338 transitions. [2019-12-27 21:44:06,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:44:06,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:06,364 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 21:44:06,364 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 21:44:06,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:06,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2128582184, now seen corresponding path program 1 times [2019-12-27 21:44:06,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:06,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976467897] [2019-12-27 21:44:06,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:06,434 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 21:44:06,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976467897] [2019-12-27 21:44:06,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:06,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:44:06,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2126663385] [2019-12-27 21:44:06,436 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:06,440 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:06,447 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:44:06,447 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:06,448 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:06,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:44:06,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:06,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:44:06,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:44:06,449 INFO L87 Difference]: Start difference. First operand 15686 states and 48338 transitions. Second operand 5 states. [2019-12-27 21:44:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:06,792 INFO L93 Difference]: Finished difference Result 20194 states and 61068 transitions. [2019-12-27 21:44:06,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:44:06,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 21:44:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:06,825 INFO L225 Difference]: With dead ends: 20194 [2019-12-27 21:44:06,825 INFO L226 Difference]: Without dead ends: 20194 [2019-12-27 21:44:06,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:44:06,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20194 states. [2019-12-27 21:44:07,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20194 to 18928. [2019-12-27 21:44:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18928 states. [2019-12-27 21:44:07,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18928 states to 18928 states and 57898 transitions. [2019-12-27 21:44:07,103 INFO L78 Accepts]: Start accepts. Automaton has 18928 states and 57898 transitions. Word has length 27 [2019-12-27 21:44:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:07,104 INFO L462 AbstractCegarLoop]: Abstraction has 18928 states and 57898 transitions. [2019-12-27 21:44:07,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:44:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 18928 states and 57898 transitions. [2019-12-27 21:44:07,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 21:44:07,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:07,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:44:07,117 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 21:44:07,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:07,117 INFO L82 PathProgramCache]: Analyzing trace with hash -786933729, now seen corresponding path program 1 times [2019-12-27 21:44:07,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:07,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937334768] [2019-12-27 21:44:07,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:07,174 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 21:44:07,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937334768] [2019-12-27 21:44:07,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:07,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:44:07,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [593837140] [2019-12-27 21:44:07,176 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:07,181 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:07,190 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 21:44:07,190 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:07,191 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:07,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:44:07,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:07,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:44:07,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:44:07,192 INFO L87 Difference]: Start difference. First operand 18928 states and 57898 transitions. Second operand 5 states. [2019-12-27 21:44:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:07,605 INFO L93 Difference]: Finished difference Result 21983 states and 66241 transitions. [2019-12-27 21:44:07,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:44:07,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 21:44:07,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:07,649 INFO L225 Difference]: With dead ends: 21983 [2019-12-27 21:44:07,649 INFO L226 Difference]: Without dead ends: 21983 [2019-12-27 21:44:07,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:44:07,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21983 states. [2019-12-27 21:44:07,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21983 to 17922. [2019-12-27 21:44:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17922 states. [2019-12-27 21:44:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17922 states to 17922 states and 54947 transitions. [2019-12-27 21:44:07,954 INFO L78 Accepts]: Start accepts. Automaton has 17922 states and 54947 transitions. Word has length 28 [2019-12-27 21:44:07,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:07,954 INFO L462 AbstractCegarLoop]: Abstraction has 17922 states and 54947 transitions. [2019-12-27 21:44:07,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:44:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 17922 states and 54947 transitions. [2019-12-27 21:44:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:44:07,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:07,975 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 21:44:07,975 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 21:44:07,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:07,975 INFO L82 PathProgramCache]: Analyzing trace with hash 960669183, now seen corresponding path program 1 times [2019-12-27 21:44:07,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:07,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337406649] [2019-12-27 21:44:07,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:08,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:44:08,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337406649] [2019-12-27 21:44:08,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:08,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:44:08,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [72068132] [2019-12-27 21:44:08,046 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:08,052 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:08,067 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 79 transitions. [2019-12-27 21:44:08,068 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:08,069 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:44:08,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:44:08,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:08,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:44:08,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:44:08,070 INFO L87 Difference]: Start difference. First operand 17922 states and 54947 transitions. Second operand 6 states. [2019-12-27 21:44:08,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:08,927 INFO L93 Difference]: Finished difference Result 25328 states and 75654 transitions. [2019-12-27 21:44:08,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:44:08,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 21:44:08,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:08,965 INFO L225 Difference]: With dead ends: 25328 [2019-12-27 21:44:08,965 INFO L226 Difference]: Without dead ends: 25328 [2019-12-27 21:44:08,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:44:09,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25328 states. [2019-12-27 21:44:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25328 to 19485. [2019-12-27 21:44:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19485 states. [2019-12-27 21:44:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19485 states to 19485 states and 59441 transitions. [2019-12-27 21:44:09,292 INFO L78 Accepts]: Start accepts. Automaton has 19485 states and 59441 transitions. Word has length 33 [2019-12-27 21:44:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:09,292 INFO L462 AbstractCegarLoop]: Abstraction has 19485 states and 59441 transitions. [2019-12-27 21:44:09,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:44:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 19485 states and 59441 transitions. [2019-12-27 21:44:09,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:44:09,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:09,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:44:09,314 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 21:44:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:09,314 INFO L82 PathProgramCache]: Analyzing trace with hash 446722116, now seen corresponding path program 1 times [2019-12-27 21:44:09,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:09,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68468517] [2019-12-27 21:44:09,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:09,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 21:44:09,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68468517] [2019-12-27 21:44:09,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:09,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:44:09,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1794638491] [2019-12-27 21:44:09,422 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:09,429 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:09,446 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 70 transitions. [2019-12-27 21:44:09,446 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:09,447 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:09,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:44:09,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:09,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:44:09,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:44:09,448 INFO L87 Difference]: Start difference. First operand 19485 states and 59441 transitions. Second operand 6 states. [2019-12-27 21:44:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:10,193 INFO L93 Difference]: Finished difference Result 24785 states and 74278 transitions. [2019-12-27 21:44:10,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:44:10,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 21:44:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:10,227 INFO L225 Difference]: With dead ends: 24785 [2019-12-27 21:44:10,227 INFO L226 Difference]: Without dead ends: 24785 [2019-12-27 21:44:10,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:44:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24785 states. [2019-12-27 21:44:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24785 to 16236. [2019-12-27 21:44:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16236 states. [2019-12-27 21:44:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16236 states to 16236 states and 49996 transitions. [2019-12-27 21:44:10,541 INFO L78 Accepts]: Start accepts. Automaton has 16236 states and 49996 transitions. Word has length 34 [2019-12-27 21:44:10,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:10,542 INFO L462 AbstractCegarLoop]: Abstraction has 16236 states and 49996 transitions. [2019-12-27 21:44:10,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:44:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 16236 states and 49996 transitions. [2019-12-27 21:44:10,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:44:10,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:10,562 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 21:44:10,562 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 21:44:10,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:10,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2087465042, now seen corresponding path program 1 times [2019-12-27 21:44:10,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:10,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122914744] [2019-12-27 21:44:10,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:10,615 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 21:44:10,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122914744] [2019-12-27 21:44:10,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:10,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:44:10,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [994260312] [2019-12-27 21:44:10,616 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:10,623 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:10,686 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 336 transitions. [2019-12-27 21:44:10,686 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:10,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:44:10,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:44:10,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:10,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:44:10,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:44:10,779 INFO L87 Difference]: Start difference. First operand 16236 states and 49996 transitions. Second operand 6 states. [2019-12-27 21:44:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:11,246 INFO L93 Difference]: Finished difference Result 39119 states and 120005 transitions. [2019-12-27 21:44:11,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:44:11,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-27 21:44:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:11,297 INFO L225 Difference]: With dead ends: 39119 [2019-12-27 21:44:11,297 INFO L226 Difference]: Without dead ends: 25137 [2019-12-27 21:44:11,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:44:11,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25137 states. [2019-12-27 21:44:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25137 to 16618. [2019-12-27 21:44:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16618 states. [2019-12-27 21:44:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16618 states to 16618 states and 49905 transitions. [2019-12-27 21:44:11,633 INFO L78 Accepts]: Start accepts. Automaton has 16618 states and 49905 transitions. Word has length 39 [2019-12-27 21:44:11,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:11,633 INFO L462 AbstractCegarLoop]: Abstraction has 16618 states and 49905 transitions. [2019-12-27 21:44:11,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:44:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 16618 states and 49905 transitions. [2019-12-27 21:44:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 21:44:11,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:11,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:44:11,650 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 21:44:11,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:11,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1869969437, now seen corresponding path program 1 times [2019-12-27 21:44:11,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:11,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774199673] [2019-12-27 21:44:11,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:11,736 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 21:44:11,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774199673] [2019-12-27 21:44:11,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:11,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:44:11,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1459183306] [2019-12-27 21:44:11,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:11,745 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:11,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 265 transitions. [2019-12-27 21:44:11,802 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:11,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:44:12,059 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 21:44:12,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:44:12,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:12,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:44:12,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:44:12,060 INFO L87 Difference]: Start difference. First operand 16618 states and 49905 transitions. Second operand 12 states. [2019-12-27 21:44:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:13,255 INFO L93 Difference]: Finished difference Result 24481 states and 72787 transitions. [2019-12-27 21:44:13,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:44:13,256 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-12-27 21:44:13,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:13,292 INFO L225 Difference]: With dead ends: 24481 [2019-12-27 21:44:13,292 INFO L226 Difference]: Without dead ends: 24481 [2019-12-27 21:44:13,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:44:13,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24481 states. [2019-12-27 21:44:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24481 to 22590. [2019-12-27 21:44:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22590 states. [2019-12-27 21:44:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22590 states to 22590 states and 67706 transitions. [2019-12-27 21:44:13,651 INFO L78 Accepts]: Start accepts. Automaton has 22590 states and 67706 transitions. Word has length 40 [2019-12-27 21:44:13,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:13,651 INFO L462 AbstractCegarLoop]: Abstraction has 22590 states and 67706 transitions. [2019-12-27 21:44:13,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:44:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 22590 states and 67706 transitions. [2019-12-27 21:44:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 21:44:13,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:13,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:44:13,679 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 21:44:13,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash 511931149, now seen corresponding path program 2 times [2019-12-27 21:44:13,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:13,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636650797] [2019-12-27 21:44:13,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:13,730 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 21:44:13,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636650797] [2019-12-27 21:44:13,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:13,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:44:13,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1704527466] [2019-12-27 21:44:13,731 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:13,739 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:13,823 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 393 transitions. [2019-12-27 21:44:13,824 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:13,855 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:44:13,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:44:13,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:13,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:44:13,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:44:13,856 INFO L87 Difference]: Start difference. First operand 22590 states and 67706 transitions. Second operand 7 states. [2019-12-27 21:44:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:13,976 INFO L93 Difference]: Finished difference Result 21296 states and 64675 transitions. [2019-12-27 21:44:13,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:44:13,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 21:44:13,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:14,012 INFO L225 Difference]: With dead ends: 21296 [2019-12-27 21:44:14,012 INFO L226 Difference]: Without dead ends: 19695 [2019-12-27 21:44:14,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:44:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19695 states. [2019-12-27 21:44:14,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19695 to 18820. [2019-12-27 21:44:14,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18820 states. [2019-12-27 21:44:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18820 states to 18820 states and 58791 transitions. [2019-12-27 21:44:14,303 INFO L78 Accepts]: Start accepts. Automaton has 18820 states and 58791 transitions. Word has length 40 [2019-12-27 21:44:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:14,303 INFO L462 AbstractCegarLoop]: Abstraction has 18820 states and 58791 transitions. [2019-12-27 21:44:14,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:44:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 18820 states and 58791 transitions. [2019-12-27 21:44:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:44:14,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:14,330 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 21:44:14,330 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 21:44:14,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:14,331 INFO L82 PathProgramCache]: Analyzing trace with hash -396532309, now seen corresponding path program 1 times [2019-12-27 21:44:14,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:14,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368260968] [2019-12-27 21:44:14,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:14,435 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 21:44:14,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368260968] [2019-12-27 21:44:14,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:14,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:44:14,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1428470654] [2019-12-27 21:44:14,436 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:14,457 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:14,645 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 321 transitions. [2019-12-27 21:44:14,645 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:14,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:44:14,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:44:14,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:14,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:44:14,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:44:14,714 INFO L87 Difference]: Start difference. First operand 18820 states and 58791 transitions. Second operand 10 states. [2019-12-27 21:44:16,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:16,072 INFO L93 Difference]: Finished difference Result 83037 states and 255738 transitions. [2019-12-27 21:44:16,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 21:44:16,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 21:44:16,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:16,163 INFO L225 Difference]: With dead ends: 83037 [2019-12-27 21:44:16,163 INFO L226 Difference]: Without dead ends: 60950 [2019-12-27 21:44:16,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:44:16,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60950 states. [2019-12-27 21:44:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60950 to 21754. [2019-12-27 21:44:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21754 states. [2019-12-27 21:44:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21754 states to 21754 states and 68550 transitions. [2019-12-27 21:44:17,050 INFO L78 Accepts]: Start accepts. Automaton has 21754 states and 68550 transitions. Word has length 64 [2019-12-27 21:44:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:17,050 INFO L462 AbstractCegarLoop]: Abstraction has 21754 states and 68550 transitions. [2019-12-27 21:44:17,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:44:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21754 states and 68550 transitions. [2019-12-27 21:44:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:44:17,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:17,075 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 21:44:17,076 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 21:44:17,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:17,076 INFO L82 PathProgramCache]: Analyzing trace with hash 207783117, now seen corresponding path program 2 times [2019-12-27 21:44:17,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:17,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058545000] [2019-12-27 21:44:17,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:17,171 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 21:44:17,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058545000] [2019-12-27 21:44:17,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:17,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:44:17,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2111473836] [2019-12-27 21:44:17,172 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:17,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:17,463 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 379 transitions. [2019-12-27 21:44:17,464 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:17,684 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 21:44:17,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:44:17,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:17,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:44:17,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:44:17,685 INFO L87 Difference]: Start difference. First operand 21754 states and 68550 transitions. Second operand 14 states. [2019-12-27 21:44:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:20,173 INFO L93 Difference]: Finished difference Result 73626 states and 229243 transitions. [2019-12-27 21:44:20,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:44:20,173 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2019-12-27 21:44:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:20,261 INFO L225 Difference]: With dead ends: 73626 [2019-12-27 21:44:20,262 INFO L226 Difference]: Without dead ends: 53816 [2019-12-27 21:44:20,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2019-12-27 21:44:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53816 states. [2019-12-27 21:44:20,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53816 to 25248. [2019-12-27 21:44:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25248 states. [2019-12-27 21:44:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25248 states to 25248 states and 79446 transitions. [2019-12-27 21:44:20,873 INFO L78 Accepts]: Start accepts. Automaton has 25248 states and 79446 transitions. Word has length 64 [2019-12-27 21:44:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:20,873 INFO L462 AbstractCegarLoop]: Abstraction has 25248 states and 79446 transitions. [2019-12-27 21:44:20,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:44:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 25248 states and 79446 transitions. [2019-12-27 21:44:20,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:44:20,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:20,900 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 21:44:20,900 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 21:44:20,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:20,901 INFO L82 PathProgramCache]: Analyzing trace with hash -771277719, now seen corresponding path program 3 times [2019-12-27 21:44:20,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:20,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236486555] [2019-12-27 21:44:20,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:21,016 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 21:44:21,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236486555] [2019-12-27 21:44:21,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:21,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:44:21,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1480691771] [2019-12-27 21:44:21,017 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:21,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:21,396 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 326 transitions. [2019-12-27 21:44:21,396 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:21,662 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 21:44:21,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:44:21,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:21,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:44:21,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:44:21,663 INFO L87 Difference]: Start difference. First operand 25248 states and 79446 transitions. Second operand 13 states. [2019-12-27 21:44:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:25,217 INFO L93 Difference]: Finished difference Result 131344 states and 399830 transitions. [2019-12-27 21:44:25,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 21:44:25,217 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 21:44:25,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:25,398 INFO L225 Difference]: With dead ends: 131344 [2019-12-27 21:44:25,398 INFO L226 Difference]: Without dead ends: 118680 [2019-12-27 21:44:25,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 12 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=631, Invalid=2339, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 21:44:25,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118680 states. [2019-12-27 21:44:26,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118680 to 25315. [2019-12-27 21:44:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25315 states. [2019-12-27 21:44:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25315 states to 25315 states and 79778 transitions. [2019-12-27 21:44:26,483 INFO L78 Accepts]: Start accepts. Automaton has 25315 states and 79778 transitions. Word has length 64 [2019-12-27 21:44:26,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:26,483 INFO L462 AbstractCegarLoop]: Abstraction has 25315 states and 79778 transitions. [2019-12-27 21:44:26,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:44:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 25315 states and 79778 transitions. [2019-12-27 21:44:26,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:44:26,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:26,684 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 21:44:26,684 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 21:44:26,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:26,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1182182323, now seen corresponding path program 4 times [2019-12-27 21:44:26,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:26,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439323925] [2019-12-27 21:44:26,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:26,772 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 21:44:26,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439323925] [2019-12-27 21:44:26,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:26,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:44:26,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1285773796] [2019-12-27 21:44:26,773 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:26,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:27,043 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 393 transitions. [2019-12-27 21:44:27,044 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:27,192 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 21:44:27,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:44:27,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:27,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:44:27,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:44:27,193 INFO L87 Difference]: Start difference. First operand 25315 states and 79778 transitions. Second operand 12 states. [2019-12-27 21:44:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:29,286 INFO L93 Difference]: Finished difference Result 73648 states and 227039 transitions. [2019-12-27 21:44:29,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:44:29,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 21:44:29,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:29,390 INFO L225 Difference]: With dead ends: 73648 [2019-12-27 21:44:29,390 INFO L226 Difference]: Without dead ends: 64679 [2019-12-27 21:44:29,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:44:29,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64679 states. [2019-12-27 21:44:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64679 to 25623. [2019-12-27 21:44:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25623 states. [2019-12-27 21:44:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25623 states to 25623 states and 80729 transitions. [2019-12-27 21:44:30,114 INFO L78 Accepts]: Start accepts. Automaton has 25623 states and 80729 transitions. Word has length 64 [2019-12-27 21:44:30,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:30,114 INFO L462 AbstractCegarLoop]: Abstraction has 25623 states and 80729 transitions. [2019-12-27 21:44:30,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:44:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 25623 states and 80729 transitions. [2019-12-27 21:44:30,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:44:30,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:30,143 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 21:44:30,144 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 21:44:30,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:30,144 INFO L82 PathProgramCache]: Analyzing trace with hash -503301939, now seen corresponding path program 5 times [2019-12-27 21:44:30,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:30,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401665722] [2019-12-27 21:44:30,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:30,207 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 21:44:30,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401665722] [2019-12-27 21:44:30,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:30,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:44:30,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [826990775] [2019-12-27 21:44:30,208 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:30,227 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:30,447 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 252 states and 431 transitions. [2019-12-27 21:44:30,447 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:30,450 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:44:30,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:44:30,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:30,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:44:30,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:44:30,451 INFO L87 Difference]: Start difference. First operand 25623 states and 80729 transitions. Second operand 3 states. [2019-12-27 21:44:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:30,749 INFO L93 Difference]: Finished difference Result 32590 states and 101569 transitions. [2019-12-27 21:44:30,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:44:30,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 21:44:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:30,794 INFO L225 Difference]: With dead ends: 32590 [2019-12-27 21:44:30,794 INFO L226 Difference]: Without dead ends: 32590 [2019-12-27 21:44:30,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 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 21:44:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32590 states. [2019-12-27 21:44:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32590 to 28272. [2019-12-27 21:44:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28272 states. [2019-12-27 21:44:31,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28272 states to 28272 states and 89027 transitions. [2019-12-27 21:44:31,242 INFO L78 Accepts]: Start accepts. Automaton has 28272 states and 89027 transitions. Word has length 64 [2019-12-27 21:44:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:31,242 INFO L462 AbstractCegarLoop]: Abstraction has 28272 states and 89027 transitions. [2019-12-27 21:44:31,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:44:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 28272 states and 89027 transitions. [2019-12-27 21:44:31,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:44:31,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:31,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:44:31,272 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 21:44:31,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:31,273 INFO L82 PathProgramCache]: Analyzing trace with hash -862043868, now seen corresponding path program 1 times [2019-12-27 21:44:31,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:31,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251272740] [2019-12-27 21:44:31,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:31,340 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 21:44:31,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251272740] [2019-12-27 21:44:31,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:31,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:44:31,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1311877639] [2019-12-27 21:44:31,341 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:31,360 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:31,591 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 401 transitions. [2019-12-27 21:44:31,591 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:31,699 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:44:31,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:44:31,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:31,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:44:31,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:44:31,700 INFO L87 Difference]: Start difference. First operand 28272 states and 89027 transitions. Second operand 9 states. [2019-12-27 21:44:32,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:32,559 INFO L93 Difference]: Finished difference Result 51379 states and 158784 transitions. [2019-12-27 21:44:32,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:44:32,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 21:44:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:32,638 INFO L225 Difference]: With dead ends: 51379 [2019-12-27 21:44:32,638 INFO L226 Difference]: Without dead ends: 51379 [2019-12-27 21:44:32,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:44:32,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51379 states. [2019-12-27 21:44:33,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51379 to 28613. [2019-12-27 21:44:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28613 states. [2019-12-27 21:44:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28613 states to 28613 states and 90265 transitions. [2019-12-27 21:44:33,249 INFO L78 Accepts]: Start accepts. Automaton has 28613 states and 90265 transitions. Word has length 65 [2019-12-27 21:44:33,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:33,249 INFO L462 AbstractCegarLoop]: Abstraction has 28613 states and 90265 transitions. [2019-12-27 21:44:33,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:44:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 28613 states and 90265 transitions. [2019-12-27 21:44:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:44:33,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:33,281 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 21:44:33,281 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 21:44:33,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:33,281 INFO L82 PathProgramCache]: Analyzing trace with hash 588580632, now seen corresponding path program 2 times [2019-12-27 21:44:33,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:33,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544893380] [2019-12-27 21:44:33,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:33,373 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 21:44:33,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544893380] [2019-12-27 21:44:33,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:33,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:44:33,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [950715195] [2019-12-27 21:44:33,375 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:33,396 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:33,877 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 351 transitions. [2019-12-27 21:44:33,877 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:34,087 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 21:44:34,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:44:34,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:34,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:44:34,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:44:34,089 INFO L87 Difference]: Start difference. First operand 28613 states and 90265 transitions. Second operand 12 states. [2019-12-27 21:44:40,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:40,177 INFO L93 Difference]: Finished difference Result 224131 states and 682749 transitions. [2019-12-27 21:44:40,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-27 21:44:40,177 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 21:44:40,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:40,447 INFO L225 Difference]: With dead ends: 224131 [2019-12-27 21:44:40,447 INFO L226 Difference]: Without dead ends: 162190 [2019-12-27 21:44:40,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1029, Invalid=3941, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 21:44:40,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162190 states. [2019-12-27 21:44:42,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162190 to 32715. [2019-12-27 21:44:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32715 states. [2019-12-27 21:44:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32715 states to 32715 states and 103744 transitions. [2019-12-27 21:44:42,519 INFO L78 Accepts]: Start accepts. Automaton has 32715 states and 103744 transitions. Word has length 65 [2019-12-27 21:44:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:42,520 INFO L462 AbstractCegarLoop]: Abstraction has 32715 states and 103744 transitions. [2019-12-27 21:44:42,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:44:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 32715 states and 103744 transitions. [2019-12-27 21:44:42,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:44:42,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:42,556 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 21:44:42,556 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 21:44:42,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:42,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1693200707, now seen corresponding path program 1 times [2019-12-27 21:44:42,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:42,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810832095] [2019-12-27 21:44:42,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:42,620 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 21:44:42,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810832095] [2019-12-27 21:44:42,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:42,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:44:42,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1967551888] [2019-12-27 21:44:42,621 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:42,637 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:42,962 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 248 states and 404 transitions. [2019-12-27 21:44:42,962 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:42,963 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:42,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:44:42,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:42,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:44:42,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:44:42,966 INFO L87 Difference]: Start difference. First operand 32715 states and 103744 transitions. Second operand 3 states. [2019-12-27 21:44:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:43,139 INFO L93 Difference]: Finished difference Result 32715 states and 103743 transitions. [2019-12-27 21:44:43,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:44:43,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:44:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:43,210 INFO L225 Difference]: With dead ends: 32715 [2019-12-27 21:44:43,210 INFO L226 Difference]: Without dead ends: 32715 [2019-12-27 21:44:43,211 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 21:44:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32715 states. [2019-12-27 21:44:43,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32715 to 29094. [2019-12-27 21:44:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29094 states. [2019-12-27 21:44:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29094 states to 29094 states and 93613 transitions. [2019-12-27 21:44:44,093 INFO L78 Accepts]: Start accepts. Automaton has 29094 states and 93613 transitions. Word has length 65 [2019-12-27 21:44:44,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:44,093 INFO L462 AbstractCegarLoop]: Abstraction has 29094 states and 93613 transitions. [2019-12-27 21:44:44,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:44:44,093 INFO L276 IsEmpty]: Start isEmpty. Operand 29094 states and 93613 transitions. [2019-12-27 21:44:44,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:44:44,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:44,159 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 21:44:44,159 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 21:44:44,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:44,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1932921264, now seen corresponding path program 1 times [2019-12-27 21:44:44,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:44,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128607893] [2019-12-27 21:44:44,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:44,312 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 21:44:44,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128607893] [2019-12-27 21:44:44,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:44,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:44:44,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [454740406] [2019-12-27 21:44:44,314 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:44,343 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:44,949 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 381 transitions. [2019-12-27 21:44:44,950 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:44,950 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:44,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:44:44,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:44,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:44:44,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:44:44,951 INFO L87 Difference]: Start difference. First operand 29094 states and 93613 transitions. Second operand 3 states. [2019-12-27 21:44:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:45,040 INFO L93 Difference]: Finished difference Result 26875 states and 84027 transitions. [2019-12-27 21:44:45,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:44:45,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 21:44:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:45,081 INFO L225 Difference]: With dead ends: 26875 [2019-12-27 21:44:45,081 INFO L226 Difference]: Without dead ends: 26875 [2019-12-27 21:44:45,081 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 21:44:45,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26875 states. [2019-12-27 21:44:45,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26875 to 25689. [2019-12-27 21:44:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25689 states. [2019-12-27 21:44:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25689 states to 25689 states and 80143 transitions. [2019-12-27 21:44:45,467 INFO L78 Accepts]: Start accepts. Automaton has 25689 states and 80143 transitions. Word has length 66 [2019-12-27 21:44:45,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:45,467 INFO L462 AbstractCegarLoop]: Abstraction has 25689 states and 80143 transitions. [2019-12-27 21:44:45,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:44:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 25689 states and 80143 transitions. [2019-12-27 21:44:45,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:44:45,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:45,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 21:44:45,494 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 21:44:45,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:45,494 INFO L82 PathProgramCache]: Analyzing trace with hash 51652252, now seen corresponding path program 1 times [2019-12-27 21:44:45,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:45,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46614299] [2019-12-27 21:44:45,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:45,854 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 21:44:45,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46614299] [2019-12-27 21:44:45,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:45,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 21:44:45,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1285245508] [2019-12-27 21:44:45,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:45,879 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:46,053 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 326 transitions. [2019-12-27 21:44:46,053 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:46,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:44:46,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:44:46,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:44:46,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:44:46,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:44:47,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:44:47,171 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 21:44:47,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 21:44:47,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:47,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 21:44:47,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:44:47,172 INFO L87 Difference]: Start difference. First operand 25689 states and 80143 transitions. Second operand 27 states. [2019-12-27 21:44:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:57,055 INFO L93 Difference]: Finished difference Result 43332 states and 134273 transitions. [2019-12-27 21:44:57,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 21:44:57,056 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 67 [2019-12-27 21:44:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:57,109 INFO L225 Difference]: With dead ends: 43332 [2019-12-27 21:44:57,109 INFO L226 Difference]: Without dead ends: 35087 [2019-12-27 21:44:57,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 7 SyntacticMatches, 11 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=632, Invalid=3528, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 21:44:57,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35087 states. [2019-12-27 21:44:57,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35087 to 26775. [2019-12-27 21:44:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26775 states. [2019-12-27 21:44:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26775 states to 26775 states and 83078 transitions. [2019-12-27 21:44:57,570 INFO L78 Accepts]: Start accepts. Automaton has 26775 states and 83078 transitions. Word has length 67 [2019-12-27 21:44:57,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:57,570 INFO L462 AbstractCegarLoop]: Abstraction has 26775 states and 83078 transitions. [2019-12-27 21:44:57,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 21:44:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 26775 states and 83078 transitions. [2019-12-27 21:44:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:44:57,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:57,601 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 21:44:57,601 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 21:44:57,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:57,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1795963314, now seen corresponding path program 2 times [2019-12-27 21:44:57,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:57,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806319114] [2019-12-27 21:44:57,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:57,777 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 21:44:57,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806319114] [2019-12-27 21:44:57,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:57,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:44:57,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [390674919] [2019-12-27 21:44:57,779 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:57,798 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:58,079 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 225 states and 389 transitions. [2019-12-27 21:44:58,079 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:58,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:44:58,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:44:58,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:44:58,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:44:58,909 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 21:44:58,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 21:44:58,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:58,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 21:44:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:44:58,910 INFO L87 Difference]: Start difference. First operand 26775 states and 83078 transitions. Second operand 23 states. [2019-12-27 21:45:03,284 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-12-27 21:45:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:07,233 INFO L93 Difference]: Finished difference Result 90869 states and 278708 transitions. [2019-12-27 21:45:07,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-12-27 21:45:07,234 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-12-27 21:45:07,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:07,348 INFO L225 Difference]: With dead ends: 90869 [2019-12-27 21:45:07,348 INFO L226 Difference]: Without dead ends: 71154 [2019-12-27 21:45:07,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2269 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1327, Invalid=6683, Unknown=0, NotChecked=0, Total=8010 [2019-12-27 21:45:07,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71154 states. [2019-12-27 21:45:08,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71154 to 25413. [2019-12-27 21:45:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25413 states. [2019-12-27 21:45:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25413 states to 25413 states and 78861 transitions. [2019-12-27 21:45:08,084 INFO L78 Accepts]: Start accepts. Automaton has 25413 states and 78861 transitions. Word has length 67 [2019-12-27 21:45:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:08,084 INFO L462 AbstractCegarLoop]: Abstraction has 25413 states and 78861 transitions. [2019-12-27 21:45:08,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 21:45:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 25413 states and 78861 transitions. [2019-12-27 21:45:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:45:08,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:08,114 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 21:45:08,114 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 21:45:08,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:08,115 INFO L82 PathProgramCache]: Analyzing trace with hash 629269490, now seen corresponding path program 3 times [2019-12-27 21:45:08,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:08,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159948917] [2019-12-27 21:45:08,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:08,485 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 21:45:08,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159948917] [2019-12-27 21:45:08,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:08,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 21:45:08,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [75524622] [2019-12-27 21:45:08,486 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:08,504 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:08,792 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 442 transitions. [2019-12-27 21:45:08,793 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:09,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:45:09,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:45:10,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:45:10,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:45:10,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:45:10,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:45:10,503 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 21:45:10,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 21:45:10,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:10,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 21:45:10,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2019-12-27 21:45:10,504 INFO L87 Difference]: Start difference. First operand 25413 states and 78861 transitions. Second operand 31 states. [2019-12-27 21:45:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:23,404 INFO L93 Difference]: Finished difference Result 49602 states and 151911 transitions. [2019-12-27 21:45:23,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 21:45:23,404 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 67 [2019-12-27 21:45:23,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:23,470 INFO L225 Difference]: With dead ends: 49602 [2019-12-27 21:45:23,470 INFO L226 Difference]: Without dead ends: 43165 [2019-12-27 21:45:23,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 10 SyntacticMatches, 14 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1437 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=794, Invalid=4608, Unknown=0, NotChecked=0, Total=5402 [2019-12-27 21:45:23,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43165 states. [2019-12-27 21:45:23,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43165 to 25643. [2019-12-27 21:45:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25643 states. [2019-12-27 21:45:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25643 states to 25643 states and 79555 transitions. [2019-12-27 21:45:23,995 INFO L78 Accepts]: Start accepts. Automaton has 25643 states and 79555 transitions. Word has length 67 [2019-12-27 21:45:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:23,995 INFO L462 AbstractCegarLoop]: Abstraction has 25643 states and 79555 transitions. [2019-12-27 21:45:23,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 21:45:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 25643 states and 79555 transitions. [2019-12-27 21:45:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:45:24,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:24,022 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 21:45:24,022 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 21:45:24,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:24,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1538714662, now seen corresponding path program 4 times [2019-12-27 21:45:24,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:24,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942089402] [2019-12-27 21:45:24,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:24,520 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 21:45:24,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942089402] [2019-12-27 21:45:24,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:24,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 21:45:24,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1979252864] [2019-12-27 21:45:24,521 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:24,536 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:24,963 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 226 states and 414 transitions. [2019-12-27 21:45:24,963 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:25,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:45:25,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:45:26,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:45:26,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:45:26,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:45:26,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:45:26,647 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 21:45:26,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 21:45:26,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:26,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 21:45:26,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2019-12-27 21:45:26,648 INFO L87 Difference]: Start difference. First operand 25643 states and 79555 transitions. Second operand 30 states. [2019-12-27 21:45:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:37,015 INFO L93 Difference]: Finished difference Result 42916 states and 131030 transitions. [2019-12-27 21:45:37,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 21:45:37,015 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 21:45:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:37,075 INFO L225 Difference]: With dead ends: 42916 [2019-12-27 21:45:37,075 INFO L226 Difference]: Without dead ends: 39665 [2019-12-27 21:45:37,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 10 SyntacticMatches, 16 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=534, Invalid=3248, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 21:45:37,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39665 states. [2019-12-27 21:45:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39665 to 25511. [2019-12-27 21:45:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25511 states. [2019-12-27 21:45:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25511 states to 25511 states and 79181 transitions. [2019-12-27 21:45:37,779 INFO L78 Accepts]: Start accepts. Automaton has 25511 states and 79181 transitions. Word has length 67 [2019-12-27 21:45:37,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:37,779 INFO L462 AbstractCegarLoop]: Abstraction has 25511 states and 79181 transitions. [2019-12-27 21:45:37,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 21:45:37,779 INFO L276 IsEmpty]: Start isEmpty. Operand 25511 states and 79181 transitions. [2019-12-27 21:45:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:45:37,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:37,809 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 21:45:37,809 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 21:45:37,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:37,810 INFO L82 PathProgramCache]: Analyzing trace with hash -915388302, now seen corresponding path program 5 times [2019-12-27 21:45:37,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:37,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148260690] [2019-12-27 21:45:37,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:37,911 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 21:45:37,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148260690] [2019-12-27 21:45:37,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:37,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:45:37,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [183523309] [2019-12-27 21:45:37,912 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:37,925 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:38,102 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 419 transitions. [2019-12-27 21:45:38,103 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:38,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:45:38,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:45:38,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:45:38,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 21:45:38,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:45:38,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:38,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:45:38,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:45:38,523 INFO L87 Difference]: Start difference. First operand 25511 states and 79181 transitions. Second operand 16 states. [2019-12-27 21:45:41,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:41,318 INFO L93 Difference]: Finished difference Result 44751 states and 137999 transitions. [2019-12-27 21:45:41,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:45:41,319 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 21:45:41,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:41,376 INFO L225 Difference]: With dead ends: 44751 [2019-12-27 21:45:41,376 INFO L226 Difference]: Without dead ends: 38945 [2019-12-27 21:45:41,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:45:41,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38945 states. [2019-12-27 21:45:41,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38945 to 25487. [2019-12-27 21:45:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25487 states. [2019-12-27 21:45:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25487 states to 25487 states and 79119 transitions. [2019-12-27 21:45:41,870 INFO L78 Accepts]: Start accepts. Automaton has 25487 states and 79119 transitions. Word has length 67 [2019-12-27 21:45:41,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:41,870 INFO L462 AbstractCegarLoop]: Abstraction has 25487 states and 79119 transitions. [2019-12-27 21:45:41,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:45:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 25487 states and 79119 transitions. [2019-12-27 21:45:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:45:41,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:41,897 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 21:45:41,897 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 21:45:41,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:41,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1668712667, now seen corresponding path program 1 times [2019-12-27 21:45:41,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:41,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404927521] [2019-12-27 21:45:41,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:41,951 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 21:45:41,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404927521] [2019-12-27 21:45:41,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:41,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:45:41,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [296202051] [2019-12-27 21:45:41,952 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:41,965 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:42,320 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 412 transitions. [2019-12-27 21:45:42,320 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:42,341 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:45:42,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:45:42,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:42,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:45:42,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:45:42,342 INFO L87 Difference]: Start difference. First operand 25487 states and 79119 transitions. Second operand 4 states. [2019-12-27 21:45:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:42,533 INFO L93 Difference]: Finished difference Result 25487 states and 78924 transitions. [2019-12-27 21:45:42,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:45:42,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 21:45:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:42,585 INFO L225 Difference]: With dead ends: 25487 [2019-12-27 21:45:42,586 INFO L226 Difference]: Without dead ends: 25487 [2019-12-27 21:45:42,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 7 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 21:45:42,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25487 states. [2019-12-27 21:45:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25487 to 22178. [2019-12-27 21:45:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22178 states. [2019-12-27 21:45:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22178 states to 22178 states and 68934 transitions. [2019-12-27 21:45:43,134 INFO L78 Accepts]: Start accepts. Automaton has 22178 states and 68934 transitions. Word has length 67 [2019-12-27 21:45:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:43,134 INFO L462 AbstractCegarLoop]: Abstraction has 22178 states and 68934 transitions. [2019-12-27 21:45:43,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:45:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 22178 states and 68934 transitions. [2019-12-27 21:45:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:45:43,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:43,156 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 21:45:43,156 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 21:45:43,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:43,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1370876380, now seen corresponding path program 6 times [2019-12-27 21:45:43,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:43,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734321986] [2019-12-27 21:45:43,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:45:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:45:43,279 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:45:43,279 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:45:43,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (= v_~z$w_buff0_used~0_115 0) (= v_~main$tmp_guard0~0_10 0) (= v_~z$r_buff0_thd3~0_76 0) (= v_~main$tmp_guard1~0_16 0) (= |v_ULTIMATE.start_main_~#t1501~0.offset_18| 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1501~0.base_24| 4)) (= v_~z$r_buff0_thd0~0_20 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~z~0_28 0) (= 0 v_~z$w_buff1~0_28) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed~0_6 0) (= 0 v_~z$r_buff1_thd3~0_51) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1501~0.base_24|) (= 0 v_~z$r_buff1_thd1~0_18) (= v_~y~0_16 0) (= v_~x~0_17 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1501~0.base_24|) 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd1~0_25 0) (= 0 v_~z$r_buff1_thd0~0_23) (= 0 v_~weak$$choice0~0_7) (= v_~z$mem_tmp~0_10 0) (= 0 |v_#NULL.base_7|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1501~0.base_24| 1) |v_#valid_60|) (= 0 v_~z$w_buff1_used~0_78) (= 0 v_~__unbuffered_p2_EAX~0_14) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1501~0.base_24| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1501~0.base_24|) |v_ULTIMATE.start_main_~#t1501~0.offset_18| 0)) |v_#memory_int_19|) (= 0 v_~weak$$choice2~0_31) (= 0 v_~z$w_buff0~0_29))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1501~0.base=|v_ULTIMATE.start_main_~#t1501~0.base_24|, ULTIMATE.start_main_~#t1501~0.offset=|v_ULTIMATE.start_main_~#t1501~0.offset_18|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_28, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~y~0=v_~y~0_16, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_29, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_51, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ULTIMATE.start_main_~#t1502~0.offset=|v_ULTIMATE.start_main_~#t1502~0.offset_18|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t1503~0.base=|v_ULTIMATE.start_main_~#t1503~0.base_17|, #NULL.base=|v_#NULL.base_7|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1503~0.offset=|v_ULTIMATE.start_main_~#t1503~0.offset_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_60|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, #memory_int=|v_#memory_int_19|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_76, ULTIMATE.start_main_~#t1502~0.base=|v_ULTIMATE.start_main_~#t1502~0.base_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1501~0.base, ULTIMATE.start_main_~#t1501~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, 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, ULTIMATE.start_main_~#t1502~0.offset, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1503~0.base, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1503~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t1502~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 21:45:43,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L818-1-->L820: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1502~0.base_13| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1502~0.base_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1502~0.base_13| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1502~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1502~0.base_13|) |v_ULTIMATE.start_main_~#t1502~0.offset_11| 1))) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1502~0.base_13| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1502~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1502~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1502~0.offset=|v_ULTIMATE.start_main_~#t1502~0.offset_11|, ULTIMATE.start_main_~#t1502~0.base=|v_ULTIMATE.start_main_~#t1502~0.base_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1502~0.offset, ULTIMATE.start_main_~#t1502~0.base, #length] because there is no mapped edge [2019-12-27 21:45:43,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L820-1-->L822: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1503~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1503~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1503~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1503~0.base_13|) |v_ULTIMATE.start_main_~#t1503~0.offset_11| 2)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t1503~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1503~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1503~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1503~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1503~0.offset=|v_ULTIMATE.start_main_~#t1503~0.offset_11|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1503~0.base=|v_ULTIMATE.start_main_~#t1503~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1503~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1503~0.base] because there is no mapped edge [2019-12-27 21:45:43,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_16 v_~z$w_buff1~0_17) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 1 v_~z$w_buff0~0_15) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_86 v_~z$w_buff1_used~0_59) (= (mod v_~z$w_buff1_used~0_59 256) 0) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_85 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_86, ~z$w_buff0~0=v_~z$w_buff0~0_16, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_85, ~z$w_buff0~0=v_~z$w_buff0~0_15, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_59, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_17, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 21:45:43,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L784-->L784-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1113579076 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite21_Out1113579076| ~z$w_buff0~0_In1113579076) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite20_In1113579076| |P2Thread1of1ForFork2_#t~ite20_Out1113579076|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1113579076 256) 0))) (or (= (mod ~z$w_buff0_used~0_In1113579076 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1113579076 256)) .cse1) (and (= (mod ~z$w_buff1_used~0_In1113579076 256) 0) .cse1))) .cse0 (= |P2Thread1of1ForFork2_#t~ite21_Out1113579076| |P2Thread1of1ForFork2_#t~ite20_Out1113579076|) (= |P2Thread1of1ForFork2_#t~ite20_Out1113579076| ~z$w_buff0~0_In1113579076)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1113579076, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1113579076, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In1113579076|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1113579076, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1113579076, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1113579076, ~weak$$choice2~0=~weak$$choice2~0_In1113579076} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1113579076, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1113579076|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1113579076, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out1113579076|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1113579076, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1113579076, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1113579076, ~weak$$choice2~0=~weak$$choice2~0_In1113579076} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 21:45:43,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L762-2-->L762-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-1683838918| |P1Thread1of1ForFork1_#t~ite10_Out-1683838918|)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1683838918 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1683838918 256)))) (or (and .cse0 (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1683838918| ~z$w_buff1~0_In-1683838918) (not .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1683838918| ~z~0_In-1683838918) .cse0 (or .cse1 .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1683838918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1683838918, ~z$w_buff1~0=~z$w_buff1~0_In-1683838918, ~z~0=~z~0_In-1683838918} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1683838918|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1683838918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1683838918, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1683838918|, ~z$w_buff1~0=~z$w_buff1~0_In-1683838918, ~z~0=~z~0_In-1683838918} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 21:45:43,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-388883221 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-388883221 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-388883221| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-388883221| ~z$w_buff0_used~0_In-388883221) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-388883221, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-388883221} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-388883221|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-388883221, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-388883221} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:45:43,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1003939402 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1003939402 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1003939402 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1003939402 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1003939402|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-1003939402 |P0Thread1of1ForFork0_#t~ite6_Out-1003939402|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1003939402, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1003939402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1003939402, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1003939402} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1003939402|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1003939402, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1003939402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1003939402, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1003939402} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:45:43,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1309439469 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1309439469 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out1309439469 ~z$r_buff0_thd1~0_In1309439469)) (and (= ~z$r_buff0_thd1~0_Out1309439469 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1309439469, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1309439469} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1309439469, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1309439469|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1309439469} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:45:43,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In636015724 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In636015724 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out636015724|)) (and (= ~z$w_buff0_used~0_In636015724 |P1Thread1of1ForFork1_#t~ite11_Out636015724|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In636015724, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In636015724} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In636015724, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out636015724|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In636015724} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:45:43,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1312860845 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1312860845 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1312860845 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1312860845 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1312860845|)) (and (= ~z$w_buff1_used~0_In1312860845 |P1Thread1of1ForFork1_#t~ite12_Out1312860845|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1312860845, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1312860845, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1312860845, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1312860845} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1312860845, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1312860845, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1312860845, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1312860845|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1312860845} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:45:43,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In202374051 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In202374051 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In202374051 |P1Thread1of1ForFork1_#t~ite13_Out202374051|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out202374051|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In202374051, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In202374051} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In202374051, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out202374051|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In202374051} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 21:45:43,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In139134697 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In139134697 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In139134697 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In139134697 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out139134697|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In139134697 |P1Thread1of1ForFork1_#t~ite14_Out139134697|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In139134697, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In139134697, ~z$w_buff1_used~0=~z$w_buff1_used~0_In139134697, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In139134697} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In139134697, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In139134697, ~z$w_buff1_used~0=~z$w_buff1_used~0_In139134697, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out139134697|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In139134697} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:45:43,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, 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_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, 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 21:45:43,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L788-->L789: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd3~0_64 v_~z$r_buff0_thd3~0_63)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_24} 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_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} 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 21:45:43,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1115114611 256)))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite36_Out1115114611| |P2Thread1of1ForFork2_#t~ite35_Out1115114611|) (= |P2Thread1of1ForFork2_#t~ite35_Out1115114611| ~z$r_buff1_thd3~0_In1115114611) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1115114611 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In1115114611 256)) .cse1) (= (mod ~z$w_buff0_used~0_In1115114611 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In1115114611 256)) .cse1)))) (and (= |P2Thread1of1ForFork2_#t~ite36_Out1115114611| ~z$r_buff1_thd3~0_In1115114611) (= |P2Thread1of1ForFork2_#t~ite35_In1115114611| |P2Thread1of1ForFork2_#t~ite35_Out1115114611|) (not .cse0)))) InVars {P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_In1115114611|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1115114611, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1115114611, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1115114611, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1115114611, ~weak$$choice2~0=~weak$$choice2~0_In1115114611} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out1115114611|, P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out1115114611|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1115114611, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1115114611, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1115114611, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1115114611, ~weak$$choice2~0=~weak$$choice2~0_In1115114611} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35, P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 21:45:43,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L791-->L795: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:45:43,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-2-->L795-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out1527721626| |P2Thread1of1ForFork2_#t~ite39_Out1527721626|)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1527721626 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1527721626 256)))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out1527721626| ~z$w_buff1~0_In1527721626) (not .cse1) (not .cse2)) (and (= |P2Thread1of1ForFork2_#t~ite38_Out1527721626| ~z~0_In1527721626) .cse0 (or .cse1 .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1527721626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1527721626, ~z$w_buff1~0=~z$w_buff1~0_In1527721626, ~z~0=~z~0_In1527721626} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1527721626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1527721626, ~z$w_buff1~0=~z$w_buff1~0_In1527721626, ~z~0=~z~0_In1527721626, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out1527721626|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out1527721626|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 21:45:43,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1397541558 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1397541558 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out1397541558|) (not .cse1)) (and (= ~z$w_buff0_used~0_In1397541558 |P2Thread1of1ForFork2_#t~ite40_Out1397541558|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1397541558, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1397541558} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1397541558, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1397541558, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1397541558|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 21:45:43,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In1000805938 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1000805938 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1000805938 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1000805938 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out1000805938| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite41_Out1000805938| ~z$w_buff1_used~0_In1000805938)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1000805938, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1000805938, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1000805938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1000805938} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1000805938|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1000805938, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1000805938, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1000805938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1000805938} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 21:45:43,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2078452840 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2078452840 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-2078452840| ~z$r_buff0_thd3~0_In-2078452840) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-2078452840|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2078452840, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2078452840} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-2078452840|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2078452840, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2078452840} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 21:45:43,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-822763370 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-822763370 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-822763370 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-822763370 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out-822763370| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd3~0_In-822763370 |P2Thread1of1ForFork2_#t~ite43_Out-822763370|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-822763370, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-822763370, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-822763370, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-822763370} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-822763370, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-822763370, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-822763370|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-822763370, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-822763370} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 21:45:43,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_44) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, 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 21:45:43,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L746-->L746-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1959099054 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1959099054 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1959099054 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1959099054 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In-1959099054 |P0Thread1of1ForFork0_#t~ite8_Out-1959099054|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1959099054|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1959099054, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1959099054, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1959099054, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1959099054} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1959099054, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1959099054|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1959099054, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1959099054, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1959099054} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:45:43,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} 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_14, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} 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 21:45:43,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L822-1-->L828: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:45:43,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L828-2-->L828-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite47_Out-338530453| |ULTIMATE.start_main_#t~ite48_Out-338530453|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-338530453 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-338530453 256)))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite47_Out-338530453| ~z$w_buff1~0_In-338530453) (not .cse2)) (and .cse1 (or .cse2 .cse0) (= ~z~0_In-338530453 |ULTIMATE.start_main_#t~ite47_Out-338530453|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-338530453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-338530453, ~z$w_buff1~0=~z$w_buff1~0_In-338530453, ~z~0=~z~0_In-338530453} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-338530453, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-338530453|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-338530453, ~z$w_buff1~0=~z$w_buff1~0_In-338530453, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-338530453|, ~z~0=~z~0_In-338530453} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 21:45:43,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-773756185 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-773756185 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-773756185| ~z$w_buff0_used~0_In-773756185)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-773756185| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-773756185, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-773756185} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-773756185, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-773756185, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-773756185|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 21:45:43,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-657313025 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-657313025 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-657313025 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-657313025 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-657313025| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out-657313025| ~z$w_buff1_used~0_In-657313025) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-657313025, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-657313025, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-657313025, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-657313025} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-657313025|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-657313025, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-657313025, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-657313025, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-657313025} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 21:45:43,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-686834723 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-686834723 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-686834723|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-686834723 |ULTIMATE.start_main_#t~ite51_Out-686834723|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-686834723, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-686834723} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-686834723, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-686834723|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-686834723} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 21:45:43,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In511583358 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In511583358 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In511583358 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In511583358 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In511583358 |ULTIMATE.start_main_#t~ite52_Out511583358|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out511583358| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In511583358, ~z$w_buff0_used~0=~z$w_buff0_used~0_In511583358, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In511583358, ~z$w_buff1_used~0=~z$w_buff1_used~0_In511583358} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out511583358|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In511583358, ~z$w_buff0_used~0=~z$w_buff0_used~0_In511583358, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In511583358, ~z$w_buff1_used~0=~z$w_buff1_used~0_In511583358} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 21:45:43,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_10 0) (= v_~y~0_10 2) (= v_~__unbuffered_p2_EAX~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~x~0_11 2) (= |v_ULTIMATE.start_main_#t~ite52_13| v_~z$r_buff1_thd0~0_16)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_10, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_10, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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 21:45:43,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:45:43 BasicIcfg [2019-12-27 21:45:43,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:45:43,420 INFO L168 Benchmark]: Toolchain (without parser) took 165631.93 ms. Allocated memory was 145.2 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 100.3 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 21:45:43,420 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 21:45:43,421 INFO L168 Benchmark]: CACSL2BoogieTranslator took 815.35 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 155.5 MB in the end (delta: -55.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:43,421 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.35 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:43,422 INFO L168 Benchmark]: Boogie Preprocessor took 40.85 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:43,427 INFO L168 Benchmark]: RCFGBuilder took 891.67 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 100.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:43,427 INFO L168 Benchmark]: TraceAbstraction took 163812.40 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.9 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 21:45:43,429 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 815.35 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 155.5 MB in the end (delta: -55.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.35 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.85 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 891.67 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 100.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 163812.40 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.9 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 174 ProgramPointsBefore, 95 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 30 ChoiceCompositions, 6362 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81192 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1501, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L820] FCALL, FORK 0 pthread_create(&t1502, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_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] [L822] FCALL, FORK 0 pthread_create(&t1503, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=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] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=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] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_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] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=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=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] [L776] 3 y = 2 [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 z$flush_delayed = weak$$choice2 [L782] 3 z$mem_tmp = z VAL [__unbuffered_cnt=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=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_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] [L783] 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_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=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_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] [L783] 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) [L784] 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)) [L785] EXPR 3 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)) VAL [__unbuffered_cnt=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=7, weak$$choice2=1, 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))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_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] 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)) [L786] EXPR 3 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)) VAL [__unbuffered_cnt=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=7, weak$$choice2=1, 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))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_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] [L786] 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)) [L762] 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_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=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_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] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 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) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 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 [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L787] EXPR 3 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __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=7, weak$$choice2=1, 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))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_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] [L787] 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)) [L789] 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)) [L790] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __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=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_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] [L795] 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_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=7, weak$$choice2=1, x=2, y=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 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) [L796] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 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 [L798] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L828] 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_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=7, weak$$choice2=1, x=2, y=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 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) [L829] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 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 [L831] 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, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 163.4s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 83.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8306 SDtfs, 17181 SDslu, 34612 SDs, 0 SdLazy, 35233 SolverSat, 894 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 910 GetRequests, 194 SyntacticMatches, 114 SemanticMatches, 602 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8708 ImplicationChecksByTransitivity, 19.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154366occurred 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: 40.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 568435 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1435 NumberOfCodeBlocks, 1435 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1337 ConstructedInterpolants, 0 QuantifiedInterpolants, 247015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...