/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-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:13:49,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:13:49,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:13:49,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:13:49,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:13:49,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:13:49,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:13:49,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:13:49,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:13:49,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:13:49,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:13:49,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:13:49,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:13:49,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:13:49,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:13:49,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:13:49,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:13:49,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:13:49,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:13:49,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:13:49,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:13:49,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:13:49,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:13:49,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:13:49,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:13:49,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:13:49,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:13:49,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:13:49,980 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:13:49,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:13:49,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:13:49,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:13:49,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:13:49,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:13:49,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:13:49,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:13:49,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:13:49,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:13:49,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:13:49,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:13:49,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:13:49,991 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-McrAutomaton-WP.epf [2020-10-22 00:13:50,030 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:13:50,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:13:50,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:13:50,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:13:50,032 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:13:50,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:13:50,034 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:13:50,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:13:50,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:13:50,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:13:50,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:13:50,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:13:50,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:13:50,036 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:13:50,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:13:50,037 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:13:50,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:13:50,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:13:50,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:13:50,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:13:50,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:13:50,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:13:50,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:13:50,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:13:50,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:13:50,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:13:50,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:13:50,039 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:13:50,039 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:13:50,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:13:50,040 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:13:50,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:13:50,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:13:50,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:13:50,368 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:13:50,368 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:13:50,369 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_power.opt.i [2020-10-22 00:13:50,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/459fe0875/eda001c536c44d18b1e17fbd67bab524/FLAGf7dce561e [2020-10-22 00:13:50,975 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:13:50,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.opt.i [2020-10-22 00:13:50,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/459fe0875/eda001c536c44d18b1e17fbd67bab524/FLAGf7dce561e [2020-10-22 00:13:51,257 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/459fe0875/eda001c536c44d18b1e17fbd67bab524 [2020-10-22 00:13:51,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:13:51,274 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:13:51,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:13:51,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:13:51,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:13:51,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:13:51" (1/1) ... [2020-10-22 00:13:51,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403d3b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:13:51, skipping insertion in model container [2020-10-22 00:13:51,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:13:51" (1/1) ... [2020-10-22 00:13:51,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:13:51,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:13:51,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:13:51,877 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:13:51,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:13:52,011 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:13:52,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:13:52 WrapperNode [2020-10-22 00:13:52,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:13:52,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:13:52,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:13:52,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:13:52,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:13:52" (1/1) ... [2020-10-22 00:13:52,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:13:52" (1/1) ... [2020-10-22 00:13:52,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:13:52,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:13:52,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:13:52,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:13:52,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:13:52" (1/1) ... [2020-10-22 00:13:52,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:13:52" (1/1) ... [2020-10-22 00:13:52,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:13:52" (1/1) ... [2020-10-22 00:13:52,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:13:52" (1/1) ... [2020-10-22 00:13:52,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:13:52" (1/1) ... [2020-10-22 00:13:52,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:13:52" (1/1) ... [2020-10-22 00:13:52,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:13:52" (1/1) ... [2020-10-22 00:13:52,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:13:52,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:13:52,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:13:52,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:13:52,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:13:52" (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-22 00:13:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:13:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 00:13:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:13:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:13:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 00:13:52,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 00:13:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 00:13:52,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 00:13:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 00:13:52,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 00:13:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:13:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 00:13:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:13:52,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:13:52,206 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:13:54,066 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:13:54,066 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 00:13:54,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:13:54 BoogieIcfgContainer [2020-10-22 00:13:54,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:13:54,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:13:54,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:13:54,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:13:54,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:13:51" (1/3) ... [2020-10-22 00:13:54,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310e52bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:13:54, skipping insertion in model container [2020-10-22 00:13:54,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:13:52" (2/3) ... [2020-10-22 00:13:54,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310e52bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:13:54, skipping insertion in model container [2020-10-22 00:13:54,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:13:54" (3/3) ... [2020-10-22 00:13:54,077 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_power.opt.i [2020-10-22 00:13:54,088 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:13:54,088 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:13:54,095 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 00:13:54,096 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:13:54,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,127 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,127 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,129 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,129 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,138 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,138 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,139 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,140 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,147 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,147 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,154 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,158 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,159 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,159 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:13:54,162 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:13:54,175 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 00:13:54,194 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:13:54,195 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:13:54,195 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:13:54,195 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:13:54,195 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:13:54,195 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:13:54,195 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:13:54,196 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:13:54,209 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:13:54,210 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 108 transitions, 231 flow [2020-10-22 00:13:54,213 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 108 transitions, 231 flow [2020-10-22 00:13:54,214 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 115 places, 108 transitions, 231 flow [2020-10-22 00:13:54,265 INFO L129 PetriNetUnfolder]: 3/105 cut-off events. [2020-10-22 00:13:54,265 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:13:54,270 INFO L80 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 3/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2020-10-22 00:13:54,274 INFO L116 LiptonReduction]: Number of co-enabled transitions 2024 [2020-10-22 00:13:55,109 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 00:13:55,541 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-22 00:13:56,795 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2020-10-22 00:13:57,043 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2020-10-22 00:13:57,631 WARN L193 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-10-22 00:13:57,823 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-22 00:13:57,842 INFO L131 LiptonReduction]: Checked pairs total: 4880 [2020-10-22 00:13:57,843 INFO L133 LiptonReduction]: Total number of compositions: 98 [2020-10-22 00:13:57,849 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-22 00:13:57,891 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 750 states. [2020-10-22 00:13:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2020-10-22 00:13:57,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-22 00:13:57,900 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:13:57,900 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:13:57,901 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:13:57,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:13:57,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1080882322, now seen corresponding path program 1 times [2020-10-22 00:13:57,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:13:57,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684416713] [2020-10-22 00:13:57,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:13:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:13:58,178 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-22 00:13:58,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684416713] [2020-10-22 00:13:58,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:13:58,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:13:58,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1458365836] [2020-10-22 00:13:58,182 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:13:58,185 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:13:58,199 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-22 00:13:58,199 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:13:58,203 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:13:58,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:13:58,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:13:58,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:13:58,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:13:58,221 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 3 states. [2020-10-22 00:13:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:13:58,280 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-10-22 00:13:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:13:58,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-22 00:13:58,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:13:58,303 INFO L225 Difference]: With dead ends: 650 [2020-10-22 00:13:58,303 INFO L226 Difference]: Without dead ends: 530 [2020-10-22 00:13:58,304 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-22 00:13:58,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-10-22 00:13:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-22 00:13:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-22 00:13:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2020-10-22 00:13:58,389 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2020-10-22 00:13:58,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:13:58,390 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2020-10-22 00:13:58,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:13:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2020-10-22 00:13:58,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 00:13:58,391 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:13:58,391 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:13:58,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:13:58,392 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:13:58,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:13:58,393 INFO L82 PathProgramCache]: Analyzing trace with hash -654110915, now seen corresponding path program 1 times [2020-10-22 00:13:58,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:13:58,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323758034] [2020-10-22 00:13:58,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:13:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:13:58,482 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-22 00:13:58,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323758034] [2020-10-22 00:13:58,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:13:58,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:13:58,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [876477211] [2020-10-22 00:13:58,483 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:13:58,484 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:13:58,485 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 00:13:58,485 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:13:58,486 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:13:58,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:13:58,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:13:58,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:13:58,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:13:58,488 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand 3 states. [2020-10-22 00:13:58,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:13:58,503 INFO L93 Difference]: Finished difference Result 518 states and 1576 transitions. [2020-10-22 00:13:58,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:13:58,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 00:13:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:13:58,508 INFO L225 Difference]: With dead ends: 518 [2020-10-22 00:13:58,509 INFO L226 Difference]: Without dead ends: 518 [2020-10-22 00:13:58,510 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-22 00:13:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-10-22 00:13:58,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2020-10-22 00:13:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2020-10-22 00:13:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1576 transitions. [2020-10-22 00:13:58,538 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1576 transitions. Word has length 9 [2020-10-22 00:13:58,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:13:58,539 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 1576 transitions. [2020-10-22 00:13:58,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:13:58,539 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1576 transitions. [2020-10-22 00:13:58,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:13:58,541 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:13:58,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:13:58,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:13:58,544 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:13:58,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:13:58,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1257986007, now seen corresponding path program 1 times [2020-10-22 00:13:58,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:13:58,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630868517] [2020-10-22 00:13:58,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:13:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:13:58,601 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-22 00:13:58,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630868517] [2020-10-22 00:13:58,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:13:58,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:13:58,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1302536237] [2020-10-22 00:13:58,603 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:13:58,604 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:13:58,605 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-10-22 00:13:58,606 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:13:58,683 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:13:58,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:13:58,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:13:58,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:13:58,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:13:58,685 INFO L87 Difference]: Start difference. First operand 518 states and 1576 transitions. Second operand 3 states. [2020-10-22 00:13:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:13:58,698 INFO L93 Difference]: Finished difference Result 482 states and 1450 transitions. [2020-10-22 00:13:58,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:13:58,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-22 00:13:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:13:58,706 INFO L225 Difference]: With dead ends: 482 [2020-10-22 00:13:58,707 INFO L226 Difference]: Without dead ends: 482 [2020-10-22 00:13:58,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-22 00:13:58,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-22 00:13:58,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-10-22 00:13:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-22 00:13:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1450 transitions. [2020-10-22 00:13:58,724 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1450 transitions. Word has length 10 [2020-10-22 00:13:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:13:58,725 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1450 transitions. [2020-10-22 00:13:58,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:13:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1450 transitions. [2020-10-22 00:13:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 00:13:58,733 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:13:58,733 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:13:58,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:13:58,733 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:13:58,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:13:58,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2005212149, now seen corresponding path program 1 times [2020-10-22 00:13:58,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:13:58,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703117022] [2020-10-22 00:13:58,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:13:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:13:58,831 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-22 00:13:58,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703117022] [2020-10-22 00:13:58,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:13:58,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:13:58,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [91786218] [2020-10-22 00:13:58,833 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:13:58,834 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:13:58,838 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 39 transitions. [2020-10-22 00:13:58,838 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:13:59,032 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:13:59,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:13:59,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:13:59,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:13:59,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:13:59,034 INFO L87 Difference]: Start difference. First operand 482 states and 1450 transitions. Second operand 3 states. [2020-10-22 00:13:59,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:13:59,042 INFO L93 Difference]: Finished difference Result 458 states and 1368 transitions. [2020-10-22 00:13:59,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:13:59,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-22 00:13:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:13:59,045 INFO L225 Difference]: With dead ends: 458 [2020-10-22 00:13:59,045 INFO L226 Difference]: Without dead ends: 458 [2020-10-22 00:13:59,046 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-22 00:13:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-22 00:13:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2020-10-22 00:13:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-10-22 00:13:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1368 transitions. [2020-10-22 00:13:59,058 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1368 transitions. Word has length 12 [2020-10-22 00:13:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:13:59,059 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1368 transitions. [2020-10-22 00:13:59,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:13:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1368 transitions. [2020-10-22 00:13:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:13:59,060 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:13:59,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:13:59,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:13:59,061 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:13:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:13:59,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1229959684, now seen corresponding path program 1 times [2020-10-22 00:13:59,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:13:59,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444740906] [2020-10-22 00:13:59,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:13:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:13:59,131 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-22 00:13:59,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444740906] [2020-10-22 00:13:59,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:13:59,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:13:59,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1867018410] [2020-10-22 00:13:59,132 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:13:59,134 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:13:59,139 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 61 transitions. [2020-10-22 00:13:59,140 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:13:59,459 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:13:59,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:13:59,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:13:59,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:13:59,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:13:59,460 INFO L87 Difference]: Start difference. First operand 458 states and 1368 transitions. Second operand 4 states. [2020-10-22 00:13:59,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:13:59,498 INFO L93 Difference]: Finished difference Result 440 states and 1162 transitions. [2020-10-22 00:13:59,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:13:59,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-22 00:13:59,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:13:59,501 INFO L225 Difference]: With dead ends: 440 [2020-10-22 00:13:59,501 INFO L226 Difference]: Without dead ends: 320 [2020-10-22 00:13:59,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:13:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-10-22 00:13:59,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2020-10-22 00:13:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-10-22 00:13:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 816 transitions. [2020-10-22 00:13:59,511 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 816 transitions. Word has length 13 [2020-10-22 00:13:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:13:59,511 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 816 transitions. [2020-10-22 00:13:59,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:13:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 816 transitions. [2020-10-22 00:13:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:13:59,512 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:13:59,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:13:59,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:13:59,513 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:13:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:13:59,513 INFO L82 PathProgramCache]: Analyzing trace with hash -925135082, now seen corresponding path program 1 times [2020-10-22 00:13:59,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:13:59,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966385530] [2020-10-22 00:13:59,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:13:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:13:59,615 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-22 00:13:59,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966385530] [2020-10-22 00:13:59,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:13:59,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:13:59,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1453507753] [2020-10-22 00:13:59,616 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:13:59,620 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:13:59,626 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 41 transitions. [2020-10-22 00:13:59,626 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:13:59,992 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 00:14:00,311 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 3 [2020-10-22 00:14:00,329 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8805#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:14:00,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:14:00,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:14:00,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:14:00,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:14:00,331 INFO L87 Difference]: Start difference. First operand 320 states and 816 transitions. Second operand 6 states. [2020-10-22 00:14:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:14:00,406 INFO L93 Difference]: Finished difference Result 265 states and 624 transitions. [2020-10-22 00:14:00,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:14:00,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-22 00:14:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:14:00,409 INFO L225 Difference]: With dead ends: 265 [2020-10-22 00:14:00,409 INFO L226 Difference]: Without dead ends: 205 [2020-10-22 00:14:00,410 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:14:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-10-22 00:14:00,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2020-10-22 00:14:00,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-10-22 00:14:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 471 transitions. [2020-10-22 00:14:00,415 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 471 transitions. Word has length 15 [2020-10-22 00:14:00,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:14:00,416 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 471 transitions. [2020-10-22 00:14:00,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:14:00,417 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 471 transitions. [2020-10-22 00:14:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 00:14:00,418 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:14:00,418 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-22 00:14:00,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:14:00,418 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:14:00,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:14:00,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1507823083, now seen corresponding path program 1 times [2020-10-22 00:14:00,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:14:00,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283917013] [2020-10-22 00:14:00,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:14:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:14:00,580 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-22 00:14:00,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283917013] [2020-10-22 00:14:00,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:14:00,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:14:00,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [512833971] [2020-10-22 00:14:00,583 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:14:00,590 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:14:00,610 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 136 transitions. [2020-10-22 00:14:00,611 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:14:00,952 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 3 [2020-10-22 00:14:01,480 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 00:14:01,532 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9489#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:14:01,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:14:01,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:14:01,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:14:01,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:14:01,534 INFO L87 Difference]: Start difference. First operand 205 states and 471 transitions. Second operand 7 states. [2020-10-22 00:14:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:14:01,592 INFO L93 Difference]: Finished difference Result 186 states and 431 transitions. [2020-10-22 00:14:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:14:01,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-22 00:14:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:14:01,595 INFO L225 Difference]: With dead ends: 186 [2020-10-22 00:14:01,595 INFO L226 Difference]: Without dead ends: 173 [2020-10-22 00:14:01,596 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:14:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-10-22 00:14:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-10-22 00:14:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-10-22 00:14:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 407 transitions. [2020-10-22 00:14:01,601 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 407 transitions. Word has length 18 [2020-10-22 00:14:01,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:14:01,601 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 407 transitions. [2020-10-22 00:14:01,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:14:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 407 transitions. [2020-10-22 00:14:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:14:01,602 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:14:01,602 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] [2020-10-22 00:14:01,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:14:01,603 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:14:01,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:14:01,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1217699242, now seen corresponding path program 1 times [2020-10-22 00:14:01,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:14:01,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248135337] [2020-10-22 00:14:01,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:14:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:14:01,657 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-22 00:14:01,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248135337] [2020-10-22 00:14:01,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:14:01,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:14:01,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1021499383] [2020-10-22 00:14:01,658 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:14:01,661 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:14:01,685 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 147 transitions. [2020-10-22 00:14:01,685 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:14:02,447 WARN L193 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 00:14:02,835 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-22 00:14:02,886 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:14:02,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:14:02,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:14:02,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:14:02,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:14:02,888 INFO L87 Difference]: Start difference. First operand 173 states and 407 transitions. Second operand 4 states. [2020-10-22 00:14:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:14:02,918 INFO L93 Difference]: Finished difference Result 220 states and 505 transitions. [2020-10-22 00:14:02,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:14:02,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-22 00:14:02,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:14:02,920 INFO L225 Difference]: With dead ends: 220 [2020-10-22 00:14:02,920 INFO L226 Difference]: Without dead ends: 92 [2020-10-22 00:14:02,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-22 00:14:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-22 00:14:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-22 00:14:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-22 00:14:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2020-10-22 00:14:02,930 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 185 transitions. Word has length 21 [2020-10-22 00:14:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:14:02,930 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 185 transitions. [2020-10-22 00:14:02,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:14:02,931 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 185 transitions. [2020-10-22 00:14:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:14:02,933 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:14:02,933 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] [2020-10-22 00:14:02,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:14:02,934 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:14:02,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:14:02,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1461062086, now seen corresponding path program 2 times [2020-10-22 00:14:02,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:14:02,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073227555] [2020-10-22 00:14:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:14:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:14:02,999 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-22 00:14:02,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073227555] [2020-10-22 00:14:02,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:14:02,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:14:03,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1276311119] [2020-10-22 00:14:03,000 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:14:03,004 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:14:03,016 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 63 transitions. [2020-10-22 00:14:03,017 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:14:03,056 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:14:03,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:14:03,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:14:03,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:14:03,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:14:03,057 INFO L87 Difference]: Start difference. First operand 92 states and 185 transitions. Second operand 3 states. [2020-10-22 00:14:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:14:03,068 INFO L93 Difference]: Finished difference Result 118 states and 233 transitions. [2020-10-22 00:14:03,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:14:03,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-22 00:14:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:14:03,069 INFO L225 Difference]: With dead ends: 118 [2020-10-22 00:14:03,069 INFO L226 Difference]: Without dead ends: 48 [2020-10-22 00:14:03,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-22 00:14:03,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-22 00:14:03,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-22 00:14:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-22 00:14:03,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-10-22 00:14:03,073 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 21 [2020-10-22 00:14:03,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:14:03,073 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-10-22 00:14:03,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:14:03,073 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-10-22 00:14:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:14:03,074 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:14:03,074 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] [2020-10-22 00:14:03,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:14:03,074 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:14:03,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:14:03,074 INFO L82 PathProgramCache]: Analyzing trace with hash -267942436, now seen corresponding path program 3 times [2020-10-22 00:14:03,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:14:03,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884060947] [2020-10-22 00:14:03,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:14:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:14:03,170 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-22 00:14:03,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884060947] [2020-10-22 00:14:03,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:14:03,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:14:03,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1942687185] [2020-10-22 00:14:03,172 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:14:03,175 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:14:03,195 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 96 transitions. [2020-10-22 00:14:03,195 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:14:03,289 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-22 00:14:03,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,290 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-22 00:14:03,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,291 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-22 00:14:03,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,293 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 00:14:03,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,295 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 00:14:03,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,296 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 00:14:03,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 00:14:03,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,300 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 00:14:03,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,349 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 00:14:03,349 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:14:03,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:14:03,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:14:03,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:14:03,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:14:03,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:14:03,718 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-22 00:14:03,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,719 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-22 00:14:03,719 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,723 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 00:14:03,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,724 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:14:03,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:14:03,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:14:03,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:14:03,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:14:03,748 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:14:03,753 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:14:03,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:14:03,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:14:03,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:14:03,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:14:03,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:14:03,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:14:03,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:14:03,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,785 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-22 00:14:03,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:14:03,835 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [10656#(and (not (= ~z~0 0)) (= (mod ~z$w_buff0_used~0 256) 0)), 10657#(and (not (= (mod ~z$r_buff0_thd3~0 256) 0)) (not (= ~z$w_buff0~0 0)) (not (= (mod ~z$w_buff0_used~0 256) 0)))] [2020-10-22 00:14:03,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:14:03,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:14:03,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:14:03,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:14:03,837 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 7 states. [2020-10-22 00:14:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:14:03,886 INFO L93 Difference]: Finished difference Result 58 states and 95 transitions. [2020-10-22 00:14:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:14:03,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-22 00:14:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:14:03,887 INFO L225 Difference]: With dead ends: 58 [2020-10-22 00:14:03,887 INFO L226 Difference]: Without dead ends: 32 [2020-10-22 00:14:03,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:14:03,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-10-22 00:14:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-22 00:14:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-22 00:14:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-10-22 00:14:03,889 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 21 [2020-10-22 00:14:03,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:14:03,890 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-10-22 00:14:03,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:14:03,890 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2020-10-22 00:14:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:14:03,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:14:03,890 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] [2020-10-22 00:14:03,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:14:03,891 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:14:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:14:03,891 INFO L82 PathProgramCache]: Analyzing trace with hash 167132730, now seen corresponding path program 4 times [2020-10-22 00:14:03,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:14:03,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974974312] [2020-10-22 00:14:03,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:14:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:14:03,928 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:14:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:14:03,963 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:14:04,001 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:14:04,002 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:14:04,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:14:04,003 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:14:04,027 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L852-->L859: Formula: (let ((.cse7 (= (mod ~z$w_buff1_used~0_In-351669873 256) 0)) (.cse6 (= (mod ~z$r_buff1_thd0~0_In-351669873 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In-351669873 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In-351669873 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (= ~z$r_buff0_thd0~0_In-351669873 ~z$r_buff0_thd0~0_Out-351669873) (or (and (= ~z$w_buff0_used~0_Out-351669873 0) .cse0 .cse1) (and (= ~z$w_buff0_used~0_Out-351669873 ~z$w_buff0_used~0_In-351669873) .cse2)) (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out-351669873)) (or (and (= ~z~0_Out-351669873 ~z$w_buff0~0_In-351669873) .cse0 .cse1) (and .cse2 (or (and .cse3 (= ~z$w_buff1~0_In-351669873 ~z~0_Out-351669873) .cse4) (and (= ~z~0_In-351669873 ~z~0_Out-351669873) .cse5)))) (= ~z$r_buff1_thd0~0_Out-351669873 ~z$r_buff1_thd0~0_In-351669873) (or (and (= ~z$w_buff1_used~0_Out-351669873 ~z$w_buff1_used~0_In-351669873) .cse5) (and .cse3 .cse4 (= ~z$w_buff1_used~0_Out-351669873 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-351669873| ULTIMATE.start_assume_abort_if_not_~cond_Out-351669873)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-351669873|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-351669873, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-351669873, ~z$w_buff0~0=~z$w_buff0~0_In-351669873, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-351669873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-351669873, ~z$w_buff1~0=~z$w_buff1~0_In-351669873, ~z~0=~z~0_In-351669873} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-351669873, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-351669873|, ~z$w_buff0~0=~z$w_buff0~0_In-351669873, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-351669873, ~z$w_buff1~0=~z$w_buff1~0_In-351669873, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-351669873|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-351669873|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-351669873|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-351669873|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-351669873, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-351669873|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-351669873|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-351669873, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-351669873, ~z~0=~z~0_Out-351669873} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~z~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2020-10-22 00:14:04,034 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-22 00:14:04,034 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-10-22 00:14:04,036 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-22 00:14:04,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,036 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-22 00:14:04,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,037 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-22 00:14:04,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,037 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-22 00:14:04,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,037 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-22 00:14:04,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,038 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-22 00:14:04,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,038 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-22 00:14:04,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,038 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-22 00:14:04,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,039 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-22 00:14:04,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,039 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-22 00:14:04,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,039 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-22 00:14:04,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,040 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-22 00:14:04,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,040 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-22 00:14:04,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,041 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-22 00:14:04,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,041 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-22 00:14:04,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,041 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-22 00:14:04,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,042 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-22 00:14:04,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:14:04,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:14:04 BasicIcfg [2020-10-22 00:14:04,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:14:04,121 INFO L168 Benchmark]: Toolchain (without parser) took 12852.98 ms. Allocated memory was 138.4 MB in the beginning and 373.8 MB in the end (delta: 235.4 MB). Free memory was 100.4 MB in the beginning and 186.8 MB in the end (delta: -86.3 MB). Peak memory consumption was 149.1 MB. Max. memory is 7.1 GB. [2020-10-22 00:14:04,122 INFO L168 Benchmark]: CDTParser took 3.05 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-22 00:14:04,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.22 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 99.4 MB in the beginning and 152.6 MB in the end (delta: -53.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2020-10-22 00:14:04,123 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.01 ms. Allocated memory is still 201.3 MB. Free memory was 152.6 MB in the beginning and 149.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-22 00:14:04,124 INFO L168 Benchmark]: Boogie Preprocessor took 39.91 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 147.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-22 00:14:04,125 INFO L168 Benchmark]: RCFGBuilder took 1955.93 ms. Allocated memory was 201.3 MB in the beginning and 249.6 MB in the end (delta: 48.2 MB). Free memory was 147.0 MB in the beginning and 213.3 MB in the end (delta: -66.2 MB). Peak memory consumption was 101.8 MB. Max. memory is 7.1 GB. [2020-10-22 00:14:04,126 INFO L168 Benchmark]: TraceAbstraction took 10049.66 ms. Allocated memory was 249.6 MB in the beginning and 373.8 MB in the end (delta: 124.3 MB). Free memory was 213.3 MB in the beginning and 186.8 MB in the end (delta: 26.5 MB). Peak memory consumption was 150.8 MB. Max. memory is 7.1 GB. [2020-10-22 00:14:04,130 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.05 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 737.22 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 99.4 MB in the beginning and 152.6 MB in the end (delta: -53.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.01 ms. Allocated memory is still 201.3 MB. Free memory was 152.6 MB in the beginning and 149.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.91 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 147.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1955.93 ms. Allocated memory was 201.3 MB in the beginning and 249.6 MB in the end (delta: 48.2 MB). Free memory was 147.0 MB in the beginning and 213.3 MB in the end (delta: -66.2 MB). Peak memory consumption was 101.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10049.66 ms. Allocated memory was 249.6 MB in the beginning and 373.8 MB in the end (delta: 124.3 MB). Free memory was 213.3 MB in the beginning and 186.8 MB in the end (delta: 26.5 MB). Peak memory consumption was 150.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1130 VarBasedMoverChecksPositive, 39 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 92 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.6s, 115 PlacesBefore, 36 PlacesAfterwards, 108 TransitionsBefore, 26 TransitionsAfterwards, 2024 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 98 TotalNumberOfCompositions, 4880 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_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L843] 0 pthread_t t876; [L844] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t877; [L846] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t878; [L848] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 a = 1 [L815] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 2 [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1 [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1 [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix033_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.8s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 252 SDtfs, 162 SDslu, 357 SDs, 0 SdLazy, 124 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 6759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...