/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/safe010_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:22:52,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:22:52,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:22:52,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:22:52,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:22:52,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:22:52,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:22:52,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:22:52,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:22:52,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:22:52,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:22:52,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:22:52,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:22:52,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:22:52,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:22:52,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:22:52,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:22:52,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:22:52,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:22:52,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:22:52,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:22:52,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:22:52,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:22:52,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:22:52,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:22:52,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:22:52,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:22:52,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:22:52,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:22:52,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:22:52,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:22:52,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:22:52,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:22:52,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:22:52,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:22:52,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:22:52,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:22:52,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:22:52,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:22:52,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:22:52,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:22:52,587 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 22:22:52,602 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:22:52,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:22:52,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:22:52,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:22:52,604 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:22:52,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:22:52,604 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:22:52,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:22:52,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:22:52,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:22:52,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:22:52,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:22:52,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:22:52,606 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:22:52,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:22:52,606 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:22:52,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:22:52,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:22:52,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:22:52,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:22:52,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:22:52,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:22:52,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:22:52,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:22:52,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:22:52,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:22:52,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:22:52,609 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:22:52,609 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:22:52,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:22:52,609 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:22:52,610 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:22:52,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:22:52,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:22:52,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:22:52,925 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:22:52,925 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:22:52,926 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2019-12-27 22:22:52,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de2b6f13/c5fc1171d92e4d05a058b6b804ce4ee7/FLAG4453cea2c [2019-12-27 22:22:53,590 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:22:53,591 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2019-12-27 22:22:53,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de2b6f13/c5fc1171d92e4d05a058b6b804ce4ee7/FLAG4453cea2c [2019-12-27 22:22:53,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de2b6f13/c5fc1171d92e4d05a058b6b804ce4ee7 [2019-12-27 22:22:53,865 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:22:53,867 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:22:53,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:22:53,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:22:53,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:22:53,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:22:53" (1/1) ... [2019-12-27 22:22:53,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1562cfed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:53, skipping insertion in model container [2019-12-27 22:22:53,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:22:53" (1/1) ... [2019-12-27 22:22:53,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:22:53,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:22:54,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:22:54,456 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:22:54,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:22:54,635 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:22:54,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:54 WrapperNode [2019-12-27 22:22:54,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:22:54,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:22:54,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:22:54,639 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:22:54,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:54" (1/1) ... [2019-12-27 22:22:54,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:54" (1/1) ... [2019-12-27 22:22:54,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:22:54,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:22:54,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:22:54,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:22:54,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:54" (1/1) ... [2019-12-27 22:22:54,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:54" (1/1) ... [2019-12-27 22:22:54,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:54" (1/1) ... [2019-12-27 22:22:54,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:54" (1/1) ... [2019-12-27 22:22:54,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:54" (1/1) ... [2019-12-27 22:22:54,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:54" (1/1) ... [2019-12-27 22:22:54,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:54" (1/1) ... [2019-12-27 22:22:54,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:22:54,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:22:54,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:22:54,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:22:54,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:54" (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 22:22:54,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:22:54,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:22:54,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:22:54,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:22:54,813 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:22:54,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:22:54,813 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:22:54,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:22:54,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:22:54,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:22:54,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:22:54,816 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 22:22:55,568 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:22:55,569 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:22:55,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:22:55 BoogieIcfgContainer [2019-12-27 22:22:55,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:22:55,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:22:55,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:22:55,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:22:55,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:22:53" (1/3) ... [2019-12-27 22:22:55,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c01a536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:22:55, skipping insertion in model container [2019-12-27 22:22:55,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:54" (2/3) ... [2019-12-27 22:22:55,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c01a536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:22:55, skipping insertion in model container [2019-12-27 22:22:55,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:22:55" (3/3) ... [2019-12-27 22:22:55,579 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_pso.oepc.i [2019-12-27 22:22:55,589 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:22:55,589 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:22:55,597 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:22:55,598 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:22:55,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,642 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,643 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,651 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,651 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,664 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,665 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,665 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,668 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,669 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:55,686 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 22:22:55,707 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:22:55,707 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:22:55,707 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:22:55,708 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:22:55,708 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:22:55,708 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:22:55,708 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:22:55,708 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:22:55,726 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 22:22:55,728 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 22:22:55,834 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 22:22:55,835 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:22:55,847 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 22:22:55,864 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 22:22:55,907 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 22:22:55,907 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:22:55,912 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 22:22:55,925 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 22:22:55,926 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:22:58,645 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-27 22:22:59,151 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 22:22:59,262 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 22:22:59,285 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54561 [2019-12-27 22:22:59,286 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 22:22:59,289 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 22:22:59,815 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-27 22:22:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-27 22:22:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:22:59,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:59,823 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:22:59,824 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:59,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:59,829 INFO L82 PathProgramCache]: Analyzing trace with hash 719045, now seen corresponding path program 1 times [2019-12-27 22:22:59,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:59,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581329155] [2019-12-27 22:22:59,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:00,044 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 22:23:00,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581329155] [2019-12-27 22:23:00,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:00,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:23:00,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2031387227] [2019-12-27 22:23:00,048 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:00,053 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:00,068 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:23:00,068 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:00,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:00,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:23:00,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:00,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:23:00,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:00,093 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-27 22:23:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:00,504 INFO L93 Difference]: Finished difference Result 9432 states and 30962 transitions. [2019-12-27 22:23:00,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:23:00,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:23:00,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:00,627 INFO L225 Difference]: With dead ends: 9432 [2019-12-27 22:23:00,628 INFO L226 Difference]: Without dead ends: 9250 [2019-12-27 22:23:00,635 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 22:23:00,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9250 states. [2019-12-27 22:23:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9250 to 9250. [2019-12-27 22:23:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9250 states. [2019-12-27 22:23:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9250 states to 9250 states and 30402 transitions. [2019-12-27 22:23:01,085 INFO L78 Accepts]: Start accepts. Automaton has 9250 states and 30402 transitions. Word has length 3 [2019-12-27 22:23:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:01,086 INFO L462 AbstractCegarLoop]: Abstraction has 9250 states and 30402 transitions. [2019-12-27 22:23:01,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:23:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 9250 states and 30402 transitions. [2019-12-27 22:23:01,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:23:01,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:01,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:01,090 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:01,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:01,090 INFO L82 PathProgramCache]: Analyzing trace with hash 616626766, now seen corresponding path program 1 times [2019-12-27 22:23:01,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:01,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939458673] [2019-12-27 22:23:01,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:01,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939458673] [2019-12-27 22:23:01,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:01,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:23:01,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1566903688] [2019-12-27 22:23:01,223 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:01,225 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:01,227 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:23:01,228 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:01,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:01,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:23:01,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:01,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:23:01,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:23:01,232 INFO L87 Difference]: Start difference. First operand 9250 states and 30402 transitions. Second operand 4 states. [2019-12-27 22:23:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:01,936 INFO L93 Difference]: Finished difference Result 14408 states and 45299 transitions. [2019-12-27 22:23:01,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:23:01,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:23:01,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:02,030 INFO L225 Difference]: With dead ends: 14408 [2019-12-27 22:23:02,030 INFO L226 Difference]: Without dead ends: 14401 [2019-12-27 22:23:02,033 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 22:23:02,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14401 states. [2019-12-27 22:23:02,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14401 to 13161. [2019-12-27 22:23:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13161 states. [2019-12-27 22:23:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13161 states to 13161 states and 42025 transitions. [2019-12-27 22:23:02,599 INFO L78 Accepts]: Start accepts. Automaton has 13161 states and 42025 transitions. Word has length 11 [2019-12-27 22:23:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:02,601 INFO L462 AbstractCegarLoop]: Abstraction has 13161 states and 42025 transitions. [2019-12-27 22:23:02,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:23:02,601 INFO L276 IsEmpty]: Start isEmpty. Operand 13161 states and 42025 transitions. [2019-12-27 22:23:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:23:02,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:02,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:02,605 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:02,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:02,605 INFO L82 PathProgramCache]: Analyzing trace with hash -887269812, now seen corresponding path program 1 times [2019-12-27 22:23:02,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:02,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71796507] [2019-12-27 22:23:02,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:03,183 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 22:23:03,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71796507] [2019-12-27 22:23:03,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:03,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:03,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1785005743] [2019-12-27 22:23:03,184 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:03,185 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:03,187 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:23:03,187 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:03,187 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:03,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:23:03,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:03,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:23:03,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:23:03,188 INFO L87 Difference]: Start difference. First operand 13161 states and 42025 transitions. Second operand 4 states. [2019-12-27 22:23:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:03,240 INFO L93 Difference]: Finished difference Result 2088 states and 4835 transitions. [2019-12-27 22:23:03,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:23:03,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:23:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:03,245 INFO L225 Difference]: With dead ends: 2088 [2019-12-27 22:23:03,245 INFO L226 Difference]: Without dead ends: 1789 [2019-12-27 22:23:03,248 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 22:23:03,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2019-12-27 22:23:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1789. [2019-12-27 22:23:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1789 states. [2019-12-27 22:23:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 4015 transitions. [2019-12-27 22:23:03,299 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 4015 transitions. Word has length 11 [2019-12-27 22:23:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:03,300 INFO L462 AbstractCegarLoop]: Abstraction has 1789 states and 4015 transitions. [2019-12-27 22:23:03,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:23:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 4015 transitions. [2019-12-27 22:23:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 22:23:03,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:03,304 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] [2019-12-27 22:23:03,304 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:03,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:03,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1372458430, now seen corresponding path program 1 times [2019-12-27 22:23:03,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:03,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860048409] [2019-12-27 22:23:03,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:03,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860048409] [2019-12-27 22:23:03,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:03,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:03,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [274296958] [2019-12-27 22:23:03,435 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:03,440 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:03,444 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 22:23:03,445 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:03,445 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:03,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:03,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:03,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:03,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:03,447 INFO L87 Difference]: Start difference. First operand 1789 states and 4015 transitions. Second operand 5 states. [2019-12-27 22:23:03,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:03,802 INFO L93 Difference]: Finished difference Result 2214 states and 4836 transitions. [2019-12-27 22:23:03,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:23:03,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 22:23:03,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:03,807 INFO L225 Difference]: With dead ends: 2214 [2019-12-27 22:23:03,808 INFO L226 Difference]: Without dead ends: 2214 [2019-12-27 22:23:03,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:23:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2019-12-27 22:23:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2001. [2019-12-27 22:23:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-12-27 22:23:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 4425 transitions. [2019-12-27 22:23:03,853 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 4425 transitions. Word has length 23 [2019-12-27 22:23:03,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:03,853 INFO L462 AbstractCegarLoop]: Abstraction has 2001 states and 4425 transitions. [2019-12-27 22:23:03,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:03,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 4425 transitions. [2019-12-27 22:23:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:23:03,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:03,857 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] [2019-12-27 22:23:03,857 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:03,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:03,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1265331362, now seen corresponding path program 1 times [2019-12-27 22:23:03,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:03,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650346717] [2019-12-27 22:23:03,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:03,918 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 22:23:03,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650346717] [2019-12-27 22:23:03,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:03,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:03,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [306502222] [2019-12-27 22:23:03,919 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:03,928 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:03,939 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-27 22:23:03,939 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:03,940 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:03,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:23:03,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:03,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:23:03,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:03,941 INFO L87 Difference]: Start difference. First operand 2001 states and 4425 transitions. Second operand 3 states. [2019-12-27 22:23:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:03,992 INFO L93 Difference]: Finished difference Result 2364 states and 5151 transitions. [2019-12-27 22:23:03,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:23:03,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-27 22:23:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:03,999 INFO L225 Difference]: With dead ends: 2364 [2019-12-27 22:23:03,999 INFO L226 Difference]: Without dead ends: 2364 [2019-12-27 22:23:03,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2019-12-27 22:23:04,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2145. [2019-12-27 22:23:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2019-12-27 22:23:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 4722 transitions. [2019-12-27 22:23:04,043 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 4722 transitions. Word has length 37 [2019-12-27 22:23:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:04,044 INFO L462 AbstractCegarLoop]: Abstraction has 2145 states and 4722 transitions. [2019-12-27 22:23:04,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:23:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 4722 transitions. [2019-12-27 22:23:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:23:04,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:04,050 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] [2019-12-27 22:23:04,050 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:04,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:04,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1265486951, now seen corresponding path program 1 times [2019-12-27 22:23:04,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:04,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734453658] [2019-12-27 22:23:04,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:04,202 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 22:23:04,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734453658] [2019-12-27 22:23:04,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:04,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:23:04,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1365350382] [2019-12-27 22:23:04,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:04,213 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:04,225 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-27 22:23:04,226 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:04,226 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:04,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:04,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:04,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:04,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:04,228 INFO L87 Difference]: Start difference. First operand 2145 states and 4722 transitions. Second operand 5 states. [2019-12-27 22:23:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:04,283 INFO L93 Difference]: Finished difference Result 443 states and 801 transitions. [2019-12-27 22:23:04,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:23:04,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 22:23:04,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:04,285 INFO L225 Difference]: With dead ends: 443 [2019-12-27 22:23:04,285 INFO L226 Difference]: Without dead ends: 372 [2019-12-27 22:23:04,286 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 22:23:04,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-27 22:23:04,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 344. [2019-12-27 22:23:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 22:23:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 620 transitions. [2019-12-27 22:23:04,294 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 620 transitions. Word has length 37 [2019-12-27 22:23:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:04,294 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 620 transitions. [2019-12-27 22:23:04,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 620 transitions. [2019-12-27 22:23:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 22:23:04,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:04,296 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] [2019-12-27 22:23:04,297 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:04,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash -723762532, now seen corresponding path program 1 times [2019-12-27 22:23:04,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:04,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71306660] [2019-12-27 22:23:04,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:04,384 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 22:23:04,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71306660] [2019-12-27 22:23:04,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:04,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:23:04,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1792626356] [2019-12-27 22:23:04,385 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:04,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:04,441 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 112 transitions. [2019-12-27 22:23:04,441 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:04,460 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:23:04,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:04,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:04,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:04,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:04,461 INFO L87 Difference]: Start difference. First operand 344 states and 620 transitions. Second operand 5 states. [2019-12-27 22:23:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:04,629 INFO L93 Difference]: Finished difference Result 439 states and 767 transitions. [2019-12-27 22:23:04,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:23:04,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 22:23:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:04,631 INFO L225 Difference]: With dead ends: 439 [2019-12-27 22:23:04,631 INFO L226 Difference]: Without dead ends: 439 [2019-12-27 22:23:04,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:23:04,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-12-27 22:23:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 332. [2019-12-27 22:23:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 22:23:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 584 transitions. [2019-12-27 22:23:04,652 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 584 transitions. Word has length 52 [2019-12-27 22:23:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:04,653 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 584 transitions. [2019-12-27 22:23:04,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 584 transitions. [2019-12-27 22:23:04,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 22:23:04,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:04,657 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] [2019-12-27 22:23:04,657 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:04,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:04,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2146679471, now seen corresponding path program 1 times [2019-12-27 22:23:04,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:04,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790643402] [2019-12-27 22:23:04,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:04,806 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 22:23:04,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790643402] [2019-12-27 22:23:04,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:04,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:23:04,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1505894034] [2019-12-27 22:23:04,807 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:04,826 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:04,856 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 73 transitions. [2019-12-27 22:23:04,857 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:04,862 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:23:04,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:04,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:04,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:04,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:04,864 INFO L87 Difference]: Start difference. First operand 332 states and 584 transitions. Second operand 5 states. [2019-12-27 22:23:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:05,050 INFO L93 Difference]: Finished difference Result 488 states and 866 transitions. [2019-12-27 22:23:05,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:23:05,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 22:23:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:05,054 INFO L225 Difference]: With dead ends: 488 [2019-12-27 22:23:05,054 INFO L226 Difference]: Without dead ends: 488 [2019-12-27 22:23:05,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:23:05,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-27 22:23:05,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 423. [2019-12-27 22:23:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-27 22:23:05,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 750 transitions. [2019-12-27 22:23:05,068 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 750 transitions. Word has length 53 [2019-12-27 22:23:05,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:05,069 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 750 transitions. [2019-12-27 22:23:05,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:05,069 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 750 transitions. [2019-12-27 22:23:05,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 22:23:05,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:05,072 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] [2019-12-27 22:23:05,072 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:05,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:05,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1496527321, now seen corresponding path program 2 times [2019-12-27 22:23:05,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:05,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037402553] [2019-12-27 22:23:05,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:05,246 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 22:23:05,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037402553] [2019-12-27 22:23:05,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:05,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:23:05,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1587876365] [2019-12-27 22:23:05,248 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:05,266 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:05,299 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 89 transitions. [2019-12-27 22:23:05,299 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:05,301 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:05,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:23:05,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:05,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:23:05,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:05,302 INFO L87 Difference]: Start difference. First operand 423 states and 750 transitions. Second operand 3 states. [2019-12-27 22:23:05,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:05,362 INFO L93 Difference]: Finished difference Result 423 states and 749 transitions. [2019-12-27 22:23:05,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:23:05,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 22:23:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:05,365 INFO L225 Difference]: With dead ends: 423 [2019-12-27 22:23:05,365 INFO L226 Difference]: Without dead ends: 423 [2019-12-27 22:23:05,365 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 22:23:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-12-27 22:23:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 332. [2019-12-27 22:23:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 22:23:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 583 transitions. [2019-12-27 22:23:05,385 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 583 transitions. Word has length 53 [2019-12-27 22:23:05,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:05,386 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 583 transitions. [2019-12-27 22:23:05,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:23:05,386 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 583 transitions. [2019-12-27 22:23:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:23:05,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:05,387 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] [2019-12-27 22:23:05,387 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:05,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:05,388 INFO L82 PathProgramCache]: Analyzing trace with hash -826251112, now seen corresponding path program 1 times [2019-12-27 22:23:05,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:05,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839297054] [2019-12-27 22:23:05,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:05,494 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 22:23:05,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839297054] [2019-12-27 22:23:05,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:05,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:23:05,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2134180933] [2019-12-27 22:23:05,495 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:05,513 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:05,539 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 74 transitions. [2019-12-27 22:23:05,539 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:05,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:05,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:23:05,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:05,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:23:05,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:23:05,541 INFO L87 Difference]: Start difference. First operand 332 states and 583 transitions. Second operand 6 states. [2019-12-27 22:23:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:05,602 INFO L93 Difference]: Finished difference Result 512 states and 897 transitions. [2019-12-27 22:23:05,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:23:05,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 22:23:05,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:05,603 INFO L225 Difference]: With dead ends: 512 [2019-12-27 22:23:05,603 INFO L226 Difference]: Without dead ends: 222 [2019-12-27 22:23:05,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:23:05,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-27 22:23:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2019-12-27 22:23:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-27 22:23:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 393 transitions. [2019-12-27 22:23:05,609 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 393 transitions. Word has length 54 [2019-12-27 22:23:05,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:05,609 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 393 transitions. [2019-12-27 22:23:05,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:23:05,609 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 393 transitions. [2019-12-27 22:23:05,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:23:05,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:05,610 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] [2019-12-27 22:23:05,610 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:05,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:05,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2130111720, now seen corresponding path program 2 times [2019-12-27 22:23:05,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:05,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692922552] [2019-12-27 22:23:05,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:05,828 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 22:23:05,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692922552] [2019-12-27 22:23:05,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:05,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:23:05,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1319998242] [2019-12-27 22:23:05,830 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:05,848 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:05,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 115 transitions. [2019-12-27 22:23:05,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:06,028 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:23:06,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:23:06,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:06,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:23:06,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:23:06,030 INFO L87 Difference]: Start difference. First operand 222 states and 393 transitions. Second operand 15 states. [2019-12-27 22:23:07,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:07,971 INFO L93 Difference]: Finished difference Result 568 states and 964 transitions. [2019-12-27 22:23:07,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 22:23:07,971 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-27 22:23:07,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:07,974 INFO L225 Difference]: With dead ends: 568 [2019-12-27 22:23:07,974 INFO L226 Difference]: Without dead ends: 534 [2019-12-27 22:23:07,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=267, Invalid=1293, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 22:23:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-12-27 22:23:07,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 322. [2019-12-27 22:23:07,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 22:23:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 564 transitions. [2019-12-27 22:23:07,983 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 564 transitions. Word has length 54 [2019-12-27 22:23:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:07,984 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 564 transitions. [2019-12-27 22:23:07,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:23:07,984 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 564 transitions. [2019-12-27 22:23:07,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:23:07,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:07,985 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] [2019-12-27 22:23:07,985 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:07,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:07,986 INFO L82 PathProgramCache]: Analyzing trace with hash -688648962, now seen corresponding path program 3 times [2019-12-27 22:23:07,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:07,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634433166] [2019-12-27 22:23:07,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:08,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634433166] [2019-12-27 22:23:08,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:08,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 22:23:08,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2004451617] [2019-12-27 22:23:08,213 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:08,233 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:08,268 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 114 transitions. [2019-12-27 22:23:08,268 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:08,322 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:23:08,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 22:23:08,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:08,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 22:23:08,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:23:08,324 INFO L87 Difference]: Start difference. First operand 322 states and 564 transitions. Second operand 14 states. [2019-12-27 22:23:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:08,648 INFO L93 Difference]: Finished difference Result 426 states and 720 transitions. [2019-12-27 22:23:08,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:23:08,648 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 22:23:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:08,649 INFO L225 Difference]: With dead ends: 426 [2019-12-27 22:23:08,650 INFO L226 Difference]: Without dead ends: 392 [2019-12-27 22:23:08,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:23:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-12-27 22:23:08,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 330. [2019-12-27 22:23:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-27 22:23:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 578 transitions. [2019-12-27 22:23:08,661 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 578 transitions. Word has length 54 [2019-12-27 22:23:08,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:08,661 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 578 transitions. [2019-12-27 22:23:08,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 22:23:08,662 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 578 transitions. [2019-12-27 22:23:08,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:23:08,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:08,666 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] [2019-12-27 22:23:08,666 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:08,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:08,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1187524996, now seen corresponding path program 4 times [2019-12-27 22:23:08,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:08,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656336221] [2019-12-27 22:23:08,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:23:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:23:08,866 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:23:08,866 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:23:08,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= v_~x~0_11 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2013~0.base_24|)) (= |v_ULTIMATE.start_main_~#t2013~0.offset_19| 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~y$r_buff1_thd1~0_20) (= v_~y$read_delayed~0_7 0) (= |v_#NULL.offset_3| 0) (= v_~main$tmp_guard0~0_12 0) (= 0 v_~y$w_buff1~0_25) (= v_~y$w_buff0_used~0_103 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2013~0.base_24| 1)) (= v_~y~0_29 0) (= 0 v_~y$r_buff1_thd0~0_50) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2013~0.base_24| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2013~0.base_24|) |v_ULTIMATE.start_main_~#t2013~0.offset_19| 0)) |v_#memory_int_9|) (= 0 v_~y$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2013~0.base_24|) (= 0 v_~weak$$choice2~0_35) (= 0 v_~y$r_buff1_thd2~0_17) (= v_~y$mem_tmp~0_12 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2013~0.base_24| 4) |v_#length_11|) (= 0 |v_#NULL.base_3|) (= v_~y$w_buff1_used~0_66 0) (= v_~y$r_buff0_thd1~0_27 0) (= v_~main$tmp_guard1~0_13 0) (= v_~y$r_buff0_thd2~0_21 0) (= v_~y$r_buff0_thd0~0_76 0) (= 0 v_~y$flush_delayed~0_17) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_18|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_14|, ULTIMATE.start_main_~#t2014~0.base=|v_ULTIMATE.start_main_~#t2014~0.base_20|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_27, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, #length=|v_#length_11|, ULTIMATE.start_main_~#t2014~0.offset=|v_ULTIMATE.start_main_~#t2014~0.offset_17|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_15|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_10|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_17|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_17|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t2013~0.offset=|v_ULTIMATE.start_main_~#t2013~0.offset_19|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_50, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_17|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_14|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_16|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_12|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y~0=v_~y~0_29, ULTIMATE.start_main_~#t2013~0.base=|v_ULTIMATE.start_main_~#t2013~0.base_24|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_14|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_10|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_17|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_~#t2014~0.base, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2014~0.offset, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2013~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t2013~0.base, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:23:08,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L779-1-->L781: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2014~0.base_11|)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2014~0.base_11| 1) |v_#valid_27|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2014~0.base_11|) 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2014~0.base_11| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t2014~0.offset_10| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2014~0.base_11|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2014~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2014~0.base_11|) |v_ULTIMATE.start_main_~#t2014~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2014~0.offset=|v_ULTIMATE.start_main_~#t2014~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2014~0.base=|v_ULTIMATE.start_main_~#t2014~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2014~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2014~0.base] because there is no mapped edge [2019-12-27 22:23:08,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_57 256) 0) (= 2 v_~y$w_buff0~0_16) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_16) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 1 v_~y$w_buff0_used~0_91) (= v_~y$w_buff1_used~0_57 v_~y$w_buff0_used~0_92) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_91, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:23:08,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2014520948 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2014520948 256)))) (or (and (= ~y$w_buff1~0_In-2014520948 |P1Thread1of1ForFork1_#t~ite9_Out-2014520948|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-2014520948 |P1Thread1of1ForFork1_#t~ite9_Out-2014520948|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2014520948, ~y$w_buff1~0=~y$w_buff1~0_In-2014520948, ~y~0=~y~0_In-2014520948, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2014520948} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2014520948, ~y$w_buff1~0=~y$w_buff1~0_In-2014520948, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-2014520948|, ~y~0=~y~0_In-2014520948, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2014520948} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 22:23:08,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_19) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 22:23:08,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1207229583 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1207229583 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1207229583 |P1Thread1of1ForFork1_#t~ite11_Out1207229583|)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out1207229583| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1207229583, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1207229583} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1207229583, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1207229583, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1207229583|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:23:08,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-929363642 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-929363642 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-929363642 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-929363642 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-929363642| ~y$w_buff1_used~0_In-929363642) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite12_Out-929363642| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-929363642, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-929363642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-929363642, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-929363642} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-929363642, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-929363642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-929363642, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-929363642|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-929363642} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:23:08,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1388777663 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1388777663 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1388777663| 0)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1388777663| ~y$r_buff0_thd2~0_In-1388777663) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1388777663, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1388777663} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1388777663, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1388777663, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1388777663|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:23:08,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-1544090619 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1544090619 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1544090619 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1544090619 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1544090619|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In-1544090619 |P1Thread1of1ForFork1_#t~ite14_Out-1544090619|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1544090619, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1544090619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1544090619, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1544090619} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1544090619, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1544090619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1544090619, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1544090619|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1544090619} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:23:08,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:23:08,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-38247791 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-38247791 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-38247791|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-38247791 |P0Thread1of1ForFork0_#t~ite5_Out-38247791|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-38247791, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-38247791} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-38247791|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-38247791, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-38247791} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:23:08,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-492423369 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-492423369 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-492423369 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-492423369 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-492423369| 0)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-492423369 |P0Thread1of1ForFork0_#t~ite6_Out-492423369|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-492423369, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-492423369, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-492423369, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-492423369} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-492423369|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-492423369, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-492423369, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-492423369, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-492423369} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:23:08,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1366919632 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1366919632 256)))) (or (and (= ~y$r_buff0_thd1~0_In-1366919632 ~y$r_buff0_thd1~0_Out-1366919632) (or .cse0 .cse1)) (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-1366919632 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1366919632, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1366919632} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1366919632, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1366919632|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1366919632} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:23:08,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-669255580 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-669255580 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-669255580 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-669255580 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-669255580| ~y$r_buff1_thd1~0_In-669255580) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-669255580| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-669255580, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-669255580, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-669255580, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-669255580} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-669255580, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-669255580, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-669255580|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-669255580, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-669255580} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:23:08,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:23:08,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:23:08,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1441557505 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1441557505 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite17_Out1441557505| |ULTIMATE.start_main_#t~ite18_Out1441557505|))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite17_Out1441557505| ~y~0_In1441557505)) (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite17_Out1441557505| ~y$w_buff1~0_In1441557505)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1441557505, ~y~0=~y~0_In1441557505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1441557505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1441557505} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1441557505|, ~y$w_buff1~0=~y$w_buff1~0_In1441557505, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1441557505|, ~y~0=~y~0_In1441557505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1441557505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1441557505} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 22:23:08,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1644098751 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1644098751 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-1644098751| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite19_Out-1644098751| ~y$w_buff0_used~0_In-1644098751) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1644098751, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1644098751} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1644098751, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1644098751|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1644098751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 22:23:08,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In1920108306 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1920108306 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1920108306 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1920108306 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out1920108306| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite20_Out1920108306| ~y$w_buff1_used~0_In1920108306) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1920108306, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1920108306, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1920108306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1920108306} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1920108306, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1920108306, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1920108306|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1920108306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1920108306} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 22:23:08,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In446552306 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In446552306 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In446552306 |ULTIMATE.start_main_#t~ite21_Out446552306|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out446552306|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In446552306, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In446552306} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In446552306, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In446552306, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out446552306|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 22:23:08,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-2129960347 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2129960347 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2129960347 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2129960347 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-2129960347 |ULTIMATE.start_main_#t~ite22_Out-2129960347|)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-2129960347|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2129960347, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2129960347, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2129960347, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2129960347} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2129960347, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2129960347, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2129960347, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2129960347|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2129960347} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 22:23:08,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L800-->L800-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-2139028039 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2139028039 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-2139028039 256))) (and (= (mod ~y$r_buff1_thd0~0_In-2139028039 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In-2139028039 256) 0))) .cse1 (= ~y$w_buff1~0_In-2139028039 |ULTIMATE.start_main_#t~ite31_Out-2139028039|) (= |ULTIMATE.start_main_#t~ite32_Out-2139028039| |ULTIMATE.start_main_#t~ite31_Out-2139028039|)) (and (= ~y$w_buff1~0_In-2139028039 |ULTIMATE.start_main_#t~ite32_Out-2139028039|) (= |ULTIMATE.start_main_#t~ite31_In-2139028039| |ULTIMATE.start_main_#t~ite31_Out-2139028039|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2139028039, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139028039, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2139028039, ~weak$$choice2~0=~weak$$choice2~0_In-2139028039, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-2139028039|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2139028039, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2139028039} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-2139028039, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139028039, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2139028039, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-2139028039|, ~weak$$choice2~0=~weak$$choice2~0_In-2139028039, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-2139028039|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2139028039, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2139028039} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 22:23:08,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_66 v_~y$r_buff0_thd0~0_65)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 22:23:08,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_23 v_~y$mem_tmp~0_7) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:23:08,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:23:08,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:23:08 BasicIcfg [2019-12-27 22:23:08,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:23:08,984 INFO L168 Benchmark]: Toolchain (without parser) took 15117.35 ms. Allocated memory was 136.8 MB in the beginning and 590.3 MB in the end (delta: 453.5 MB). Free memory was 100.2 MB in the beginning and 178.3 MB in the end (delta: -78.1 MB). Peak memory consumption was 375.4 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:08,987 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 22:23:08,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.87 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 100.0 MB in the beginning and 154.6 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:08,988 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.67 ms. Allocated memory is still 200.3 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:08,989 INFO L168 Benchmark]: Boogie Preprocessor took 44.12 ms. Allocated memory is still 200.3 MB. Free memory was 151.8 MB in the beginning and 149.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:08,990 INFO L168 Benchmark]: RCFGBuilder took 824.37 ms. Allocated memory is still 200.3 MB. Free memory was 149.0 MB in the beginning and 105.2 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:08,990 INFO L168 Benchmark]: TraceAbstraction took 13409.81 ms. Allocated memory was 200.3 MB in the beginning and 590.3 MB in the end (delta: 390.1 MB). Free memory was 104.5 MB in the beginning and 178.3 MB in the end (delta: -73.8 MB). Peak memory consumption was 316.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:08,994 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.87 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 100.0 MB in the beginning and 154.6 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.67 ms. Allocated memory is still 200.3 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.12 ms. Allocated memory is still 200.3 MB. Free memory was 151.8 MB in the beginning and 149.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 824.37 ms. Allocated memory is still 200.3 MB. Free memory was 149.0 MB in the beginning and 105.2 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13409.81 ms. Allocated memory was 200.3 MB in the beginning and 590.3 MB in the end (delta: 390.1 MB). Free memory was 104.5 MB in the beginning and 178.3 MB in the end (delta: -73.8 MB). Peak memory consumption was 316.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 146 ProgramPointsBefore, 81 ProgramPointsAfterwards, 180 TransitionsBefore, 94 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 8 FixpointIterations, 28 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 24 ChoiceCompositions, 3312 VarBasedMoverChecksPositive, 143 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54561 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1282 SDtfs, 1266 SDslu, 3086 SDs, 0 SdLazy, 1564 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13161occurred 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: 1.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 2237 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 430 ConstructedInterpolants, 0 QuantifiedInterpolants, 95881 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...