/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 22:56:06,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 22:56:06,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 22:56:06,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 22:56:06,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 22:56:06,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 22:56:06,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 22:56:06,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 22:56:06,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 22:56:06,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 22:56:06,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 22:56:06,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 22:56:06,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 22:56:06,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 22:56:06,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 22:56:06,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 22:56:06,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 22:56:06,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 22:56:06,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 22:56:06,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 22:56:06,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 22:56:06,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 22:56:06,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 22:56:06,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 22:56:06,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 22:56:06,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 22:56:06,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 22:56:06,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 22:56:06,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 22:56:06,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 22:56:06,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 22:56:06,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 22:56:06,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 22:56:06,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 22:56:06,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 22:56:06,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 22:56:06,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 22:56:06,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 22:56:06,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 22:56:06,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 22:56:06,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 22:56:06,491 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 22:56:06,515 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 22:56:06,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 22:56:06,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 22:56:06,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 22:56:06,517 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 22:56:06,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 22:56:06,517 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 22:56:06,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 22:56:06,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 22:56:06,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 22:56:06,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 22:56:06,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 22:56:06,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 22:56:06,519 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 22:56:06,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 22:56:06,519 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 22:56:06,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 22:56:06,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 22:56:06,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 22:56:06,520 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 22:56:06,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 22:56:06,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 22:56:06,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 22:56:06,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 22:56:06,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 22:56:06,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 22:56:06,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 22:56:06,522 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 22:56:06,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 22:56:06,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 22:56:06,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 22:56:06,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 22:56:06,839 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 22:56:06,844 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 22:56:06,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2020-10-21 22:56:06,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a5d3fb56/382c955908554f8a9846e50b6baa925c/FLAG50e872f79 [2020-10-21 22:56:07,413 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 22:56:07,414 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2020-10-21 22:56:07,451 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a5d3fb56/382c955908554f8a9846e50b6baa925c/FLAG50e872f79 [2020-10-21 22:56:07,743 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a5d3fb56/382c955908554f8a9846e50b6baa925c [2020-10-21 22:56:07,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 22:56:07,758 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 22:56:07,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 22:56:07,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 22:56:07,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 22:56:07,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:56:07" (1/1) ... [2020-10-21 22:56:07,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61977029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:56:07, skipping insertion in model container [2020-10-21 22:56:07,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:56:07" (1/1) ... [2020-10-21 22:56:07,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 22:56:07,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 22:56:08,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:56:08,525 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 22:56:08,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:56:08,691 INFO L208 MainTranslator]: Completed translation [2020-10-21 22:56:08,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:56:08 WrapperNode [2020-10-21 22:56:08,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 22:56:08,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 22:56:08,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 22:56:08,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 22:56:08,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:56:08" (1/1) ... [2020-10-21 22:56:08,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:56:08" (1/1) ... [2020-10-21 22:56:08,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 22:56:08,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 22:56:08,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 22:56:08,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 22:56:08,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:56:08" (1/1) ... [2020-10-21 22:56:08,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:56:08" (1/1) ... [2020-10-21 22:56:08,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:56:08" (1/1) ... [2020-10-21 22:56:08,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:56:08" (1/1) ... [2020-10-21 22:56:08,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:56:08" (1/1) ... [2020-10-21 22:56:08,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:56:08" (1/1) ... [2020-10-21 22:56:08,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:56:08" (1/1) ... [2020-10-21 22:56:08,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 22:56:08,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 22:56:08,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 22:56:08,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 22:56:08,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:56:08" (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 [2020-10-21 22:56:08,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 22:56:08,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 22:56:08,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 22:56:08,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 22:56:08,886 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 22:56:08,886 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 22:56:08,887 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 22:56:08,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 22:56:08,887 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 22:56:08,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 22:56:08,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 22:56:08,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 22:56:08,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 22:56:08,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 22:56:08,893 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 22:56:11,113 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 22:56:11,113 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 22:56:11,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:56:11 BoogieIcfgContainer [2020-10-21 22:56:11,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 22:56:11,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 22:56:11,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 22:56:11,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 22:56:11,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:56:07" (1/3) ... [2020-10-21 22:56:11,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d65c450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:56:11, skipping insertion in model container [2020-10-21 22:56:11,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:56:08" (2/3) ... [2020-10-21 22:56:11,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d65c450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:56:11, skipping insertion in model container [2020-10-21 22:56:11,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:56:11" (3/3) ... [2020-10-21 22:56:11,125 INFO L111 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2020-10-21 22:56:11,138 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 22:56:11,138 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 22:56:11,147 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 22:56:11,148 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 22:56:11,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,179 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,179 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,182 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,182 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,183 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,184 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,187 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,188 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,194 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,203 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,203 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,204 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,207 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,207 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:56:11,209 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 22:56:11,224 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 22:56:11,248 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 22:56:11,248 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 22:56:11,248 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 22:56:11,248 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 22:56:11,248 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 22:56:11,248 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 22:56:11,249 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 22:56:11,249 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 22:56:11,263 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 22:56:11,264 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 104 transitions, 223 flow [2020-10-21 22:56:11,267 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 104 transitions, 223 flow [2020-10-21 22:56:11,269 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 111 places, 104 transitions, 223 flow [2020-10-21 22:56:11,320 INFO L129 PetriNetUnfolder]: 3/101 cut-off events. [2020-10-21 22:56:11,320 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 22:56:11,325 INFO L80 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 3/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2020-10-21 22:56:11,329 INFO L116 LiptonReduction]: Number of co-enabled transitions 1954 [2020-10-21 22:56:12,685 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-21 22:56:12,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-21 22:56:12,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:56:12,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 22:56:12,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:56:13,900 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-21 22:56:15,192 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-21 22:56:15,346 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-21 22:56:16,559 WARN L193 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-10-21 22:56:16,842 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-21 22:56:17,771 WARN L193 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-21 22:56:18,139 WARN L193 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-21 22:56:19,588 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-21 22:56:19,956 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-21 22:56:20,353 WARN L193 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-10-21 22:56:20,559 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-21 22:56:20,590 INFO L131 LiptonReduction]: Checked pairs total: 5474 [2020-10-21 22:56:20,590 INFO L133 LiptonReduction]: Total number of compositions: 95 [2020-10-21 22:56:20,598 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 27 transitions, 69 flow [2020-10-21 22:56:20,670 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 972 states. [2020-10-21 22:56:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states. [2020-10-21 22:56:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 22:56:20,682 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:56:20,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 22:56:20,684 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:56:20,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:56:20,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1060202116, now seen corresponding path program 1 times [2020-10-21 22:56:20,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:56:20,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503288447] [2020-10-21 22:56:20,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:56:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:56:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:56:20,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503288447] [2020-10-21 22:56:20,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:56:20,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:56:20,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351093772] [2020-10-21 22:56:20,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:56:20,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:56:20,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:56:20,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:56:20,956 INFO L87 Difference]: Start difference. First operand 972 states. Second operand 3 states. [2020-10-21 22:56:21,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:56:21,066 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-21 22:56:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:56:21,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-21 22:56:21,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:56:21,095 INFO L225 Difference]: With dead ends: 812 [2020-10-21 22:56:21,095 INFO L226 Difference]: Without dead ends: 662 [2020-10-21 22:56:21,097 INFO L677 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 [2020-10-21 22:56:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-10-21 22:56:21,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2020-10-21 22:56:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2020-10-21 22:56:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2020-10-21 22:56:21,224 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 5 [2020-10-21 22:56:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:56:21,225 INFO L481 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2020-10-21 22:56:21,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:56:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2020-10-21 22:56:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 22:56:21,227 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:56:21,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:56:21,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 22:56:21,227 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:56:21,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:56:21,228 INFO L82 PathProgramCache]: Analyzing trace with hash -432294773, now seen corresponding path program 1 times [2020-10-21 22:56:21,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:56:21,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20992166] [2020-10-21 22:56:21,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:56:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:56:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:56:21,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20992166] [2020-10-21 22:56:21,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:56:21,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:56:21,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105606357] [2020-10-21 22:56:21,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:56:21,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:56:21,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:56:21,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:56:21,423 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 3 states. [2020-10-21 22:56:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:56:21,445 INFO L93 Difference]: Finished difference Result 612 states and 1880 transitions. [2020-10-21 22:56:21,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:56:21,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 22:56:21,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:56:21,452 INFO L225 Difference]: With dead ends: 612 [2020-10-21 22:56:21,452 INFO L226 Difference]: Without dead ends: 612 [2020-10-21 22:56:21,453 INFO L677 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 [2020-10-21 22:56:21,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-10-21 22:56:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2020-10-21 22:56:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-10-21 22:56:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1880 transitions. [2020-10-21 22:56:21,477 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1880 transitions. Word has length 9 [2020-10-21 22:56:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:56:21,478 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 1880 transitions. [2020-10-21 22:56:21,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:56:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1880 transitions. [2020-10-21 22:56:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:56:21,480 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:56:21,481 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:56:21,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 22:56:21,481 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:56:21,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:56:21,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1176532311, now seen corresponding path program 1 times [2020-10-21 22:56:21,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:56:21,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998124898] [2020-10-21 22:56:21,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:56:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:56:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:56:21,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998124898] [2020-10-21 22:56:21,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:56:21,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:56:21,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661491599] [2020-10-21 22:56:21,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:56:21,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:56:21,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:56:21,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:56:21,623 INFO L87 Difference]: Start difference. First operand 612 states and 1880 transitions. Second operand 4 states. [2020-10-21 22:56:21,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:56:21,694 INFO L93 Difference]: Finished difference Result 604 states and 1850 transitions. [2020-10-21 22:56:21,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:56:21,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-21 22:56:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:56:21,708 INFO L225 Difference]: With dead ends: 604 [2020-10-21 22:56:21,708 INFO L226 Difference]: Without dead ends: 604 [2020-10-21 22:56:21,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:56:21,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-10-21 22:56:21,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2020-10-21 22:56:21,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2020-10-21 22:56:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1850 transitions. [2020-10-21 22:56:21,746 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1850 transitions. Word has length 11 [2020-10-21 22:56:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:56:21,746 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 1850 transitions. [2020-10-21 22:56:21,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:56:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1850 transitions. [2020-10-21 22:56:21,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 22:56:21,753 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:56:21,753 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:56:21,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 22:56:21,756 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:56:21,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:56:21,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1348433079, now seen corresponding path program 1 times [2020-10-21 22:56:21,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:56:21,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609251759] [2020-10-21 22:56:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:56:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:56:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:56:21,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609251759] [2020-10-21 22:56:21,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:56:21,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:56:21,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769371525] [2020-10-21 22:56:21,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:56:21,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:56:21,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:56:21,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:56:21,882 INFO L87 Difference]: Start difference. First operand 604 states and 1850 transitions. Second operand 5 states. [2020-10-21 22:56:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:56:21,994 INFO L93 Difference]: Finished difference Result 620 states and 1894 transitions. [2020-10-21 22:56:21,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:56:21,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 22:56:21,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:56:22,001 INFO L225 Difference]: With dead ends: 620 [2020-10-21 22:56:22,001 INFO L226 Difference]: Without dead ends: 620 [2020-10-21 22:56:22,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:56:22,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-10-21 22:56:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2020-10-21 22:56:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2020-10-21 22:56:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1894 transitions. [2020-10-21 22:56:22,025 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1894 transitions. Word has length 12 [2020-10-21 22:56:22,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:56:22,026 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 1894 transitions. [2020-10-21 22:56:22,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:56:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1894 transitions. [2020-10-21 22:56:22,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 22:56:22,028 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:56:22,029 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:56:22,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 22:56:22,029 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:56:22,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:56:22,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1041133938, now seen corresponding path program 1 times [2020-10-21 22:56:22,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:56:22,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165315228] [2020-10-21 22:56:22,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:56:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:56:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:56:22,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165315228] [2020-10-21 22:56:22,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:56:22,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:56:22,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719702837] [2020-10-21 22:56:22,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:56:22,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:56:22,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:56:22,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:56:22,101 INFO L87 Difference]: Start difference. First operand 620 states and 1894 transitions. Second operand 4 states. [2020-10-21 22:56:22,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:56:22,182 INFO L93 Difference]: Finished difference Result 630 states and 1925 transitions. [2020-10-21 22:56:22,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:56:22,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 22:56:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:56:22,189 INFO L225 Difference]: With dead ends: 630 [2020-10-21 22:56:22,189 INFO L226 Difference]: Without dead ends: 630 [2020-10-21 22:56:22,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:56:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-10-21 22:56:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 626. [2020-10-21 22:56:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2020-10-21 22:56:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1911 transitions. [2020-10-21 22:56:22,215 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1911 transitions. Word has length 13 [2020-10-21 22:56:22,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:56:22,215 INFO L481 AbstractCegarLoop]: Abstraction has 626 states and 1911 transitions. [2020-10-21 22:56:22,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:56:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1911 transitions. [2020-10-21 22:56:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 22:56:22,217 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:56:22,217 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:56:22,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 22:56:22,217 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:56:22,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:56:22,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1156548132, now seen corresponding path program 2 times [2020-10-21 22:56:22,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:56:22,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664872150] [2020-10-21 22:56:22,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:56:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:56:22,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:56:22,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664872150] [2020-10-21 22:56:22,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:56:22,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:56:22,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665219427] [2020-10-21 22:56:22,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:56:22,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:56:22,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:56:22,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:56:22,377 INFO L87 Difference]: Start difference. First operand 626 states and 1911 transitions. Second operand 5 states. [2020-10-21 22:56:22,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:56:22,497 INFO L93 Difference]: Finished difference Result 618 states and 1884 transitions. [2020-10-21 22:56:22,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:56:22,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-21 22:56:22,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:56:22,503 INFO L225 Difference]: With dead ends: 618 [2020-10-21 22:56:22,503 INFO L226 Difference]: Without dead ends: 618 [2020-10-21 22:56:22,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:56:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-10-21 22:56:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 608. [2020-10-21 22:56:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2020-10-21 22:56:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1853 transitions. [2020-10-21 22:56:22,523 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1853 transitions. Word has length 13 [2020-10-21 22:56:22,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:56:22,524 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 1853 transitions. [2020-10-21 22:56:22,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:56:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1853 transitions. [2020-10-21 22:56:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 22:56:22,526 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:56:22,526 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:56:22,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 22:56:22,526 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:56:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:56:22,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1283231338, now seen corresponding path program 1 times [2020-10-21 22:56:22,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:56:22,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573969760] [2020-10-21 22:56:22,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:56:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:56:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:56:22,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573969760] [2020-10-21 22:56:22,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:56:22,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:56:22,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64115307] [2020-10-21 22:56:22,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:56:22,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:56:22,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:56:22,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:56:22,655 INFO L87 Difference]: Start difference. First operand 608 states and 1853 transitions. Second operand 4 states. [2020-10-21 22:56:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:56:22,688 INFO L93 Difference]: Finished difference Result 570 states and 1538 transitions. [2020-10-21 22:56:22,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:56:22,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 22:56:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:56:22,692 INFO L225 Difference]: With dead ends: 570 [2020-10-21 22:56:22,692 INFO L226 Difference]: Without dead ends: 412 [2020-10-21 22:56:22,693 INFO L677 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 [2020-10-21 22:56:22,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2020-10-21 22:56:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2020-10-21 22:56:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-10-21 22:56:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1069 transitions. [2020-10-21 22:56:22,705 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1069 transitions. Word has length 14 [2020-10-21 22:56:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:56:22,705 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 1069 transitions. [2020-10-21 22:56:22,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:56:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1069 transitions. [2020-10-21 22:56:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 22:56:22,706 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:56:22,707 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:56:22,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 22:56:22,707 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:56:22,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:56:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1797124717, now seen corresponding path program 1 times [2020-10-21 22:56:22,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:56:22,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988211742] [2020-10-21 22:56:22,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:56:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:56:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:56:22,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988211742] [2020-10-21 22:56:22,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:56:22,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:56:22,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326148571] [2020-10-21 22:56:22,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:56:22,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:56:22,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:56:22,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:56:22,781 INFO L87 Difference]: Start difference. First operand 412 states and 1069 transitions. Second operand 5 states. [2020-10-21 22:56:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:56:22,833 INFO L93 Difference]: Finished difference Result 333 states and 803 transitions. [2020-10-21 22:56:22,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:56:22,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 22:56:22,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:56:22,837 INFO L225 Difference]: With dead ends: 333 [2020-10-21 22:56:22,837 INFO L226 Difference]: Without dead ends: 259 [2020-10-21 22:56:22,837 INFO L677 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 [2020-10-21 22:56:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-10-21 22:56:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 251. [2020-10-21 22:56:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-10-21 22:56:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 590 transitions. [2020-10-21 22:56:22,846 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 590 transitions. Word has length 15 [2020-10-21 22:56:22,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:56:22,847 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 590 transitions. [2020-10-21 22:56:22,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:56:22,847 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 590 transitions. [2020-10-21 22:56:22,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 22:56:22,848 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:56:22,848 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:56:22,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 22:56:22,849 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:56:22,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:56:22,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1031485941, now seen corresponding path program 1 times [2020-10-21 22:56:22,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:56:22,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333371587] [2020-10-21 22:56:22,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:56:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:56:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:56:22,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333371587] [2020-10-21 22:56:22,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:56:22,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:56:22,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356079101] [2020-10-21 22:56:22,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:56:22,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:56:22,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:56:22,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:56:22,947 INFO L87 Difference]: Start difference. First operand 251 states and 590 transitions. Second operand 6 states. [2020-10-21 22:56:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:56:23,015 INFO L93 Difference]: Finished difference Result 229 states and 544 transitions. [2020-10-21 22:56:23,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:56:23,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-21 22:56:23,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:56:23,017 INFO L225 Difference]: With dead ends: 229 [2020-10-21 22:56:23,018 INFO L226 Difference]: Without dead ends: 215 [2020-10-21 22:56:23,018 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:56:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-10-21 22:56:23,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2020-10-21 22:56:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-10-21 22:56:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 518 transitions. [2020-10-21 22:56:23,025 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 518 transitions. Word has length 18 [2020-10-21 22:56:23,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:56:23,025 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 518 transitions. [2020-10-21 22:56:23,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:56:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 518 transitions. [2020-10-21 22:56:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 22:56:23,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:56:23,027 INFO L422 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] [2020-10-21 22:56:23,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 22:56:23,027 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:56:23,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:56:23,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1620404099, now seen corresponding path program 1 times [2020-10-21 22:56:23,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:56:23,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610512532] [2020-10-21 22:56:23,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:56:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:56:23,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:56:23,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610512532] [2020-10-21 22:56:23,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:56:23,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:56:23,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292425405] [2020-10-21 22:56:23,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:56:23,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:56:23,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:56:23,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:56:23,093 INFO L87 Difference]: Start difference. First operand 215 states and 518 transitions. Second operand 4 states. [2020-10-21 22:56:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:56:23,115 INFO L93 Difference]: Finished difference Result 277 states and 653 transitions. [2020-10-21 22:56:23,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:56:23,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-21 22:56:23,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:56:23,117 INFO L225 Difference]: With dead ends: 277 [2020-10-21 22:56:23,117 INFO L226 Difference]: Without dead ends: 107 [2020-10-21 22:56:23,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:56:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-21 22:56:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-21 22:56:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-21 22:56:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 222 transitions. [2020-10-21 22:56:23,122 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 222 transitions. Word has length 22 [2020-10-21 22:56:23,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:56:23,122 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 222 transitions. [2020-10-21 22:56:23,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:56:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 222 transitions. [2020-10-21 22:56:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 22:56:23,123 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:56:23,123 INFO L422 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] [2020-10-21 22:56:23,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 22:56:23,124 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:56:23,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:56:23,124 INFO L82 PathProgramCache]: Analyzing trace with hash -704712103, now seen corresponding path program 2 times [2020-10-21 22:56:23,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:56:23,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584604599] [2020-10-21 22:56:23,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:56:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:56:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:56:23,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584604599] [2020-10-21 22:56:23,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:56:23,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:56:23,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18881885] [2020-10-21 22:56:23,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:56:23,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:56:23,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:56:23,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:56:23,249 INFO L87 Difference]: Start difference. First operand 107 states and 222 transitions. Second operand 6 states. [2020-10-21 22:56:23,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:56:23,448 INFO L93 Difference]: Finished difference Result 153 states and 318 transitions. [2020-10-21 22:56:23,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 22:56:23,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-21 22:56:23,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:56:23,450 INFO L225 Difference]: With dead ends: 153 [2020-10-21 22:56:23,450 INFO L226 Difference]: Without dead ends: 131 [2020-10-21 22:56:23,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:56:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-21 22:56:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 99. [2020-10-21 22:56:23,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-21 22:56:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 198 transitions. [2020-10-21 22:56:23,455 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 198 transitions. Word has length 22 [2020-10-21 22:56:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:56:23,455 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 198 transitions. [2020-10-21 22:56:23,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:56:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 198 transitions. [2020-10-21 22:56:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 22:56:23,456 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:56:23,456 INFO L422 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] [2020-10-21 22:56:23,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 22:56:23,457 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:56:23,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:56:23,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1442766119, now seen corresponding path program 3 times [2020-10-21 22:56:23,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:56:23,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369699089] [2020-10-21 22:56:23,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:56:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:56:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:56:23,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369699089] [2020-10-21 22:56:23,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:56:23,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 22:56:23,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307272396] [2020-10-21 22:56:23,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 22:56:23,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:56:23,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 22:56:23,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:56:23,752 INFO L87 Difference]: Start difference. First operand 99 states and 198 transitions. Second operand 9 states. [2020-10-21 22:56:24,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:56:24,058 INFO L93 Difference]: Finished difference Result 162 states and 316 transitions. [2020-10-21 22:56:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 22:56:24,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-21 22:56:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:56:24,060 INFO L225 Difference]: With dead ends: 162 [2020-10-21 22:56:24,061 INFO L226 Difference]: Without dead ends: 128 [2020-10-21 22:56:24,061 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-21 22:56:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-10-21 22:56:24,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 85. [2020-10-21 22:56:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-21 22:56:24,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 170 transitions. [2020-10-21 22:56:24,065 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 170 transitions. Word has length 22 [2020-10-21 22:56:24,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:56:24,065 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 170 transitions. [2020-10-21 22:56:24,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 22:56:24,065 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 170 transitions. [2020-10-21 22:56:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 22:56:24,066 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:56:24,066 INFO L422 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] [2020-10-21 22:56:24,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 22:56:24,066 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:56:24,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:56:24,067 INFO L82 PathProgramCache]: Analyzing trace with hash -15126111, now seen corresponding path program 4 times [2020-10-21 22:56:24,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:56:24,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594773145] [2020-10-21 22:56:24,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:56:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:56:24,148 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:56:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:56:24,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:56:24,260 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 22:56:24,260 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 22:56:24,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 22:56:24,261 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 22:56:24,282 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] L833-->L841: Formula: (let ((.cse7 (= (mod ~x$r_buff1_thd0~0_In1822298753 256) 0)) (.cse6 (= (mod ~x$w_buff1_used~0_In1822298753 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In1822298753 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In1822298753 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (or (and (= ~x$w_buff0_used~0_In1822298753 ~x$w_buff0_used~0_Out1822298753) .cse0) (and .cse1 (= ~x$w_buff0_used~0_Out1822298753 0) .cse2)) (= ~x$r_buff0_thd0~0_Out1822298753 ~x$r_buff0_thd0~0_In1822298753) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1822298753 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1822298753 |ULTIMATE.start_assume_abort_if_not_#in~cond_Out1822298753|) (or (and (or (and .cse3 (= ~x$w_buff1~0_In1822298753 ~x~0_Out1822298753) .cse4) (and .cse5 (= ~x~0_In1822298753 ~x~0_Out1822298753))) .cse0) (and .cse1 (= ~x$w_buff0~0_In1822298753 ~x~0_Out1822298753) .cse2)) (= (mod ~main$tmp_guard0~0_In1822298753 256) |ULTIMATE.start_assume_abort_if_not_#in~cond_Out1822298753|) (or (and .cse3 (= ~x$w_buff1_used~0_Out1822298753 0) .cse4) (and .cse5 (= ~x$w_buff1_used~0_In1822298753 ~x$w_buff1_used~0_Out1822298753))) (= ~x$r_buff1_thd0~0_Out1822298753 ~x$r_buff1_thd0~0_In1822298753)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1822298753, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1822298753, ~x$w_buff1~0=~x$w_buff1~0_In1822298753, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1822298753, ~main$tmp_guard0~0=~main$tmp_guard0~0_In1822298753, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1822298753, ~x~0=~x~0_In1822298753, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1822298753} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1822298753, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1822298753, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1822298753|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1822298753|, ~x$w_buff1~0=~x$w_buff1~0_In1822298753, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1822298753, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1822298753|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1822298753|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In1822298753, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1822298753|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1822298753, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1822298753, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out1822298753|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1822298753|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1822298753, ~x~0=~x~0_Out1822298753} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~x~0] because there is no mapped edge [2020-10-21 22:56:24,293 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,293 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [764] [2020-10-21 22:56:24,297 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,297 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,297 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,298 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,298 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,299 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,299 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,299 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,299 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,299 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,300 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,300 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,300 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,301 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,301 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,301 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,302 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,302 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,302 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,304 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,304 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,304 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,305 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,305 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,305 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,306 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,306 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,307 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,311 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,313 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,313 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,313 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,315 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:56:24,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:56:24,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:56:24 BasicIcfg [2020-10-21 22:56:24,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 22:56:24,412 INFO L168 Benchmark]: Toolchain (without parser) took 16659.09 ms. Allocated memory was 140.5 MB in the beginning and 382.2 MB in the end (delta: 241.7 MB). Free memory was 102.0 MB in the beginning and 208.7 MB in the end (delta: -106.7 MB). Peak memory consumption was 135.0 MB. Max. memory is 7.1 GB. [2020-10-21 22:56:24,413 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-21 22:56:24,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 933.71 ms. Allocated memory was 140.5 MB in the beginning and 206.6 MB in the end (delta: 66.1 MB). Free memory was 101.2 MB in the beginning and 157.1 MB in the end (delta: -56.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-10-21 22:56:24,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.02 ms. Allocated memory is still 206.6 MB. Free memory was 157.1 MB in the beginning and 153.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-21 22:56:24,415 INFO L168 Benchmark]: Boogie Preprocessor took 42.99 ms. Allocated memory is still 206.6 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 22:56:24,415 INFO L168 Benchmark]: RCFGBuilder took 2310.58 ms. Allocated memory was 206.6 MB in the beginning and 247.5 MB in the end (delta: 40.9 MB). Free memory was 151.0 MB in the beginning and 154.3 MB in the end (delta: -3.3 MB). Peak memory consumption was 96.8 MB. Max. memory is 7.1 GB. [2020-10-21 22:56:24,416 INFO L168 Benchmark]: TraceAbstraction took 13293.02 ms. Allocated memory was 247.5 MB in the beginning and 382.2 MB in the end (delta: 134.7 MB). Free memory was 152.5 MB in the beginning and 208.7 MB in the end (delta: -56.1 MB). Peak memory consumption was 78.6 MB. Max. memory is 7.1 GB. [2020-10-21 22:56:24,420 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 933.71 ms. Allocated memory was 140.5 MB in the beginning and 206.6 MB in the end (delta: 66.1 MB). Free memory was 101.2 MB in the beginning and 157.1 MB in the end (delta: -56.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.02 ms. Allocated memory is still 206.6 MB. Free memory was 157.1 MB in the beginning and 153.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.99 ms. Allocated memory is still 206.6 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2310.58 ms. Allocated memory was 206.6 MB in the beginning and 247.5 MB in the end (delta: 40.9 MB). Free memory was 151.0 MB in the beginning and 154.3 MB in the end (delta: -3.3 MB). Peak memory consumption was 96.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13293.02 ms. Allocated memory was 247.5 MB in the beginning and 382.2 MB in the end (delta: 134.7 MB). Free memory was 152.5 MB in the beginning and 208.7 MB in the end (delta: -56.1 MB). Peak memory consumption was 78.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1085 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 94 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.3s, 111 PlacesBefore, 37 PlacesAfterwards, 104 TransitionsBefore, 27 TransitionsAfterwards, 1954 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 95 TotalNumberOfCompositions, 5474 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t517; [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L803] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L745] 1 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L748] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L849] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L849] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L850] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L850] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L850] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L851] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L851] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix019_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 273 SDtfs, 415 SDslu, 473 SDs, 0 SdLazy, 273 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=972occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 97 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 20840 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, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...