/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/mix042_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 00:39:15,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 00:39:15,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 00:39:15,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 00:39:15,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 00:39:15,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 00:39:15,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 00:39:15,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 00:39:15,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 00:39:15,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 00:39:15,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 00:39:15,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 00:39:15,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 00:39:15,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 00:39:15,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 00:39:15,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 00:39:15,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 00:39:15,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 00:39:15,047 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 00:39:15,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 00:39:15,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 00:39:15,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 00:39:15,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 00:39:15,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 00:39:15,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 00:39:15,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 00:39:15,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 00:39:15,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 00:39:15,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 00:39:15,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 00:39:15,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 00:39:15,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 00:39:15,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 00:39:15,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 00:39:15,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 00:39:15,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 00:39:15,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 00:39:15,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 00:39:15,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 00:39:15,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 00:39:15,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 00:39:15,065 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-06 00:39:15,088 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 00:39:15,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 00:39:15,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 00:39:15,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 00:39:15,089 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 00:39:15,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 00:39:15,090 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 00:39:15,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 00:39:15,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 00:39:15,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 00:39:15,091 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 00:39:15,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 00:39:15,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 00:39:15,091 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 00:39:15,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 00:39:15,092 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 00:39:15,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 00:39:15,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 00:39:15,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 00:39:15,092 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 00:39:15,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 00:39:15,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:39:15,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 00:39:15,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 00:39:15,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 00:39:15,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 00:39:15,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 00:39:15,094 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 00:39:15,094 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 00:39:15,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 00:39:15,095 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 00:39:15,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 00:39:15,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 00:39:15,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 00:39:15,429 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 00:39:15,430 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 00:39:15,432 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2020-10-06 00:39:15,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e321ffba/4d26b9c179804a3bb57263a6d1e6a186/FLAG3f9bb8055 [2020-10-06 00:39:16,129 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 00:39:16,130 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2020-10-06 00:39:16,151 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e321ffba/4d26b9c179804a3bb57263a6d1e6a186/FLAG3f9bb8055 [2020-10-06 00:39:16,348 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e321ffba/4d26b9c179804a3bb57263a6d1e6a186 [2020-10-06 00:39:16,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 00:39:16,359 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 00:39:16,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 00:39:16,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 00:39:16,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 00:39:16,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:39:16" (1/1) ... [2020-10-06 00:39:16,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b24b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:39:16, skipping insertion in model container [2020-10-06 00:39:16,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:39:16" (1/1) ... [2020-10-06 00:39:16,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 00:39:16,420 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 00:39:16,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:39:16,999 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 00:39:17,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:39:17,188 INFO L208 MainTranslator]: Completed translation [2020-10-06 00:39:17,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:39:17 WrapperNode [2020-10-06 00:39:17,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 00:39:17,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 00:39:17,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 00:39:17,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 00:39:17,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:39:17" (1/1) ... [2020-10-06 00:39:17,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:39:17" (1/1) ... [2020-10-06 00:39:17,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 00:39:17,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 00:39:17,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 00:39:17,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 00:39:17,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:39:17" (1/1) ... [2020-10-06 00:39:17,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:39:17" (1/1) ... [2020-10-06 00:39:17,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:39:17" (1/1) ... [2020-10-06 00:39:17,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:39:17" (1/1) ... [2020-10-06 00:39:17,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:39:17" (1/1) ... [2020-10-06 00:39:17,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:39:17" (1/1) ... [2020-10-06 00:39:17,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:39:17" (1/1) ... [2020-10-06 00:39:17,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 00:39:17,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 00:39:17,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 00:39:17,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 00:39:17,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:39:17" (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-06 00:39:17,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 00:39:17,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 00:39:17,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 00:39:17,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 00:39:17,404 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 00:39:17,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 00:39:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 00:39:17,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 00:39:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-06 00:39:17,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-06 00:39:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 00:39:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 00:39:17,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 00:39:17,409 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 00:39:19,401 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 00:39:19,401 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 00:39:19,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:39:19 BoogieIcfgContainer [2020-10-06 00:39:19,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 00:39:19,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 00:39:19,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 00:39:19,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 00:39:19,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 12:39:16" (1/3) ... [2020-10-06 00:39:19,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf3bc8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:39:19, skipping insertion in model container [2020-10-06 00:39:19,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:39:17" (2/3) ... [2020-10-06 00:39:19,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf3bc8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:39:19, skipping insertion in model container [2020-10-06 00:39:19,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:39:19" (3/3) ... [2020-10-06 00:39:19,414 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_rmo.opt.i [2020-10-06 00:39:19,427 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 00:39:19,428 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 00:39:19,436 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 00:39:19,437 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 00:39:19,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,469 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,470 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,471 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,471 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,475 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,475 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,476 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,476 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,483 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,483 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,489 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,489 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,493 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,494 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,494 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:39:19,513 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-06 00:39:19,538 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 00:39:19,538 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 00:39:19,538 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 00:39:19,538 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 00:39:19,539 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 00:39:19,539 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 00:39:19,539 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 00:39:19,539 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 00:39:19,559 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 207 flow [2020-10-06 00:39:19,561 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2020-10-06 00:39:19,613 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-10-06 00:39:19,613 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:39:19,618 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-06 00:39:19,622 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2020-10-06 00:39:19,645 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-10-06 00:39:19,645 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:39:19,646 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-06 00:39:19,648 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1692 [2020-10-06 00:39:19,650 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 00:39:19,904 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2020-10-06 00:39:21,196 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-06 00:39:21,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-06 00:39:21,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:39:21,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-06 00:39:21,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:39:22,467 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-06 00:39:22,929 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-06 00:39:23,040 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-06 00:39:24,198 WARN L193 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 121 [2020-10-06 00:39:24,502 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-06 00:39:25,108 WARN L193 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-10-06 00:39:25,407 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-06 00:39:25,912 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-06 00:39:26,224 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-06 00:39:26,758 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-06 00:39:27,138 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-06 00:39:27,613 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-06 00:39:27,739 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-06 00:39:27,746 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4134 [2020-10-06 00:39:27,746 INFO L214 etLargeBlockEncoding]: Total number of compositions: 79 [2020-10-06 00:39:27,750 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-06 00:39:27,804 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 750 states. [2020-10-06 00:39:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2020-10-06 00:39:27,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-06 00:39:27,814 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:39:27,816 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:39:27,817 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:39:27,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:39:27,823 INFO L82 PathProgramCache]: Analyzing trace with hash 809404757, now seen corresponding path program 1 times [2020-10-06 00:39:27,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:39:27,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880325556] [2020-10-06 00:39:27,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:39:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:39:28,085 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-06 00:39:28,086 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880325556] [2020-10-06 00:39:28,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:39:28,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:39:28,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [815361897] [2020-10-06 00:39:28,089 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:39:28,092 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:39:28,107 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-06 00:39:28,107 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:39:28,111 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:39:28,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:39:28,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:39:28,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:39:28,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:39:28,130 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 3 states. [2020-10-06 00:39:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:39:28,215 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-10-06 00:39:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:39:28,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-06 00:39:28,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:39:28,239 INFO L225 Difference]: With dead ends: 650 [2020-10-06 00:39:28,240 INFO L226 Difference]: Without dead ends: 530 [2020-10-06 00:39:28,241 INFO L675 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-06 00:39:28,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-10-06 00:39:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-06 00:39:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-06 00:39:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2020-10-06 00:39:28,339 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2020-10-06 00:39:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:39:28,340 INFO L479 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2020-10-06 00:39:28,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:39:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2020-10-06 00:39:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 00:39:28,342 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:39:28,342 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:39:28,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 00:39:28,343 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:39:28,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:39:28,344 INFO L82 PathProgramCache]: Analyzing trace with hash 448965576, now seen corresponding path program 1 times [2020-10-06 00:39:28,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:39:28,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596014616] [2020-10-06 00:39:28,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:39:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:39:28,467 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-06 00:39:28,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596014616] [2020-10-06 00:39:28,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:39:28,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:39:28,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [258899886] [2020-10-06 00:39:28,468 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:39:28,470 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:39:28,471 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 00:39:28,472 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:39:28,472 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:39:28,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:39:28,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:39:28,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:39:28,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:39:28,474 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand 3 states. [2020-10-06 00:39:28,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:39:28,487 INFO L93 Difference]: Finished difference Result 490 states and 1480 transitions. [2020-10-06 00:39:28,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:39:28,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-06 00:39:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:39:28,494 INFO L225 Difference]: With dead ends: 490 [2020-10-06 00:39:28,494 INFO L226 Difference]: Without dead ends: 490 [2020-10-06 00:39:28,495 INFO L675 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-06 00:39:28,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-10-06 00:39:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2020-10-06 00:39:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2020-10-06 00:39:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1480 transitions. [2020-10-06 00:39:28,577 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1480 transitions. Word has length 9 [2020-10-06 00:39:28,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:39:28,578 INFO L479 AbstractCegarLoop]: Abstraction has 490 states and 1480 transitions. [2020-10-06 00:39:28,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:39:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1480 transitions. [2020-10-06 00:39:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 00:39:28,582 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:39:28,582 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:39:28,583 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 00:39:28,583 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:39:28,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:39:28,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1959199906, now seen corresponding path program 1 times [2020-10-06 00:39:28,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:39:28,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645243970] [2020-10-06 00:39:28,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:39:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:39:28,866 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-06 00:39:28,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645243970] [2020-10-06 00:39:28,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:39:28,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:39:28,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1739781542] [2020-10-06 00:39:28,867 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:39:28,869 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:39:28,876 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-06 00:39:28,877 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:39:28,877 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:39:28,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:39:28,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:39:28,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:39:28,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:39:28,880 INFO L87 Difference]: Start difference. First operand 490 states and 1480 transitions. Second operand 5 states. [2020-10-06 00:39:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:39:28,976 INFO L93 Difference]: Finished difference Result 474 states and 1420 transitions. [2020-10-06 00:39:28,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:39:28,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-06 00:39:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:39:28,982 INFO L225 Difference]: With dead ends: 474 [2020-10-06 00:39:28,982 INFO L226 Difference]: Without dead ends: 474 [2020-10-06 00:39:28,983 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:39:28,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2020-10-06 00:39:29,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2020-10-06 00:39:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2020-10-06 00:39:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1420 transitions. [2020-10-06 00:39:29,004 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1420 transitions. Word has length 11 [2020-10-06 00:39:29,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:39:29,004 INFO L479 AbstractCegarLoop]: Abstraction has 474 states and 1420 transitions. [2020-10-06 00:39:29,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:39:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1420 transitions. [2020-10-06 00:39:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 00:39:29,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:39:29,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:39:29,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 00:39:29,008 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:39:29,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:39:29,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1125078309, now seen corresponding path program 1 times [2020-10-06 00:39:29,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:39:29,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188958462] [2020-10-06 00:39:29,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:39:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:39:29,323 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-06 00:39:29,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188958462] [2020-10-06 00:39:29,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:39:29,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:39:29,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [685706271] [2020-10-06 00:39:29,325 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:39:29,327 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:39:29,330 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2020-10-06 00:39:29,331 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:39:29,370 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:39:29,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:39:29,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:39:29,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:39:29,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:39:29,372 INFO L87 Difference]: Start difference. First operand 474 states and 1420 transitions. Second operand 6 states. [2020-10-06 00:39:29,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:39:29,465 INFO L93 Difference]: Finished difference Result 510 states and 1543 transitions. [2020-10-06 00:39:29,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:39:29,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-06 00:39:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:39:29,472 INFO L225 Difference]: With dead ends: 510 [2020-10-06 00:39:29,472 INFO L226 Difference]: Without dead ends: 510 [2020-10-06 00:39:29,474 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:39:29,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-10-06 00:39:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2020-10-06 00:39:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2020-10-06 00:39:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1543 transitions. [2020-10-06 00:39:29,492 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1543 transitions. Word has length 13 [2020-10-06 00:39:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:39:29,493 INFO L479 AbstractCegarLoop]: Abstraction has 510 states and 1543 transitions. [2020-10-06 00:39:29,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:39:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1543 transitions. [2020-10-06 00:39:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 00:39:29,501 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:39:29,501 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:39:29,501 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 00:39:29,501 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:39:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:39:29,502 INFO L82 PathProgramCache]: Analyzing trace with hash -501495855, now seen corresponding path program 2 times [2020-10-06 00:39:29,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:39:29,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904196310] [2020-10-06 00:39:29,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:39:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:39:29,738 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-06 00:39:29,738 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904196310] [2020-10-06 00:39:29,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:39:29,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:39:29,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1757173938] [2020-10-06 00:39:29,739 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:39:29,741 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:39:29,746 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 29 transitions. [2020-10-06 00:39:29,746 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:39:29,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:29,789 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:39:29,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:29,809 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:39:29,813 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:39:29,862 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7764#(and (= ~y~0 1) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0))] [2020-10-06 00:39:29,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:39:29,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:39:29,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:39:29,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:39:29,863 INFO L87 Difference]: Start difference. First operand 510 states and 1543 transitions. Second operand 7 states. [2020-10-06 00:39:30,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:39:30,024 INFO L93 Difference]: Finished difference Result 534 states and 1601 transitions. [2020-10-06 00:39:30,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:39:30,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-06 00:39:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:39:30,030 INFO L225 Difference]: With dead ends: 534 [2020-10-06 00:39:30,030 INFO L226 Difference]: Without dead ends: 534 [2020-10-06 00:39:30,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:39:30,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-10-06 00:39:30,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 490. [2020-10-06 00:39:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2020-10-06 00:39:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1460 transitions. [2020-10-06 00:39:30,048 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1460 transitions. Word has length 13 [2020-10-06 00:39:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:39:30,048 INFO L479 AbstractCegarLoop]: Abstraction has 490 states and 1460 transitions. [2020-10-06 00:39:30,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:39:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1460 transitions. [2020-10-06 00:39:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 00:39:30,050 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:39:30,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:39:30,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 00:39:30,051 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:39:30,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:39:30,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1595390273, now seen corresponding path program 1 times [2020-10-06 00:39:30,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:39:30,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843325339] [2020-10-06 00:39:30,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:39:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:39:30,155 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-06 00:39:30,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843325339] [2020-10-06 00:39:30,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:39:30,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:39:30,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1180190483] [2020-10-06 00:39:30,156 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:39:30,158 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:39:30,161 INFO L258 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-06 00:39:30,161 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:39:30,162 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:39:30,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:39:30,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:39:30,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:39:30,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:39:30,163 INFO L87 Difference]: Start difference. First operand 490 states and 1460 transitions. Second operand 4 states. [2020-10-06 00:39:30,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:39:30,199 INFO L93 Difference]: Finished difference Result 474 states and 1251 transitions. [2020-10-06 00:39:30,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:39:30,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-06 00:39:30,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:39:30,202 INFO L225 Difference]: With dead ends: 474 [2020-10-06 00:39:30,203 INFO L226 Difference]: Without dead ends: 346 [2020-10-06 00:39:30,203 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:39:30,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-10-06 00:39:30,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2020-10-06 00:39:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-10-06 00:39:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 884 transitions. [2020-10-06 00:39:30,215 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 884 transitions. Word has length 13 [2020-10-06 00:39:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:39:30,216 INFO L479 AbstractCegarLoop]: Abstraction has 346 states and 884 transitions. [2020-10-06 00:39:30,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:39:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 884 transitions. [2020-10-06 00:39:30,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 00:39:30,217 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:39:30,217 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:39:30,217 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 00:39:30,217 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:39:30,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:39:30,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1177042995, now seen corresponding path program 1 times [2020-10-06 00:39:30,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:39:30,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743306633] [2020-10-06 00:39:30,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:39:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:39:30,302 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-06 00:39:30,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743306633] [2020-10-06 00:39:30,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:39:30,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:39:30,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2056017933] [2020-10-06 00:39:30,303 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:39:30,305 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:39:30,308 INFO L258 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-10-06 00:39:30,308 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:39:30,308 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:39:30,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:39:30,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:39:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:39:30,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:39:30,309 INFO L87 Difference]: Start difference. First operand 346 states and 884 transitions. Second operand 5 states. [2020-10-06 00:39:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:39:30,361 INFO L93 Difference]: Finished difference Result 282 states and 663 transitions. [2020-10-06 00:39:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:39:30,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-06 00:39:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:39:30,363 INFO L225 Difference]: With dead ends: 282 [2020-10-06 00:39:30,363 INFO L226 Difference]: Without dead ends: 217 [2020-10-06 00:39:30,364 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:39:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-10-06 00:39:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-10-06 00:39:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-10-06 00:39:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 497 transitions. [2020-10-06 00:39:30,371 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 497 transitions. Word has length 14 [2020-10-06 00:39:30,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:39:30,372 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 497 transitions. [2020-10-06 00:39:30,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:39:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 497 transitions. [2020-10-06 00:39:30,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 00:39:30,373 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:39:30,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:39:30,374 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 00:39:30,374 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:39:30,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:39:30,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1466680104, now seen corresponding path program 1 times [2020-10-06 00:39:30,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:39:30,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601783990] [2020-10-06 00:39:30,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:39:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:39:30,463 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-06 00:39:30,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601783990] [2020-10-06 00:39:30,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:39:30,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:39:30,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1495156327] [2020-10-06 00:39:30,464 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:39:30,468 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:39:30,505 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 25 transitions. [2020-10-06 00:39:30,505 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:39:30,528 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:39:30,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:39:30,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:39:30,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:39:30,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:39:30,529 INFO L87 Difference]: Start difference. First operand 217 states and 497 transitions. Second operand 6 states. [2020-10-06 00:39:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:39:30,590 INFO L93 Difference]: Finished difference Result 195 states and 451 transitions. [2020-10-06 00:39:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:39:30,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-06 00:39:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:39:30,593 INFO L225 Difference]: With dead ends: 195 [2020-10-06 00:39:30,593 INFO L226 Difference]: Without dead ends: 181 [2020-10-06 00:39:30,593 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:39:30,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-06 00:39:30,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2020-10-06 00:39:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-10-06 00:39:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 407 transitions. [2020-10-06 00:39:30,600 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 407 transitions. Word has length 17 [2020-10-06 00:39:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:39:30,600 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 407 transitions. [2020-10-06 00:39:30,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:39:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 407 transitions. [2020-10-06 00:39:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 00:39:30,601 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:39:30,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-06 00:39:30,602 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 00:39:30,602 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:39:30,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:39:30,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1124172184, now seen corresponding path program 1 times [2020-10-06 00:39:30,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:39:30,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86493786] [2020-10-06 00:39:30,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:39:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:39:30,682 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-06 00:39:30,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86493786] [2020-10-06 00:39:30,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:39:30,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:39:30,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [698848480] [2020-10-06 00:39:30,684 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:39:30,687 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:39:30,698 INFO L258 McrAutomatonBuilder]: Finished intersection with 42 states and 63 transitions. [2020-10-06 00:39:30,699 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:39:30,785 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:39:30,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:39:30,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:39:30,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:39:30,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:39:30,787 INFO L87 Difference]: Start difference. First operand 173 states and 407 transitions. Second operand 4 states. [2020-10-06 00:39:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:39:30,805 INFO L93 Difference]: Finished difference Result 239 states and 545 transitions. [2020-10-06 00:39:30,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:39:30,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-06 00:39:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:39:30,807 INFO L225 Difference]: With dead ends: 239 [2020-10-06 00:39:30,807 INFO L226 Difference]: Without dead ends: 109 [2020-10-06 00:39:30,808 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-06 00:39:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-06 00:39:30,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-06 00:39:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-06 00:39:30,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 223 transitions. [2020-10-06 00:39:30,812 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 223 transitions. Word has length 21 [2020-10-06 00:39:30,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:39:30,812 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 223 transitions. [2020-10-06 00:39:30,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:39:30,812 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 223 transitions. [2020-10-06 00:39:30,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 00:39:30,813 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:39:30,813 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-06 00:39:30,813 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 00:39:30,813 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:39:30,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:39:30,814 INFO L82 PathProgramCache]: Analyzing trace with hash -703904360, now seen corresponding path program 2 times [2020-10-06 00:39:30,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:39:30,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401130937] [2020-10-06 00:39:30,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:39:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:39:31,160 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-06 00:39:31,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401130937] [2020-10-06 00:39:31,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:39:31,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-06 00:39:31,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2030931669] [2020-10-06 00:39:31,162 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:39:31,164 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:39:31,173 INFO L258 McrAutomatonBuilder]: Finished intersection with 33 states and 43 transitions. [2020-10-06 00:39:31,173 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:39:31,213 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-10-06 00:39:31,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,215 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-10-06 00:39:31,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,218 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:39:31,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,220 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:39:31,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:39:31,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,268 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:39:31,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:39:31,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,306 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-10-06 00:39:31,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,308 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,310 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:39:31,311 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:39:31,329 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:39:31,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:39:31,351 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:39:31,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,364 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:39:31,365 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:39:31,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:39:31,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,396 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-06 00:39:31,401 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:39:31,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,440 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-10-06 00:39:31,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,441 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-10-06 00:39:31,441 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,442 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:39:31,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,444 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:39:31,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:39:31,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,462 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,478 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-10-06 00:39:31,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,480 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:39:31,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,488 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:39:31,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:39:31,491 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:39:31,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,511 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:39:31,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:39:31,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:39:31,526 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:39:31,533 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-06 00:39:31,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:39:31,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:39:31,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:39:31,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:39:31,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:39:31,596 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,612 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:39:31,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:39:31,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,663 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:39:31,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,668 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:39:31,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:39:31,684 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-06 00:39:31,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:39:31,818 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 24 [2020-10-06 00:39:31,836 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:39:31,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,838 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:39:31,841 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,861 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:39:31,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:31,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,958 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-06 00:39:31,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:31,993 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:32,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,031 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:39:32,037 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:39:32,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,118 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:39:32,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:32,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,149 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:39:32,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:39:32,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,241 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-06 00:39:32,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:39:32,279 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:39:32,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:32,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:32,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:32,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,286 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:39:32,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:32,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:32,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:39:32,306 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:39:32,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:32,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:39:32,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,329 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,334 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:39:32,335 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:39:32,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:39:32,351 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:39:32,367 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-06 00:39:32,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:39:32,397 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12199#(and (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$w_buff1~0 0) (or (and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0))) (and (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0))) (<= 0 ~y$r_buff0_thd0~0))] [2020-10-06 00:39:32,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 00:39:32,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:39:32,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 00:39:32,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:39:32,399 INFO L87 Difference]: Start difference. First operand 109 states and 223 transitions. Second operand 9 states. [2020-10-06 00:39:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:39:32,593 INFO L93 Difference]: Finished difference Result 135 states and 269 transitions. [2020-10-06 00:39:32,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-06 00:39:32,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-06 00:39:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:39:32,595 INFO L225 Difference]: With dead ends: 135 [2020-10-06 00:39:32,595 INFO L226 Difference]: Without dead ends: 109 [2020-10-06 00:39:32,596 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-06 00:39:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-06 00:39:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2020-10-06 00:39:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-06 00:39:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 195 transitions. [2020-10-06 00:39:32,600 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 195 transitions. Word has length 21 [2020-10-06 00:39:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:39:32,600 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 195 transitions. [2020-10-06 00:39:32,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 00:39:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 195 transitions. [2020-10-06 00:39:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 00:39:32,601 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:39:32,601 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-06 00:39:32,601 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 00:39:32,602 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:39:32,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:39:32,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1796278554, now seen corresponding path program 3 times [2020-10-06 00:39:32,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:39:32,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670842442] [2020-10-06 00:39:32,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:39:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:39:32,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:39:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:39:32,686 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:39:32,720 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 00:39:32,720 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 00:39:32,721 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-06 00:39:32,722 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 00:39:32,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L3-->L830: Formula: (let ((.cse6 (= 0 (mod ~y$r_buff1_thd0~0_In-1892319194 256))) (.cse7 (= (mod ~y$w_buff1_used~0_In-1892319194 256) 0)) (.cse8 (= (mod ~y$w_buff0_used~0_In-1892319194 256) 0)) (.cse9 (= (mod ~y$r_buff0_thd0~0_In-1892319194 256) 0))) (let ((.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (or (and .cse0 (= ~y$w_buff0_used~0_Out-1892319194 0) .cse1) (and .cse2 (= ~y$w_buff0_used~0_Out-1892319194 ~y$w_buff0_used~0_In-1892319194))) (or (and (or (and .cse3 (= ~y~0_Out-1892319194 ~y~0_In-1892319194)) (and .cse4 .cse5 (= ~y$w_buff1~0_In-1892319194 ~y~0_Out-1892319194))) .cse2) (and .cse0 (= ~y~0_Out-1892319194 ~y$w_buff0~0_In-1892319194) .cse1)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-1892319194 0)) (= ~y$r_buff0_thd0~0_In-1892319194 ~y$r_buff0_thd0~0_Out-1892319194) (= ~y$r_buff1_thd0~0_In-1892319194 ~y$r_buff1_thd0~0_Out-1892319194) (or (and .cse4 (= ~y$w_buff1_used~0_Out-1892319194 0) .cse5) (and .cse3 (= ~y$w_buff1_used~0_In-1892319194 ~y$w_buff1_used~0_Out-1892319194)))))) InVars {ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1892319194, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1892319194, ~y$w_buff1~0=~y$w_buff1~0_In-1892319194, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1892319194, ~y$w_buff0~0=~y$w_buff0~0_In-1892319194, ~y~0=~y~0_In-1892319194, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1892319194, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1892319194} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1892319194, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1892319194|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1892319194|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1892319194|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1892319194|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1892319194|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1892319194|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1892319194, ~y$w_buff1~0=~y$w_buff1~0_In-1892319194, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1892319194, ~y$w_buff0~0=~y$w_buff0~0_In-1892319194, ~y~0=~y~0_Out-1892319194, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1892319194, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1892319194} AuxVars[] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-06 00:39:32,756 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-06 00:39:32,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,759 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-06 00:39:32,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,759 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-06 00:39:32,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,760 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-06 00:39:32,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,761 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-06 00:39:32,761 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,761 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-06 00:39:32,761 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,761 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-06 00:39:32,762 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,762 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-06 00:39:32,762 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,763 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-06 00:39:32,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,763 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-06 00:39:32,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,764 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-06 00:39:32,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,764 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-06 00:39:32,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,765 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-06 00:39:32,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,766 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-06 00:39:32,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,766 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-06 00:39:32,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,766 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-06 00:39:32,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,767 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-06 00:39:32,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,771 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-06 00:39:32,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,772 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-06 00:39:32,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,772 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-06 00:39:32,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,772 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-06 00:39:32,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,773 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-06 00:39:32,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,773 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-06 00:39:32,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:39:32,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 12:39:32 BasicIcfg [2020-10-06 00:39:32,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 00:39:32,880 INFO L168 Benchmark]: Toolchain (without parser) took 16520.45 ms. Allocated memory was 146.3 MB in the beginning and 400.6 MB in the end (delta: 254.3 MB). Free memory was 100.5 MB in the beginning and 212.8 MB in the end (delta: -112.2 MB). Peak memory consumption was 142.0 MB. Max. memory is 7.1 GB. [2020-10-06 00:39:32,885 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-10-06 00:39:32,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.28 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 100.3 MB in the beginning and 156.7 MB in the end (delta: -56.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-10-06 00:39:32,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.73 ms. Allocated memory is still 202.9 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-06 00:39:32,887 INFO L168 Benchmark]: Boogie Preprocessor took 50.51 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-06 00:39:32,888 INFO L168 Benchmark]: RCFGBuilder took 2093.05 ms. Allocated memory was 202.9 MB in the beginning and 250.1 MB in the end (delta: 47.2 MB). Free memory was 151.3 MB in the beginning and 197.1 MB in the end (delta: -45.8 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. [2020-10-06 00:39:32,892 INFO L168 Benchmark]: TraceAbstraction took 13471.05 ms. Allocated memory was 250.1 MB in the beginning and 400.6 MB in the end (delta: 150.5 MB). Free memory was 197.1 MB in the beginning and 212.8 MB in the end (delta: -15.6 MB). Peak memory consumption was 134.8 MB. Max. memory is 7.1 GB. [2020-10-06 00:39:32,898 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 829.28 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 100.3 MB in the beginning and 156.7 MB in the end (delta: -56.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.73 ms. Allocated memory is still 202.9 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.51 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2093.05 ms. Allocated memory was 202.9 MB in the beginning and 250.1 MB in the end (delta: 47.2 MB). Free memory was 151.3 MB in the beginning and 197.1 MB in the end (delta: -45.8 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13471.05 ms. Allocated memory was 250.1 MB in the beginning and 400.6 MB in the end (delta: 150.5 MB). Free memory was 197.1 MB in the beginning and 212.8 MB in the end (delta: -15.6 MB). Peak memory consumption was 134.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.1s, 104 ProgramPointsBefore, 36 ProgramPointsAfterwards, 96 TransitionsBefore, 26 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 910 VarBasedMoverChecksPositive, 38 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4134 CheckedPairsTotal, 79 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L704] 0 int __unbuffered_p2_EBX = 0; [L706] 0 int a = 0; [L707] 0 _Bool main$tmp_guard0; [L708] 0 _Bool main$tmp_guard1; [L710] 0 int x = 0; [L712] 0 int y = 0; [L713] 0 _Bool y$flush_delayed; [L714] 0 int y$mem_tmp; [L715] 0 _Bool y$r_buff0_thd0; [L716] 0 _Bool y$r_buff0_thd1; [L717] 0 _Bool y$r_buff0_thd2; [L718] 0 _Bool y$r_buff0_thd3; [L719] 0 _Bool y$r_buff1_thd0; [L720] 0 _Bool y$r_buff1_thd1; [L721] 0 _Bool y$r_buff1_thd2; [L722] 0 _Bool y$r_buff1_thd3; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L730] 0 int z = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L814] 0 pthread_t t1120; [L815] FCALL, FORK 0 pthread_create(&t1120, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] 0 pthread_t t1121; [L817] FCALL, FORK 0 pthread_create(&t1121, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] 0 pthread_t t1122; [L819] FCALL, FORK 0 pthread_create(&t1122, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 3 y$w_buff1 = y$w_buff0 [L772] 3 y$w_buff0 = 2 [L773] 3 y$w_buff1_used = y$w_buff0_used [L774] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L776] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L780] 3 y$r_buff0_thd3 = (_Bool)1 [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L746] 1 return 0; [L751] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L761] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L833] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L834] 0 y$flush_delayed = weak$$choice2 [L835] 0 y$mem_tmp = y [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L839] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L841] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L844] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L844] 0 y = y$flush_delayed ? y$mem_tmp : y [L845] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.1s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.2s, HoareTripleCheckerStatistics: 255 SDtfs, 291 SDslu, 406 SDs, 0 SdLazy, 204 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.1s 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 64 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 19181 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...