/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/mix011_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:00:54,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:00:54,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:00:54,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:00:54,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:00:54,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:00:54,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:00:54,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:00:54,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:00:54,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:00:54,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:00:54,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:00:54,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:00:54,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:00:54,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:00:54,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:00:54,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:00:54,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:00:54,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:00:54,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:00:54,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:00:54,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:00:54,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:00:54,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:00:54,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:00:54,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:00:54,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:00:54,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:00:54,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:00:54,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:00:54,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:00:54,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:00:54,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:00:54,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:00:54,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:00:54,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:00:54,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:00:54,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:00:54,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:00:54,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:00:54,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:00:54,561 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 20:00:54,580 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:00:54,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:00:54,581 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:00:54,581 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:00:54,582 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:00:54,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:00:54,582 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:00:54,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:00:54,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:00:54,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:00:54,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:00:54,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:00:54,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:00:54,585 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:00:54,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:00:54,585 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:00:54,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:00:54,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:00:54,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:00:54,586 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:00:54,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:00:54,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:00:54,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:00:54,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:00:54,587 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:00:54,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:00:54,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:00:54,588 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:00:54,588 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:00:54,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:00:54,589 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:00:54,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:00:54,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:00:54,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:00:54,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:00:54,900 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:00:54,900 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:00:54,901 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_pso.oepc.i [2019-12-27 20:00:54,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1589fe4b7/9bb6d5f52fbf491db0f7e2c01c925fe1/FLAG45ad12231 [2019-12-27 20:00:55,541 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:00:55,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_pso.oepc.i [2019-12-27 20:00:55,558 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1589fe4b7/9bb6d5f52fbf491db0f7e2c01c925fe1/FLAG45ad12231 [2019-12-27 20:00:55,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1589fe4b7/9bb6d5f52fbf491db0f7e2c01c925fe1 [2019-12-27 20:00:55,789 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:00:55,791 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:00:55,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:00:55,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:00:55,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:00:55,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:00:55" (1/1) ... [2019-12-27 20:00:55,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e7ccef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:55, skipping insertion in model container [2019-12-27 20:00:55,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:00:55" (1/1) ... [2019-12-27 20:00:55,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:00:55,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:00:56,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:00:56,482 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:00:56,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:00:56,655 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:00:56,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:56 WrapperNode [2019-12-27 20:00:56,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:00:56,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:00:56,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:00:56,658 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:00:56,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:56" (1/1) ... [2019-12-27 20:00:56,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:56" (1/1) ... [2019-12-27 20:00:56,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:00:56,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:00:56,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:00:56,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:00:56,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:56" (1/1) ... [2019-12-27 20:00:56,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:56" (1/1) ... [2019-12-27 20:00:56,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:56" (1/1) ... [2019-12-27 20:00:56,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:56" (1/1) ... [2019-12-27 20:00:56,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:56" (1/1) ... [2019-12-27 20:00:56,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:56" (1/1) ... [2019-12-27 20:00:56,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:56" (1/1) ... [2019-12-27 20:00:56,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:00:56,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:00:56,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:00:56,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:00:56,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:56" (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 20:00:56,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:00:56,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:00:56,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:00:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:00:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:00:56,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:00:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:00:56,841 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:00:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:00:56,841 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:00:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:00:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:00:56,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:00:56,845 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 20:00:57,557 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:00:57,557 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:00:57,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:00:57 BoogieIcfgContainer [2019-12-27 20:00:57,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:00:57,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:00:57,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:00:57,564 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:00:57,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:00:55" (1/3) ... [2019-12-27 20:00:57,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c72e987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:00:57, skipping insertion in model container [2019-12-27 20:00:57,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:56" (2/3) ... [2019-12-27 20:00:57,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c72e987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:00:57, skipping insertion in model container [2019-12-27 20:00:57,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:00:57" (3/3) ... [2019-12-27 20:00:57,567 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_pso.oepc.i [2019-12-27 20:00:57,578 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:00:57,578 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:00:57,588 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:00:57,589 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:00:57,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,649 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,649 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,649 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,650 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,650 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,663 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,664 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,689 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,689 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,716 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,719 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,726 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,726 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,727 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,729 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,729 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:57,748 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:00:57,768 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:00:57,768 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:00:57,768 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:00:57,769 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:00:57,769 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:00:57,769 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:00:57,769 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:00:57,769 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:00:57,786 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 20:00:57,788 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 20:00:57,894 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 20:00:57,895 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:00:57,915 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:00:57,945 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 20:00:58,000 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 20:00:58,001 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:00:58,009 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:00:58,031 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 20:00:58,032 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:01:01,376 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:01:01,497 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:01:01,794 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 20:01:01,937 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 20:01:01,968 INFO L206 etLargeBlockEncoding]: Checked pairs total: 94688 [2019-12-27 20:01:01,968 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 20:01:01,972 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 106 transitions [2019-12-27 20:01:26,446 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 134882 states. [2019-12-27 20:01:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 134882 states. [2019-12-27 20:01:26,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:01:26,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:26,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:01:26,456 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 20:01:26,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:26,462 INFO L82 PathProgramCache]: Analyzing trace with hash 915989, now seen corresponding path program 1 times [2019-12-27 20:01:26,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:26,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141422028] [2019-12-27 20:01:26,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:26,672 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 20:01:26,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141422028] [2019-12-27 20:01:26,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:26,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:01:26,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1323628425] [2019-12-27 20:01:26,676 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:26,680 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:26,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:01:26,692 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:26,696 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:26,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:01:26,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:26,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:01:26,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:26,713 INFO L87 Difference]: Start difference. First operand 134882 states. Second operand 3 states. [2019-12-27 20:01:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:30,762 INFO L93 Difference]: Finished difference Result 125324 states and 534602 transitions. [2019-12-27 20:01:30,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:01:30,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:01:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:31,725 INFO L225 Difference]: With dead ends: 125324 [2019-12-27 20:01:31,725 INFO L226 Difference]: Without dead ends: 118044 [2019-12-27 20:01:31,726 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 20:01:37,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118044 states. [2019-12-27 20:01:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118044 to 118044. [2019-12-27 20:01:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118044 states. [2019-12-27 20:01:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118044 states to 118044 states and 502920 transitions. [2019-12-27 20:01:40,962 INFO L78 Accepts]: Start accepts. Automaton has 118044 states and 502920 transitions. Word has length 3 [2019-12-27 20:01:40,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:40,963 INFO L462 AbstractCegarLoop]: Abstraction has 118044 states and 502920 transitions. [2019-12-27 20:01:40,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:01:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand 118044 states and 502920 transitions. [2019-12-27 20:01:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:01:40,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:40,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:01:40,967 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 20:01:40,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:40,967 INFO L82 PathProgramCache]: Analyzing trace with hash -31291973, now seen corresponding path program 1 times [2019-12-27 20:01:40,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:40,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510997215] [2019-12-27 20:01:40,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:41,094 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 20:01:41,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510997215] [2019-12-27 20:01:41,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:41,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:01:41,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [773587232] [2019-12-27 20:01:41,096 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:41,097 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:41,101 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:01:41,101 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:41,102 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:41,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:01:41,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:41,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:01:41,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:01:41,104 INFO L87 Difference]: Start difference. First operand 118044 states and 502920 transitions. Second operand 4 states. [2019-12-27 20:01:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:46,862 INFO L93 Difference]: Finished difference Result 183348 states and 749807 transitions. [2019-12-27 20:01:46,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:01:46,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:01:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:47,484 INFO L225 Difference]: With dead ends: 183348 [2019-12-27 20:01:47,485 INFO L226 Difference]: Without dead ends: 183299 [2019-12-27 20:01:47,486 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 20:01:58,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183299 states. [2019-12-27 20:02:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183299 to 167419. [2019-12-27 20:02:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167419 states. [2019-12-27 20:02:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167419 states to 167419 states and 693327 transitions. [2019-12-27 20:02:02,848 INFO L78 Accepts]: Start accepts. Automaton has 167419 states and 693327 transitions. Word has length 11 [2019-12-27 20:02:02,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:02,848 INFO L462 AbstractCegarLoop]: Abstraction has 167419 states and 693327 transitions. [2019-12-27 20:02:02,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:02:02,848 INFO L276 IsEmpty]: Start isEmpty. Operand 167419 states and 693327 transitions. [2019-12-27 20:02:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:02:02,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:02,856 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:02,856 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 20:02:02,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:02,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2078499822, now seen corresponding path program 1 times [2019-12-27 20:02:02,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:02,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172467656] [2019-12-27 20:02:02,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:02,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172467656] [2019-12-27 20:02:02,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:02,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:02:02,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1442264128] [2019-12-27 20:02:02,924 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:02,926 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:02,929 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:02:02,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:02,929 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:02,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:02:02,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:02,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:02:02,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:02,930 INFO L87 Difference]: Start difference. First operand 167419 states and 693327 transitions. Second operand 3 states. [2019-12-27 20:02:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:03,101 INFO L93 Difference]: Finished difference Result 35457 states and 115033 transitions. [2019-12-27 20:02:03,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:02:03,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:02:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:03,175 INFO L225 Difference]: With dead ends: 35457 [2019-12-27 20:02:03,175 INFO L226 Difference]: Without dead ends: 35457 [2019-12-27 20:02:03,176 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 20:02:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35457 states. [2019-12-27 20:02:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35457 to 35457. [2019-12-27 20:02:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35457 states. [2019-12-27 20:02:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35457 states to 35457 states and 115033 transitions. [2019-12-27 20:02:03,860 INFO L78 Accepts]: Start accepts. Automaton has 35457 states and 115033 transitions. Word has length 13 [2019-12-27 20:02:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:03,861 INFO L462 AbstractCegarLoop]: Abstraction has 35457 states and 115033 transitions. [2019-12-27 20:02:03,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:02:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 35457 states and 115033 transitions. [2019-12-27 20:02:03,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:02:03,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:03,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:03,864 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 20:02:03,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:03,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1087155049, now seen corresponding path program 1 times [2019-12-27 20:02:03,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:03,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64089730] [2019-12-27 20:02:03,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:03,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64089730] [2019-12-27 20:02:03,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:03,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:02:03,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [870718709] [2019-12-27 20:02:03,972 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:03,974 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:03,976 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:02:03,977 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:03,977 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:03,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:02:03,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:03,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:02:03,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:02:03,978 INFO L87 Difference]: Start difference. First operand 35457 states and 115033 transitions. Second operand 5 states. [2019-12-27 20:02:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:04,527 INFO L93 Difference]: Finished difference Result 48336 states and 154905 transitions. [2019-12-27 20:02:04,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:02:04,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 20:02:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:04,637 INFO L225 Difference]: With dead ends: 48336 [2019-12-27 20:02:04,637 INFO L226 Difference]: Without dead ends: 48336 [2019-12-27 20:02:04,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:02:04,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-27 20:02:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 40811. [2019-12-27 20:02:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40811 states. [2019-12-27 20:02:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40811 states to 40811 states and 131928 transitions. [2019-12-27 20:02:08,041 INFO L78 Accepts]: Start accepts. Automaton has 40811 states and 131928 transitions. Word has length 16 [2019-12-27 20:02:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:08,042 INFO L462 AbstractCegarLoop]: Abstraction has 40811 states and 131928 transitions. [2019-12-27 20:02:08,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:02:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 40811 states and 131928 transitions. [2019-12-27 20:02:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:02:08,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:08,052 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 20:02:08,053 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 20:02:08,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:08,053 INFO L82 PathProgramCache]: Analyzing trace with hash 331077478, now seen corresponding path program 1 times [2019-12-27 20:02:08,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:08,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100645290] [2019-12-27 20:02:08,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:08,149 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 20:02:08,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100645290] [2019-12-27 20:02:08,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:08,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:02:08,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1424663702] [2019-12-27 20:02:08,150 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:08,153 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:08,160 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 20:02:08,160 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:08,162 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:08,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:02:08,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:08,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:02:08,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:02:08,163 INFO L87 Difference]: Start difference. First operand 40811 states and 131928 transitions. Second operand 6 states. [2019-12-27 20:02:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:09,085 INFO L93 Difference]: Finished difference Result 60696 states and 191428 transitions. [2019-12-27 20:02:09,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:02:09,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 20:02:09,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:09,177 INFO L225 Difference]: With dead ends: 60696 [2019-12-27 20:02:09,177 INFO L226 Difference]: Without dead ends: 60689 [2019-12-27 20:02:09,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:02:09,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60689 states. [2019-12-27 20:02:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60689 to 41267. [2019-12-27 20:02:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41267 states. [2019-12-27 20:02:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41267 states to 41267 states and 132739 transitions. [2019-12-27 20:02:10,353 INFO L78 Accepts]: Start accepts. Automaton has 41267 states and 132739 transitions. Word has length 22 [2019-12-27 20:02:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:10,353 INFO L462 AbstractCegarLoop]: Abstraction has 41267 states and 132739 transitions. [2019-12-27 20:02:10,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:02:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 41267 states and 132739 transitions. [2019-12-27 20:02:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:02:10,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:10,367 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 20:02:10,367 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 20:02:10,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:10,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1815979917, now seen corresponding path program 1 times [2019-12-27 20:02:10,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:10,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265213240] [2019-12-27 20:02:10,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:10,433 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 20:02:10,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265213240] [2019-12-27 20:02:10,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:10,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:02:10,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [693011361] [2019-12-27 20:02:10,434 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:10,437 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:10,447 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 20:02:10,448 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:10,489 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:02:10,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:02:10,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:10,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:02:10,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:02:10,490 INFO L87 Difference]: Start difference. First operand 41267 states and 132739 transitions. Second operand 5 states. [2019-12-27 20:02:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:10,581 INFO L93 Difference]: Finished difference Result 16400 states and 49837 transitions. [2019-12-27 20:02:10,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:02:10,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:02:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:10,611 INFO L225 Difference]: With dead ends: 16400 [2019-12-27 20:02:10,611 INFO L226 Difference]: Without dead ends: 16400 [2019-12-27 20:02:10,611 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 20:02:10,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16400 states. [2019-12-27 20:02:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16400 to 16107. [2019-12-27 20:02:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16107 states. [2019-12-27 20:02:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16107 states to 16107 states and 49001 transitions. [2019-12-27 20:02:10,851 INFO L78 Accepts]: Start accepts. Automaton has 16107 states and 49001 transitions. Word has length 25 [2019-12-27 20:02:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:10,851 INFO L462 AbstractCegarLoop]: Abstraction has 16107 states and 49001 transitions. [2019-12-27 20:02:10,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:02:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 16107 states and 49001 transitions. [2019-12-27 20:02:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:02:10,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:10,862 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 20:02:10,862 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 20:02:10,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:10,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1743661769, now seen corresponding path program 1 times [2019-12-27 20:02:10,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:10,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709907840] [2019-12-27 20:02:10,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:10,960 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 20:02:10,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709907840] [2019-12-27 20:02:10,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:10,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:02:10,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [962349564] [2019-12-27 20:02:10,961 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:10,965 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:10,971 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:02:10,972 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:10,972 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:10,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:02:10,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:10,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:02:10,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:02:10,973 INFO L87 Difference]: Start difference. First operand 16107 states and 49001 transitions. Second operand 6 states. [2019-12-27 20:02:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:11,456 INFO L93 Difference]: Finished difference Result 23083 states and 68424 transitions. [2019-12-27 20:02:11,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:02:11,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 20:02:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:11,487 INFO L225 Difference]: With dead ends: 23083 [2019-12-27 20:02:11,487 INFO L226 Difference]: Without dead ends: 23083 [2019-12-27 20:02:11,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:02:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23083 states. [2019-12-27 20:02:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23083 to 18424. [2019-12-27 20:02:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18424 states. [2019-12-27 20:02:11,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18424 states to 18424 states and 55823 transitions. [2019-12-27 20:02:11,788 INFO L78 Accepts]: Start accepts. Automaton has 18424 states and 55823 transitions. Word has length 27 [2019-12-27 20:02:11,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:11,788 INFO L462 AbstractCegarLoop]: Abstraction has 18424 states and 55823 transitions. [2019-12-27 20:02:11,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:02:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 18424 states and 55823 transitions. [2019-12-27 20:02:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:02:11,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:11,806 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 20:02:11,807 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 20:02:11,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:11,807 INFO L82 PathProgramCache]: Analyzing trace with hash 805811820, now seen corresponding path program 1 times [2019-12-27 20:02:11,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:11,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350980953] [2019-12-27 20:02:11,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:11,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 20:02:11,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350980953] [2019-12-27 20:02:11,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:11,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:02:11,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [668492874] [2019-12-27 20:02:11,912 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:11,918 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:11,932 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 49 transitions. [2019-12-27 20:02:11,933 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:11,933 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:11,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:02:11,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:11,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:02:11,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:02:11,934 INFO L87 Difference]: Start difference. First operand 18424 states and 55823 transitions. Second operand 7 states. [2019-12-27 20:02:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:12,984 INFO L93 Difference]: Finished difference Result 25102 states and 74108 transitions. [2019-12-27 20:02:12,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:02:12,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 20:02:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:13,020 INFO L225 Difference]: With dead ends: 25102 [2019-12-27 20:02:13,020 INFO L226 Difference]: Without dead ends: 25102 [2019-12-27 20:02:13,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:02:13,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25102 states. [2019-12-27 20:02:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25102 to 17010. [2019-12-27 20:02:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17010 states. [2019-12-27 20:02:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17010 states to 17010 states and 51608 transitions. [2019-12-27 20:02:13,598 INFO L78 Accepts]: Start accepts. Automaton has 17010 states and 51608 transitions. Word has length 33 [2019-12-27 20:02:13,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:13,599 INFO L462 AbstractCegarLoop]: Abstraction has 17010 states and 51608 transitions. [2019-12-27 20:02:13,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:02:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 17010 states and 51608 transitions. [2019-12-27 20:02:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:02:13,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:13,622 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 20:02:13,622 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 20:02:13,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:13,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1882924927, now seen corresponding path program 1 times [2019-12-27 20:02:13,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:13,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923438392] [2019-12-27 20:02:13,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:13,696 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 20:02:13,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923438392] [2019-12-27 20:02:13,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:13,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:02:13,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1104483448] [2019-12-27 20:02:13,697 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:13,709 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:13,781 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 375 transitions. [2019-12-27 20:02:13,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:13,783 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:13,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:02:13,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:13,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:02:13,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:13,785 INFO L87 Difference]: Start difference. First operand 17010 states and 51608 transitions. Second operand 3 states. [2019-12-27 20:02:13,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:13,994 INFO L93 Difference]: Finished difference Result 28822 states and 87795 transitions. [2019-12-27 20:02:13,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:02:13,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:02:13,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:14,026 INFO L225 Difference]: With dead ends: 28822 [2019-12-27 20:02:14,026 INFO L226 Difference]: Without dead ends: 14466 [2019-12-27 20:02:14,026 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 20:02:14,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14466 states. [2019-12-27 20:02:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14466 to 14406. [2019-12-27 20:02:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14406 states. [2019-12-27 20:02:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14406 states to 14406 states and 43046 transitions. [2019-12-27 20:02:14,335 INFO L78 Accepts]: Start accepts. Automaton has 14406 states and 43046 transitions. Word has length 39 [2019-12-27 20:02:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:14,335 INFO L462 AbstractCegarLoop]: Abstraction has 14406 states and 43046 transitions. [2019-12-27 20:02:14,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:02:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 14406 states and 43046 transitions. [2019-12-27 20:02:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:02:14,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:14,352 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 20:02:14,353 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 20:02:14,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:14,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1781220711, now seen corresponding path program 2 times [2019-12-27 20:02:14,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:14,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625424237] [2019-12-27 20:02:14,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:14,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625424237] [2019-12-27 20:02:14,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:14,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:02:14,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1159850959] [2019-12-27 20:02:14,432 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:14,439 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:14,515 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 378 transitions. [2019-12-27 20:02:14,515 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:14,516 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:14,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:02:14,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:14,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:02:14,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:14,517 INFO L87 Difference]: Start difference. First operand 14406 states and 43046 transitions. Second operand 3 states. [2019-12-27 20:02:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:14,585 INFO L93 Difference]: Finished difference Result 14405 states and 43044 transitions. [2019-12-27 20:02:14,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:02:14,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:02:14,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:14,616 INFO L225 Difference]: With dead ends: 14405 [2019-12-27 20:02:14,616 INFO L226 Difference]: Without dead ends: 14405 [2019-12-27 20:02:14,617 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 20:02:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14405 states. [2019-12-27 20:02:14,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14405 to 14405. [2019-12-27 20:02:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14405 states. [2019-12-27 20:02:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14405 states to 14405 states and 43044 transitions. [2019-12-27 20:02:15,045 INFO L78 Accepts]: Start accepts. Automaton has 14405 states and 43044 transitions. Word has length 39 [2019-12-27 20:02:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:15,045 INFO L462 AbstractCegarLoop]: Abstraction has 14405 states and 43044 transitions. [2019-12-27 20:02:15,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:02:15,046 INFO L276 IsEmpty]: Start isEmpty. Operand 14405 states and 43044 transitions. [2019-12-27 20:02:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:02:15,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:15,070 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 20:02:15,070 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 20:02:15,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:15,071 INFO L82 PathProgramCache]: Analyzing trace with hash -918298112, now seen corresponding path program 1 times [2019-12-27 20:02:15,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:15,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749414976] [2019-12-27 20:02:15,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:15,178 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 20:02:15,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749414976] [2019-12-27 20:02:15,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:15,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:02:15,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [666067618] [2019-12-27 20:02:15,180 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:15,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:15,292 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 448 transitions. [2019-12-27 20:02:15,292 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:15,321 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:02:15,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:02:15,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:15,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:02:15,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:02:15,322 INFO L87 Difference]: Start difference. First operand 14405 states and 43044 transitions. Second operand 6 states. [2019-12-27 20:02:15,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:15,409 INFO L93 Difference]: Finished difference Result 13331 states and 40580 transitions. [2019-12-27 20:02:15,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:02:15,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 20:02:15,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:15,433 INFO L225 Difference]: With dead ends: 13331 [2019-12-27 20:02:15,433 INFO L226 Difference]: Without dead ends: 11780 [2019-12-27 20:02:15,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:02:15,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11780 states. [2019-12-27 20:02:15,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11780 to 11367. [2019-12-27 20:02:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11367 states. [2019-12-27 20:02:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11367 states to 11367 states and 35647 transitions. [2019-12-27 20:02:15,729 INFO L78 Accepts]: Start accepts. Automaton has 11367 states and 35647 transitions. Word has length 40 [2019-12-27 20:02:15,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:15,729 INFO L462 AbstractCegarLoop]: Abstraction has 11367 states and 35647 transitions. [2019-12-27 20:02:15,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:02:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 11367 states and 35647 transitions. [2019-12-27 20:02:15,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:02:15,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:15,753 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 20:02:15,753 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 20:02:15,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:15,753 INFO L82 PathProgramCache]: Analyzing trace with hash 35945, now seen corresponding path program 1 times [2019-12-27 20:02:15,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:15,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916510259] [2019-12-27 20:02:15,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:15,837 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 20:02:15,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916510259] [2019-12-27 20:02:15,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:15,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:02:15,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1354178471] [2019-12-27 20:02:15,838 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:15,867 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:16,180 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 425 transitions. [2019-12-27 20:02:16,180 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:16,194 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:02:16,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:02:16,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:16,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:02:16,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:16,195 INFO L87 Difference]: Start difference. First operand 11367 states and 35647 transitions. Second operand 3 states. [2019-12-27 20:02:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:16,289 INFO L93 Difference]: Finished difference Result 18105 states and 55572 transitions. [2019-12-27 20:02:16,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:02:16,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 20:02:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:16,320 INFO L225 Difference]: With dead ends: 18105 [2019-12-27 20:02:16,321 INFO L226 Difference]: Without dead ends: 18105 [2019-12-27 20:02:16,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18105 states. [2019-12-27 20:02:16,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18105 to 13117. [2019-12-27 20:02:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13117 states. [2019-12-27 20:02:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13117 states to 13117 states and 40802 transitions. [2019-12-27 20:02:16,639 INFO L78 Accepts]: Start accepts. Automaton has 13117 states and 40802 transitions. Word has length 64 [2019-12-27 20:02:16,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:16,640 INFO L462 AbstractCegarLoop]: Abstraction has 13117 states and 40802 transitions. [2019-12-27 20:02:16,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:02:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 13117 states and 40802 transitions. [2019-12-27 20:02:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:02:16,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:16,655 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 20:02:16,655 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 20:02:16,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:16,655 INFO L82 PathProgramCache]: Analyzing trace with hash 529429650, now seen corresponding path program 1 times [2019-12-27 20:02:16,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:16,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127177715] [2019-12-27 20:02:16,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:16,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127177715] [2019-12-27 20:02:16,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:16,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:02:16,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1137940326] [2019-12-27 20:02:16,749 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:16,770 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:16,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 425 transitions. [2019-12-27 20:02:16,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:17,015 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:02:17,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:02:17,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:17,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:02:17,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:02:17,016 INFO L87 Difference]: Start difference. First operand 13117 states and 40802 transitions. Second operand 9 states. [2019-12-27 20:02:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:19,047 INFO L93 Difference]: Finished difference Result 56381 states and 171825 transitions. [2019-12-27 20:02:19,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 20:02:19,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 20:02:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:19,102 INFO L225 Difference]: With dead ends: 56381 [2019-12-27 20:02:19,102 INFO L226 Difference]: Without dead ends: 41488 [2019-12-27 20:02:19,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:02:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41488 states. [2019-12-27 20:02:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41488 to 15884. [2019-12-27 20:02:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15884 states. [2019-12-27 20:02:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15884 states to 15884 states and 49663 transitions. [2019-12-27 20:02:19,530 INFO L78 Accepts]: Start accepts. Automaton has 15884 states and 49663 transitions. Word has length 64 [2019-12-27 20:02:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:19,531 INFO L462 AbstractCegarLoop]: Abstraction has 15884 states and 49663 transitions. [2019-12-27 20:02:19,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:02:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 15884 states and 49663 transitions. [2019-12-27 20:02:19,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:02:19,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:19,554 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 20:02:19,554 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 20:02:19,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:19,555 INFO L82 PathProgramCache]: Analyzing trace with hash -660129416, now seen corresponding path program 2 times [2019-12-27 20:02:19,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:19,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765578867] [2019-12-27 20:02:19,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:19,649 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 20:02:19,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765578867] [2019-12-27 20:02:19,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:19,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:02:19,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1498500059] [2019-12-27 20:02:19,651 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:19,672 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:19,881 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 299 states and 545 transitions. [2019-12-27 20:02:19,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:19,980 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 20:02:19,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:02:19,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:19,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:02:19,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:02:19,981 INFO L87 Difference]: Start difference. First operand 15884 states and 49663 transitions. Second operand 10 states. [2019-12-27 20:02:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:20,529 INFO L93 Difference]: Finished difference Result 41934 states and 128892 transitions. [2019-12-27 20:02:20,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:02:20,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 20:02:20,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:20,572 INFO L225 Difference]: With dead ends: 41934 [2019-12-27 20:02:20,573 INFO L226 Difference]: Without dead ends: 30465 [2019-12-27 20:02:20,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:02:20,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30465 states. [2019-12-27 20:02:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30465 to 18556. [2019-12-27 20:02:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18556 states. [2019-12-27 20:02:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18556 states to 18556 states and 58034 transitions. [2019-12-27 20:02:21,092 INFO L78 Accepts]: Start accepts. Automaton has 18556 states and 58034 transitions. Word has length 64 [2019-12-27 20:02:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:21,092 INFO L462 AbstractCegarLoop]: Abstraction has 18556 states and 58034 transitions. [2019-12-27 20:02:21,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:02:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 18556 states and 58034 transitions. [2019-12-27 20:02:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:02:21,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:02:21,117 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 20:02:21,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:21,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1274071658, now seen corresponding path program 3 times [2019-12-27 20:02:21,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:21,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627615958] [2019-12-27 20:02:21,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:21,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627615958] [2019-12-27 20:02:21,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:21,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:02:21,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [801407607] [2019-12-27 20:02:21,258 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:21,300 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:21,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 252 states and 485 transitions. [2019-12-27 20:02:21,523 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:21,739 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 20:02:21,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:02:21,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:21,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:02:21,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:02:21,740 INFO L87 Difference]: Start difference. First operand 18556 states and 58034 transitions. Second operand 12 states. [2019-12-27 20:02:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:24,869 INFO L93 Difference]: Finished difference Result 96621 states and 295035 transitions. [2019-12-27 20:02:24,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 20:02:24,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 20:02:24,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:25,047 INFO L225 Difference]: With dead ends: 96621 [2019-12-27 20:02:25,047 INFO L226 Difference]: Without dead ends: 77114 [2019-12-27 20:02:25,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 14 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=745, Invalid=2447, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 20:02:25,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77114 states. [2019-12-27 20:02:26,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77114 to 22048. [2019-12-27 20:02:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22048 states. [2019-12-27 20:02:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22048 states to 22048 states and 69633 transitions. [2019-12-27 20:02:26,098 INFO L78 Accepts]: Start accepts. Automaton has 22048 states and 69633 transitions. Word has length 64 [2019-12-27 20:02:26,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:26,099 INFO L462 AbstractCegarLoop]: Abstraction has 22048 states and 69633 transitions. [2019-12-27 20:02:26,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:02:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 22048 states and 69633 transitions. [2019-12-27 20:02:26,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 20:02:26,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:26,122 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 20:02:26,123 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 20:02:26,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:26,123 INFO L82 PathProgramCache]: Analyzing trace with hash 780788010, now seen corresponding path program 4 times [2019-12-27 20:02:26,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:26,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715154120] [2019-12-27 20:02:26,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:26,203 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 20:02:26,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715154120] [2019-12-27 20:02:26,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:26,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:02:26,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1345582608] [2019-12-27 20:02:26,206 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:26,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:26,440 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 438 transitions. [2019-12-27 20:02:26,440 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:26,441 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:02:26,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:02:26,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:26,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:02:26,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:26,442 INFO L87 Difference]: Start difference. First operand 22048 states and 69633 transitions. Second operand 3 states. [2019-12-27 20:02:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:26,565 INFO L93 Difference]: Finished difference Result 26331 states and 82304 transitions. [2019-12-27 20:02:26,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:02:26,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 20:02:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:26,622 INFO L225 Difference]: With dead ends: 26331 [2019-12-27 20:02:26,623 INFO L226 Difference]: Without dead ends: 26331 [2019-12-27 20:02:26,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 20:02:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26331 states. [2019-12-27 20:02:26,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26331 to 23272. [2019-12-27 20:02:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23272 states. [2019-12-27 20:02:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23272 states to 23272 states and 73348 transitions. [2019-12-27 20:02:27,014 INFO L78 Accepts]: Start accepts. Automaton has 23272 states and 73348 transitions. Word has length 64 [2019-12-27 20:02:27,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:27,015 INFO L462 AbstractCegarLoop]: Abstraction has 23272 states and 73348 transitions. [2019-12-27 20:02:27,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:02:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 23272 states and 73348 transitions. [2019-12-27 20:02:27,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:27,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:27,039 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 20:02:27,039 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 20:02:27,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:27,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1921187735, now seen corresponding path program 1 times [2019-12-27 20:02:27,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:27,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609462224] [2019-12-27 20:02:27,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:27,095 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 20:02:27,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609462224] [2019-12-27 20:02:27,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:27,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:02:27,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1078004502] [2019-12-27 20:02:27,096 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:27,116 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:27,539 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 256 states and 493 transitions. [2019-12-27 20:02:27,539 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:27,542 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:02:27,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:02:27,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:27,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:02:27,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:02:27,543 INFO L87 Difference]: Start difference. First operand 23272 states and 73348 transitions. Second operand 4 states. [2019-12-27 20:02:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:28,037 INFO L93 Difference]: Finished difference Result 38402 states and 120565 transitions. [2019-12-27 20:02:28,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:02:28,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 20:02:28,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:28,137 INFO L225 Difference]: With dead ends: 38402 [2019-12-27 20:02:28,138 INFO L226 Difference]: Without dead ends: 38402 [2019-12-27 20:02:28,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 20:02:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38402 states. [2019-12-27 20:02:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38402 to 25828. [2019-12-27 20:02:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25828 states. [2019-12-27 20:02:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25828 states to 25828 states and 82401 transitions. [2019-12-27 20:02:28,846 INFO L78 Accepts]: Start accepts. Automaton has 25828 states and 82401 transitions. Word has length 65 [2019-12-27 20:02:28,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:28,846 INFO L462 AbstractCegarLoop]: Abstraction has 25828 states and 82401 transitions. [2019-12-27 20:02:28,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:02:28,846 INFO L276 IsEmpty]: Start isEmpty. Operand 25828 states and 82401 transitions. [2019-12-27 20:02:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:28,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:28,879 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 20:02:28,879 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 20:02:28,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:28,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1641322509, now seen corresponding path program 2 times [2019-12-27 20:02:28,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:28,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200978629] [2019-12-27 20:02:28,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:28,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200978629] [2019-12-27 20:02:28,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:28,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:02:28,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [534527679] [2019-12-27 20:02:28,929 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:28,949 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:29,257 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 311 states and 633 transitions. [2019-12-27 20:02:29,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:29,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:02:29,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:02:29,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:29,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:02:29,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:29,270 INFO L87 Difference]: Start difference. First operand 25828 states and 82401 transitions. Second operand 3 states. [2019-12-27 20:02:29,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:29,499 INFO L93 Difference]: Finished difference Result 34148 states and 108669 transitions. [2019-12-27 20:02:29,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:02:29,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 20:02:29,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:29,556 INFO L225 Difference]: With dead ends: 34148 [2019-12-27 20:02:29,556 INFO L226 Difference]: Without dead ends: 34148 [2019-12-27 20:02:29,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:29,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34148 states. [2019-12-27 20:02:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34148 to 26279. [2019-12-27 20:02:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26279 states. [2019-12-27 20:02:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26279 states to 26279 states and 83813 transitions. [2019-12-27 20:02:30,237 INFO L78 Accepts]: Start accepts. Automaton has 26279 states and 83813 transitions. Word has length 65 [2019-12-27 20:02:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:30,237 INFO L462 AbstractCegarLoop]: Abstraction has 26279 states and 83813 transitions. [2019-12-27 20:02:30,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:02:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 26279 states and 83813 transitions. [2019-12-27 20:02:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:30,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:30,271 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 20:02:30,271 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 20:02:30,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:30,271 INFO L82 PathProgramCache]: Analyzing trace with hash -540812247, now seen corresponding path program 1 times [2019-12-27 20:02:30,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:30,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121110486] [2019-12-27 20:02:30,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:30,400 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 20:02:30,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121110486] [2019-12-27 20:02:30,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:30,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:02:30,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2090493183] [2019-12-27 20:02:30,401 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:30,423 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:30,794 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 308 states and 625 transitions. [2019-12-27 20:02:30,794 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:31,056 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 20:02:31,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:02:31,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:31,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:02:31,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:02:31,058 INFO L87 Difference]: Start difference. First operand 26279 states and 83813 transitions. Second operand 12 states. [2019-12-27 20:02:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:35,790 INFO L93 Difference]: Finished difference Result 97989 states and 304211 transitions. [2019-12-27 20:02:35,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 20:02:35,791 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 20:02:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:35,931 INFO L225 Difference]: With dead ends: 97989 [2019-12-27 20:02:35,931 INFO L226 Difference]: Without dead ends: 89887 [2019-12-27 20:02:35,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=641, Invalid=2221, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 20:02:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89887 states. [2019-12-27 20:02:36,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89887 to 27311. [2019-12-27 20:02:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27311 states. [2019-12-27 20:02:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27311 states to 27311 states and 87437 transitions. [2019-12-27 20:02:36,958 INFO L78 Accepts]: Start accepts. Automaton has 27311 states and 87437 transitions. Word has length 65 [2019-12-27 20:02:36,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:36,958 INFO L462 AbstractCegarLoop]: Abstraction has 27311 states and 87437 transitions. [2019-12-27 20:02:36,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:02:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 27311 states and 87437 transitions. [2019-12-27 20:02:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:36,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:36,988 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 20:02:36,988 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 20:02:36,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:36,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1276887603, now seen corresponding path program 2 times [2019-12-27 20:02:36,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:36,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130998482] [2019-12-27 20:02:36,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:37,116 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 20:02:37,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130998482] [2019-12-27 20:02:37,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:37,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:02:37,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [255998740] [2019-12-27 20:02:37,117 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:37,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:37,510 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 276 states and 553 transitions. [2019-12-27 20:02:37,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:37,685 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 20:02:37,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:02:37,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:37,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:02:37,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:02:37,688 INFO L87 Difference]: Start difference. First operand 27311 states and 87437 transitions. Second operand 12 states. [2019-12-27 20:02:40,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:40,368 INFO L93 Difference]: Finished difference Result 87007 states and 268929 transitions. [2019-12-27 20:02:40,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 20:02:40,369 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 20:02:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:40,506 INFO L225 Difference]: With dead ends: 87007 [2019-12-27 20:02:40,506 INFO L226 Difference]: Without dead ends: 82991 [2019-12-27 20:02:40,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=348, Invalid=1134, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 20:02:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82991 states. [2019-12-27 20:02:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82991 to 27228. [2019-12-27 20:02:41,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27228 states. [2019-12-27 20:02:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27228 states to 27228 states and 87057 transitions. [2019-12-27 20:02:41,435 INFO L78 Accepts]: Start accepts. Automaton has 27228 states and 87057 transitions. Word has length 65 [2019-12-27 20:02:41,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:41,436 INFO L462 AbstractCegarLoop]: Abstraction has 27228 states and 87057 transitions. [2019-12-27 20:02:41,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:02:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 27228 states and 87057 transitions. [2019-12-27 20:02:41,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:41,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:41,466 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 20:02:41,466 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 20:02:41,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:41,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1793089863, now seen corresponding path program 1 times [2019-12-27 20:02:41,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:41,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875500260] [2019-12-27 20:02:41,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:41,653 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 20:02:41,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875500260] [2019-12-27 20:02:41,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:41,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:02:41,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [60582752] [2019-12-27 20:02:41,656 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:41,690 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:42,011 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 442 transitions. [2019-12-27 20:02:42,012 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:42,452 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-12-27 20:02:42,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 20:02:42,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:02:42,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:42,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:02:42,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:02:42,576 INFO L87 Difference]: Start difference. First operand 27228 states and 87057 transitions. Second operand 11 states. [2019-12-27 20:02:45,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:45,846 INFO L93 Difference]: Finished difference Result 53504 states and 164467 transitions. [2019-12-27 20:02:45,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 20:02:45,846 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 20:02:45,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:45,936 INFO L225 Difference]: With dead ends: 53504 [2019-12-27 20:02:45,936 INFO L226 Difference]: Without dead ends: 53264 [2019-12-27 20:02:45,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 29 SyntacticMatches, 11 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=296, Invalid=1426, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 20:02:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53264 states. [2019-12-27 20:02:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53264 to 34619. [2019-12-27 20:02:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34619 states. [2019-12-27 20:02:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34619 states to 34619 states and 108911 transitions. [2019-12-27 20:02:46,668 INFO L78 Accepts]: Start accepts. Automaton has 34619 states and 108911 transitions. Word has length 65 [2019-12-27 20:02:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:46,669 INFO L462 AbstractCegarLoop]: Abstraction has 34619 states and 108911 transitions. [2019-12-27 20:02:46,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:02:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 34619 states and 108911 transitions. [2019-12-27 20:02:46,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:02:46,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:46,712 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 20:02:46,712 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 20:02:46,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:46,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1522183215, now seen corresponding path program 2 times [2019-12-27 20:02:46,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:46,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991347673] [2019-12-27 20:02:46,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:46,774 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 20:02:46,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991347673] [2019-12-27 20:02:46,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:46,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:02:46,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [215839439] [2019-12-27 20:02:46,775 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:46,791 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:47,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 313 transitions. [2019-12-27 20:02:47,049 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:47,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:47,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:02:47,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:47,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:02:47,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:47,051 INFO L87 Difference]: Start difference. First operand 34619 states and 108911 transitions. Second operand 3 states. [2019-12-27 20:02:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:47,233 INFO L93 Difference]: Finished difference Result 34618 states and 108909 transitions. [2019-12-27 20:02:47,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:02:47,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 20:02:47,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:47,309 INFO L225 Difference]: With dead ends: 34618 [2019-12-27 20:02:47,310 INFO L226 Difference]: Without dead ends: 34618 [2019-12-27 20:02:47,311 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 20:02:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34618 states. [2019-12-27 20:02:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34618 to 29349. [2019-12-27 20:02:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29349 states. [2019-12-27 20:02:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29349 states to 29349 states and 94224 transitions. [2019-12-27 20:02:48,454 INFO L78 Accepts]: Start accepts. Automaton has 29349 states and 94224 transitions. Word has length 65 [2019-12-27 20:02:48,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:48,455 INFO L462 AbstractCegarLoop]: Abstraction has 29349 states and 94224 transitions. [2019-12-27 20:02:48,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:02:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 29349 states and 94224 transitions. [2019-12-27 20:02:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:02:48,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:48,515 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 20:02:48,516 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 20:02:48,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:48,516 INFO L82 PathProgramCache]: Analyzing trace with hash -181239498, now seen corresponding path program 1 times [2019-12-27 20:02:48,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:48,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674616709] [2019-12-27 20:02:48,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:48,634 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 20:02:48,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674616709] [2019-12-27 20:02:48,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:48,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:02:48,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462781319] [2019-12-27 20:02:48,635 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:48,654 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:48,980 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 252 states and 426 transitions. [2019-12-27 20:02:48,980 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:48,990 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:02:48,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:02:48,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:48,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:02:48,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:02:48,991 INFO L87 Difference]: Start difference. First operand 29349 states and 94224 transitions. Second operand 4 states. [2019-12-27 20:02:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:49,302 INFO L93 Difference]: Finished difference Result 34671 states and 108263 transitions. [2019-12-27 20:02:49,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:02:49,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 20:02:49,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:49,358 INFO L225 Difference]: With dead ends: 34671 [2019-12-27 20:02:49,359 INFO L226 Difference]: Without dead ends: 34671 [2019-12-27 20:02:49,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 20:02:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34671 states. [2019-12-27 20:02:49,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34671 to 23314. [2019-12-27 20:02:49,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23314 states. [2019-12-27 20:02:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23314 states to 23314 states and 73528 transitions. [2019-12-27 20:02:49,780 INFO L78 Accepts]: Start accepts. Automaton has 23314 states and 73528 transitions. Word has length 66 [2019-12-27 20:02:49,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:49,780 INFO L462 AbstractCegarLoop]: Abstraction has 23314 states and 73528 transitions. [2019-12-27 20:02:49,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:02:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 23314 states and 73528 transitions. [2019-12-27 20:02:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:02:49,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:49,804 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 20:02:49,804 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 20:02:49,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:49,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1190649937, now seen corresponding path program 1 times [2019-12-27 20:02:49,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:49,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523194587] [2019-12-27 20:02:49,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:49,973 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 20:02:49,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523194587] [2019-12-27 20:02:49,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:49,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:02:49,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1192721874] [2019-12-27 20:02:49,974 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:49,991 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:50,274 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 234 states and 436 transitions. [2019-12-27 20:02:50,274 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:50,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:02:50,695 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 20:02:50,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:02:50,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:50,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:02:50,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:02:50,697 INFO L87 Difference]: Start difference. First operand 23314 states and 73528 transitions. Second operand 15 states. [2019-12-27 20:02:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:53,344 INFO L93 Difference]: Finished difference Result 46475 states and 145084 transitions. [2019-12-27 20:02:53,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 20:02:53,345 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 20:02:53,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:53,396 INFO L225 Difference]: With dead ends: 46475 [2019-12-27 20:02:53,396 INFO L226 Difference]: Without dead ends: 34418 [2019-12-27 20:02:53,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2019-12-27 20:02:53,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34418 states. [2019-12-27 20:02:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34418 to 24290. [2019-12-27 20:02:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24290 states. [2019-12-27 20:02:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24290 states to 24290 states and 76035 transitions. [2019-12-27 20:02:53,841 INFO L78 Accepts]: Start accepts. Automaton has 24290 states and 76035 transitions. Word has length 67 [2019-12-27 20:02:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:53,841 INFO L462 AbstractCegarLoop]: Abstraction has 24290 states and 76035 transitions. [2019-12-27 20:02:53,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:02:53,842 INFO L276 IsEmpty]: Start isEmpty. Operand 24290 states and 76035 transitions. [2019-12-27 20:02:53,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:02:53,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:53,869 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 20:02:53,869 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 20:02:53,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:53,869 INFO L82 PathProgramCache]: Analyzing trace with hash -408447633, now seen corresponding path program 2 times [2019-12-27 20:02:53,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:53,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612747625] [2019-12-27 20:02:53,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:54,097 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 20:02:54,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612747625] [2019-12-27 20:02:54,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:54,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:02:54,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1285060055] [2019-12-27 20:02:54,098 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:54,112 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:54,274 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 396 transitions. [2019-12-27 20:02:54,274 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:54,491 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:02:54,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:02:54,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:54,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:02:54,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:02:54,492 INFO L87 Difference]: Start difference. First operand 24290 states and 76035 transitions. Second operand 15 states. [2019-12-27 20:02:55,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:55,815 INFO L93 Difference]: Finished difference Result 51447 states and 159663 transitions. [2019-12-27 20:02:55,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 20:02:55,816 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 20:02:55,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:55,884 INFO L225 Difference]: With dead ends: 51447 [2019-12-27 20:02:55,884 INFO L226 Difference]: Without dead ends: 48715 [2019-12-27 20:02:55,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=240, Invalid=1020, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 20:02:56,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48715 states. [2019-12-27 20:02:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48715 to 28518. [2019-12-27 20:02:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28518 states. [2019-12-27 20:02:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28518 states to 28518 states and 88762 transitions. [2019-12-27 20:02:56,665 INFO L78 Accepts]: Start accepts. Automaton has 28518 states and 88762 transitions. Word has length 67 [2019-12-27 20:02:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:56,665 INFO L462 AbstractCegarLoop]: Abstraction has 28518 states and 88762 transitions. [2019-12-27 20:02:56,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:02:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 28518 states and 88762 transitions. [2019-12-27 20:02:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:02:56,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:56,697 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 20:02:56,697 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 20:02:56,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:56,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1110706713, now seen corresponding path program 3 times [2019-12-27 20:02:56,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:56,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296363] [2019-12-27 20:02:56,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:56,908 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 20:02:56,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296363] [2019-12-27 20:02:56,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:56,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:02:56,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [64683190] [2019-12-27 20:02:56,910 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:56,925 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:57,272 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 610 transitions. [2019-12-27 20:02:57,272 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:57,524 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 20:02:57,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 20:02:57,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:57,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 20:02:57,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:02:57,525 INFO L87 Difference]: Start difference. First operand 28518 states and 88762 transitions. Second operand 16 states. [2019-12-27 20:03:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:01,128 INFO L93 Difference]: Finished difference Result 60377 states and 185956 transitions. [2019-12-27 20:03:01,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 20:03:01,129 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 20:03:01,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:01,191 INFO L225 Difference]: With dead ends: 60377 [2019-12-27 20:03:01,191 INFO L226 Difference]: Without dead ends: 43733 [2019-12-27 20:03:01,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 13 SyntacticMatches, 10 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=722, Invalid=3310, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 20:03:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43733 states. [2019-12-27 20:03:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43733 to 24593. [2019-12-27 20:03:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24593 states. [2019-12-27 20:03:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24593 states to 24593 states and 76909 transitions. [2019-12-27 20:03:01,949 INFO L78 Accepts]: Start accepts. Automaton has 24593 states and 76909 transitions. Word has length 67 [2019-12-27 20:03:01,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:01,949 INFO L462 AbstractCegarLoop]: Abstraction has 24593 states and 76909 transitions. [2019-12-27 20:03:01,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 20:03:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 24593 states and 76909 transitions. [2019-12-27 20:03:01,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:03:01,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:01,977 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 20:03:01,977 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 20:03:01,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:01,977 INFO L82 PathProgramCache]: Analyzing trace with hash -306388881, now seen corresponding path program 4 times [2019-12-27 20:03:01,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:01,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820114365] [2019-12-27 20:03:01,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:02,167 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 20:03:02,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820114365] [2019-12-27 20:03:02,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:02,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:03:02,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1042574202] [2019-12-27 20:03:02,168 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:02,188 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:02,534 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 278 states and 547 transitions. [2019-12-27 20:03:02,534 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:02,842 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 20:03:02,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 20:03:02,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:02,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 20:03:02,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:03:02,843 INFO L87 Difference]: Start difference. First operand 24593 states and 76909 transitions. Second operand 16 states. [2019-12-27 20:03:04,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:04,285 INFO L93 Difference]: Finished difference Result 40426 states and 125245 transitions. [2019-12-27 20:03:04,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 20:03:04,285 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 20:03:04,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:04,341 INFO L225 Difference]: With dead ends: 40426 [2019-12-27 20:03:04,341 INFO L226 Difference]: Without dead ends: 39999 [2019-12-27 20:03:04,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2019-12-27 20:03:04,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39999 states. [2019-12-27 20:03:04,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39999 to 24333. [2019-12-27 20:03:04,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24333 states. [2019-12-27 20:03:04,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24333 states to 24333 states and 76247 transitions. [2019-12-27 20:03:04,829 INFO L78 Accepts]: Start accepts. Automaton has 24333 states and 76247 transitions. Word has length 67 [2019-12-27 20:03:04,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:04,829 INFO L462 AbstractCegarLoop]: Abstraction has 24333 states and 76247 transitions. [2019-12-27 20:03:04,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 20:03:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 24333 states and 76247 transitions. [2019-12-27 20:03:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:03:04,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:04,855 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 20:03:04,855 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 20:03:04,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:04,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1704185659, now seen corresponding path program 5 times [2019-12-27 20:03:04,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:04,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656427036] [2019-12-27 20:03:04,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:03:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:03:05,003 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:03:05,003 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:03:05,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [897] [897] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~a$r_buff1_thd3~0_51) (= 0 v_~a$w_buff1_used~0_72) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~a$w_buff0_used~0_114) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~a$r_buff1_thd1~0_16) (= 0 v_~__unbuffered_cnt~0_21) (= v_~z~0_10 0) (= v_~a$flush_delayed~0_12 0) (= 0 v_~weak$$choice2~0_32) (= v_~a$r_buff0_thd3~0_76 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~__unbuffered_p2_EAX~0_17) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t287~0.base_25|) (= v_~__unbuffered_p2_EBX~0_18 0) (= v_~a$r_buff0_thd2~0_20 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t287~0.base_25| 4)) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice0~0_7) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t287~0.base_25| 1)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t287~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t287~0.base_25|) |v_ULTIMATE.start_main_~#t287~0.offset_20| 0)) |v_#memory_int_23|) (= v_~a$mem_tmp~0_10 0) (= v_~a~0_29 0) (= 0 v_~a$r_buff1_thd0~0_22) (= |v_#NULL.offset_4| 0) (= v_~a$r_buff0_thd1~0_25 0) (= v_~main$tmp_guard0~0_11 0) (= v_~a$read_delayed_var~0.offset_8 0) (= 0 v_~a$w_buff1~0_25) (= |v_ULTIMATE.start_main_~#t287~0.offset_20| 0) (= v_~x~0_19 0) (= 0 v_~a$r_buff1_thd2~0_18) (= 0 v_~__unbuffered_p1_EAX~0_16) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t287~0.base_25|)) (= 0 v_~a$w_buff0~0_25) (= 0 v_~a$read_delayed~0_8) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t288~0.base=|v_ULTIMATE.start_main_~#t288~0.base_26|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ULTIMATE.start_main_~#t288~0.offset=|v_ULTIMATE.start_main_~#t288~0.offset_20|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_29, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_18, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ULTIMATE.start_main_~#t289~0.base=|v_ULTIMATE.start_main_~#t289~0.base_22|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_114, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_25, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_25, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_19, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ULTIMATE.start_main_~#t287~0.offset=|v_ULTIMATE.start_main_~#t287~0.offset_20|, ~y~0=v_~y~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_~#t289~0.offset=|v_ULTIMATE.start_main_~#t289~0.offset_16|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_16, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_76, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t287~0.base=|v_ULTIMATE.start_main_~#t287~0.base_25|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_10, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t288~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t288~0.offset, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ULTIMATE.start_main_~#t289~0.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t287~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t289~0.offset, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t287~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 20:03:05,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t288~0.base_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t288~0.base_13| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t288~0.offset_11| 0) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t288~0.base_13|)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t288~0.base_13| 1) |v_#valid_40|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t288~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t288~0.base_13|) |v_ULTIMATE.start_main_~#t288~0.offset_11| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t288~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t288~0.base=|v_ULTIMATE.start_main_~#t288~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t288~0.offset=|v_ULTIMATE.start_main_~#t288~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t288~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t288~0.offset] because there is no mapped edge [2019-12-27 20:03:05,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L4-->L750: Formula: (and (= 1 v_~x~0_5) (= v_~a$r_buff0_thd1~0_16 v_~a$r_buff1_thd1~0_11) (= v_~a$r_buff0_thd1~0_15 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~a$r_buff0_thd2~0_14 v_~a$r_buff1_thd2~0_10) (= v_~a$r_buff0_thd3~0_48 v_~a$r_buff1_thd3~0_28) (= v_~a$r_buff0_thd0~0_14 v_~a$r_buff1_thd0~0_11)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_14, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_16, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_14} OutVars{~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_11, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_10, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_14, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_11, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_15, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_14, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 20:03:05,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L776-2-->L776-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In2143514241 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In2143514241 256) 0))) (or (and (not .cse0) (= ~a$w_buff1~0_In2143514241 |P1Thread1of1ForFork2_#t~ite9_Out2143514241|) (not .cse1)) (and (= ~a~0_In2143514241 |P1Thread1of1ForFork2_#t~ite9_Out2143514241|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In2143514241, ~a$w_buff1~0=~a$w_buff1~0_In2143514241, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2143514241, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2143514241} OutVars{~a~0=~a~0_In2143514241, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out2143514241|, ~a$w_buff1~0=~a$w_buff1~0_In2143514241, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2143514241, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2143514241} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 20:03:05,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L776-4-->L777: Formula: (= v_~a~0_20 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_20, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 20:03:05,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1026421041 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1026421041 256)))) (or (and (= ~a$w_buff0_used~0_In1026421041 |P0Thread1of1ForFork1_#t~ite5_Out1026421041|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1026421041|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1026421041, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1026421041} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1026421041|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1026421041, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1026421041} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 20:03:05,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-763017827 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-763017827 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-763017827 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-763017827 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-763017827 |P0Thread1of1ForFork1_#t~ite6_Out-763017827|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite6_Out-763017827| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-763017827, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-763017827, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-763017827, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-763017827} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-763017827|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-763017827, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-763017827, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-763017827, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-763017827} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 20:03:05,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L753-->L754: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-713457658 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-713457658 256) 0))) (or (and (= ~a$r_buff0_thd1~0_In-713457658 ~a$r_buff0_thd1~0_Out-713457658) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out-713457658)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-713457658, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-713457658} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-713457658|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-713457658, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-713457658} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:03:05,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1996875492 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1996875492 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In1996875492 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In1996875492 256) 0))) (or (and (= ~a$r_buff1_thd1~0_In1996875492 |P0Thread1of1ForFork1_#t~ite8_Out1996875492|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1996875492|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1996875492, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1996875492, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1996875492, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1996875492} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1996875492|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1996875492, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1996875492, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1996875492, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1996875492} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 20:03:05,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:03:05,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L837-1-->L839: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t289~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t289~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t289~0.base_12| 4)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t289~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t289~0.base_12|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t289~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t289~0.base_12|) |v_ULTIMATE.start_main_~#t289~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t289~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t289~0.offset=|v_ULTIMATE.start_main_~#t289~0.offset_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t289~0.base=|v_ULTIMATE.start_main_~#t289~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t289~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t289~0.base, #length] because there is no mapped edge [2019-12-27 20:03:05,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-844192812 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out-844192812| ~a$w_buff0~0_In-844192812) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-844192812 256) 0))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-844192812 256))) (and (= (mod ~a$w_buff1_used~0_In-844192812 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-844192812 256)))) (= |P2Thread1of1ForFork0_#t~ite20_Out-844192812| |P2Thread1of1ForFork0_#t~ite21_Out-844192812|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-844192812| |P2Thread1of1ForFork0_#t~ite20_Out-844192812|) (= |P2Thread1of1ForFork0_#t~ite21_Out-844192812| ~a$w_buff0~0_In-844192812)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-844192812, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-844192812, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-844192812, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-844192812, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-844192812, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-844192812|, ~weak$$choice2~0=~weak$$choice2~0_In-844192812} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-844192812|, ~a$w_buff0~0=~a$w_buff0~0_In-844192812, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-844192812, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-844192812, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-844192812, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-844192812|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-844192812, ~weak$$choice2~0=~weak$$choice2~0_In-844192812} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 20:03:05,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-89921865 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out-89921865| |P2Thread1of1ForFork0_#t~ite27_Out-89921865|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-89921865 256) 0))) (or (and (= (mod ~a$w_buff1_used~0_In-89921865 256) 0) .cse1) (and (= (mod ~a$r_buff1_thd3~0_In-89921865 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-89921865 256)))) (= |P2Thread1of1ForFork0_#t~ite26_Out-89921865| ~a$w_buff0_used~0_In-89921865)) (and (not .cse0) (= ~a$w_buff0_used~0_In-89921865 |P2Thread1of1ForFork0_#t~ite27_Out-89921865|) (= |P2Thread1of1ForFork0_#t~ite26_In-89921865| |P2Thread1of1ForFork0_#t~ite26_Out-89921865|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-89921865|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-89921865, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-89921865, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-89921865, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-89921865, ~weak$$choice2~0=~weak$$choice2~0_In-89921865} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-89921865|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-89921865|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-89921865, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-89921865, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-89921865, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-89921865, ~weak$$choice2~0=~weak$$choice2~0_In-89921865} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 20:03:05,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L804-->L804-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In289511840 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out289511840| |P2Thread1of1ForFork0_#t~ite30_Out289511840|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In289511840 256)))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In289511840 256))) (= 0 (mod ~a$w_buff0_used~0_In289511840 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In289511840 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite29_Out289511840| ~a$w_buff1_used~0_In289511840)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite29_In289511840| |P2Thread1of1ForFork0_#t~ite29_Out289511840|) (= ~a$w_buff1_used~0_In289511840 |P2Thread1of1ForFork0_#t~ite30_Out289511840|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In289511840, ~a$w_buff0_used~0=~a$w_buff0_used~0_In289511840, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In289511840, ~a$w_buff1_used~0=~a$w_buff1_used~0_In289511840, ~weak$$choice2~0=~weak$$choice2~0_In289511840, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In289511840|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In289511840, ~a$w_buff0_used~0=~a$w_buff0_used~0_In289511840, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In289511840, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out289511840|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In289511840, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out289511840|, ~weak$$choice2~0=~weak$$choice2~0_In289511840} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 20:03:05,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_61 v_~a$r_buff0_thd3~0_60) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:03:05,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L808-->L812: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a$flush_delayed~0_6 0) (= v_~a~0_21 v_~a$mem_tmp~0_4)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_21, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 20:03:05,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L812-2-->L812-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1496486627 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1496486627 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1496486627| ~a~0_In1496486627)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out1496486627| ~a$w_buff1~0_In1496486627) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In1496486627, ~a$w_buff1~0=~a$w_buff1~0_In1496486627, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1496486627, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1496486627} OutVars{~a~0=~a~0_In1496486627, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1496486627|, ~a$w_buff1~0=~a$w_buff1~0_In1496486627, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1496486627, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1496486627} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 20:03:05,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L812-4-->L813: Formula: (= v_~a~0_16 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_16, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 20:03:05,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1811078579 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-1811078579 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1811078579|)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-1811078579 |P2Thread1of1ForFork0_#t~ite40_Out-1811078579|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1811078579, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1811078579} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1811078579|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1811078579, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1811078579} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 20:03:05,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-503121986 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-503121986 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-503121986 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd3~0_In-503121986 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-503121986| ~a$w_buff1_used~0_In-503121986)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-503121986| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-503121986, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-503121986, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-503121986, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-503121986} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-503121986, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-503121986, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-503121986, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-503121986, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-503121986|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 20:03:05,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In929841767 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In929841767 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd3~0_In929841767 |P2Thread1of1ForFork0_#t~ite42_Out929841767|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out929841767|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In929841767, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In929841767} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In929841767, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In929841767, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out929841767|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 20:03:05,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd3~0_In18673597 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In18673597 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In18673597 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In18673597 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out18673597| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out18673597| ~a$r_buff1_thd3~0_In18673597) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In18673597, ~a$w_buff0_used~0=~a$w_buff0_used~0_In18673597, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In18673597, ~a$w_buff1_used~0=~a$w_buff1_used~0_In18673597} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out18673597|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In18673597, ~a$w_buff0_used~0=~a$w_buff0_used~0_In18673597, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In18673597, ~a$w_buff1_used~0=~a$w_buff1_used~0_In18673597} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 20:03:05,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_42 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_42, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:03:05,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1686267996 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-1686267996 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1686267996| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1686267996| ~a$w_buff0_used~0_In-1686267996)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1686267996, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1686267996} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1686267996, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1686267996, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1686267996|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 20:03:05,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In1267058049 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In1267058049 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1267058049 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1267058049 256)))) (or (and (= ~a$w_buff1_used~0_In1267058049 |P1Thread1of1ForFork2_#t~ite12_Out1267058049|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1267058049|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1267058049, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1267058049, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1267058049, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1267058049} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1267058049, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1267058049, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1267058049, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1267058049|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1267058049} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 20:03:05,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In127247595 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In127247595 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out127247595|) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out127247595| ~a$r_buff0_thd2~0_In127247595) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In127247595, ~a$w_buff0_used~0=~a$w_buff0_used~0_In127247595} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In127247595, ~a$w_buff0_used~0=~a$w_buff0_used~0_In127247595, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out127247595|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 20:03:05,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In959154257 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In959154257 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In959154257 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In959154257 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out959154257|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out959154257| ~a$r_buff1_thd2~0_In959154257) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In959154257, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In959154257, ~a$w_buff0_used~0=~a$w_buff0_used~0_In959154257, ~a$w_buff1_used~0=~a$w_buff1_used~0_In959154257} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In959154257, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In959154257, ~a$w_buff0_used~0=~a$w_buff0_used~0_In959154257, ~a$w_buff1_used~0=~a$w_buff1_used~0_In959154257, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out959154257|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 20:03:05,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L780-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 20:03:05,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L839-1-->L845: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:03:05,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L845-2-->L845-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In257458210 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In257458210 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out257458210| ~a~0_In257458210) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out257458210| ~a$w_buff1~0_In257458210) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In257458210, ~a$w_buff1~0=~a$w_buff1~0_In257458210, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In257458210, ~a$w_buff1_used~0=~a$w_buff1_used~0_In257458210} OutVars{~a~0=~a~0_In257458210, ~a$w_buff1~0=~a$w_buff1~0_In257458210, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out257458210|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In257458210, ~a$w_buff1_used~0=~a$w_buff1_used~0_In257458210} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 20:03:05,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L845-4-->L846: Formula: (= v_~a~0_18 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 20:03:05,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In2096450832 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In2096450832 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out2096450832| ~a$w_buff0_used~0_In2096450832) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out2096450832| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2096450832, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2096450832} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In2096450832, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out2096450832|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2096450832} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 20:03:05,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-1894851109 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-1894851109 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-1894851109 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-1894851109 256)))) (or (and (= ~a$w_buff1_used~0_In-1894851109 |ULTIMATE.start_main_#t~ite50_Out-1894851109|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1894851109|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1894851109, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1894851109, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1894851109, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1894851109} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1894851109|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1894851109, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1894851109, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1894851109, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1894851109} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 20:03:05,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In629337767 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In629337767 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out629337767|)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In629337767 |ULTIMATE.start_main_#t~ite51_Out629337767|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In629337767, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In629337767} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out629337767|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In629337767, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In629337767} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 20:03:05,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L849-->L849-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In56772445 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In56772445 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In56772445 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In56772445 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out56772445| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In56772445 |ULTIMATE.start_main_#t~ite52_Out56772445|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In56772445, ~a$w_buff0_used~0=~a$w_buff0_used~0_In56772445, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In56772445, ~a$w_buff1_used~0=~a$w_buff1_used~0_In56772445} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out56772445|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In56772445, ~a$w_buff0_used~0=~a$w_buff0_used~0_In56772445, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In56772445, ~a$w_buff1_used~0=~a$w_buff1_used~0_In56772445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 20:03:05,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= v_~x~0_10 2) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~__unbuffered_p2_EBX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_14| v_~a$r_buff1_thd0~0_15) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_10} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:03:05,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:03:05 BasicIcfg [2019-12-27 20:03:05,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:03:05,148 INFO L168 Benchmark]: Toolchain (without parser) took 129357.49 ms. Allocated memory was 144.7 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 100.9 MB in the beginning and 1.1 GB in the end (delta: -973.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 20:03:05,148 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 144.7 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 20:03:05,149 INFO L168 Benchmark]: CACSL2BoogieTranslator took 863.47 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 155.4 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:05,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.03 ms. Allocated memory is still 201.9 MB. Free memory was 155.4 MB in the beginning and 152.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:05,150 INFO L168 Benchmark]: Boogie Preprocessor took 42.51 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 149.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:05,150 INFO L168 Benchmark]: RCFGBuilder took 789.50 ms. Allocated memory is still 201.9 MB. Free memory was 149.6 MB in the beginning and 99.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:05,151 INFO L168 Benchmark]: TraceAbstraction took 127586.33 ms. Allocated memory was 201.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 98.8 MB in the beginning and 1.1 GB in the end (delta: -975.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 20:03:05,153 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.15 ms. Allocated memory is still 144.7 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 863.47 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 155.4 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.03 ms. Allocated memory is still 201.9 MB. Free memory was 155.4 MB in the beginning and 152.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.51 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 149.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 789.50 ms. Allocated memory is still 201.9 MB. Free memory was 149.6 MB in the beginning and 99.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 127586.33 ms. Allocated memory was 201.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 98.8 MB in the beginning and 1.1 GB in the end (delta: -975.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 178 ProgramPointsBefore, 96 ProgramPointsAfterwards, 215 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 7327 VarBasedMoverChecksPositive, 212 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 94688 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t287, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t288, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 2 x = 2 [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y [L773] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L839] FCALL, FORK 0 pthread_create(&t289, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L790] 3 z = 1 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=2, y=1, z=1] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L812] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L845] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 127.2s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 43.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7498 SDtfs, 14013 SDslu, 31513 SDs, 0 SdLazy, 17388 SolverSat, 673 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 695 GetRequests, 170 SyntacticMatches, 86 SemanticMatches, 439 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4718 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167419occurred 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: 42.7s AutomataMinimizationTime, 27 MinimizatonAttempts, 396154 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1379 NumberOfCodeBlocks, 1379 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1285 ConstructedInterpolants, 0 QuantifiedInterpolants, 248591 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...