/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 21:55:13,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 21:55:13,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 21:55:14,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 21:55:14,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 21:55:14,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 21:55:14,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 21:55:14,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 21:55:14,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 21:55:14,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 21:55:14,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 21:55:14,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 21:55:14,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 21:55:14,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 21:55:14,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 21:55:14,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 21:55:14,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 21:55:14,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 21:55:14,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 21:55:14,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 21:55:14,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 21:55:14,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 21:55:14,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 21:55:14,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 21:55:14,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 21:55:14,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 21:55:14,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 21:55:14,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 21:55:14,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 21:55:14,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 21:55:14,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 21:55:14,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 21:55:14,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 21:55:14,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 21:55:14,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 21:55:14,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 21:55:14,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 21:55:14,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 21:55:14,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 21:55:14,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 21:55:14,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 21:55:14,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-21 21:55:14,132 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 21:55:14,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 21:55:14,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 21:55:14,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 21:55:14,135 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 21:55:14,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 21:55:14,136 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 21:55:14,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 21:55:14,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 21:55:14,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 21:55:14,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 21:55:14,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 21:55:14,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 21:55:14,137 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 21:55:14,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 21:55:14,138 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 21:55:14,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 21:55:14,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 21:55:14,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 21:55:14,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 21:55:14,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 21:55:14,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 21:55:14,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 21:55:14,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-21 21:55:14,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 21:55:14,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 21:55:14,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 21:55:14,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 21:55:14,142 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-21 21:55:14,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-21 21:55:14,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 21:55:14,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 21:55:14,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 21:55:14,486 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 21:55:14,488 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 21:55:14,489 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2020-10-21 21:55:14,558 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e734fdd/2793ddd3875c43f6a40f4e044348eca5/FLAG3e7d4dfe7 [2020-10-21 21:55:15,122 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 21:55:15,123 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2020-10-21 21:55:15,143 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e734fdd/2793ddd3875c43f6a40f4e044348eca5/FLAG3e7d4dfe7 [2020-10-21 21:55:15,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e734fdd/2793ddd3875c43f6a40f4e044348eca5 [2020-10-21 21:55:15,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 21:55:15,465 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 21:55:15,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 21:55:15,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 21:55:15,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 21:55:15,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:55:15" (1/1) ... [2020-10-21 21:55:15,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@583129f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:15, skipping insertion in model container [2020-10-21 21:55:15,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:55:15" (1/1) ... [2020-10-21 21:55:15,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 21:55:15,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 21:55:16,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:55:16,081 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 21:55:16,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:55:16,232 INFO L208 MainTranslator]: Completed translation [2020-10-21 21:55:16,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:16 WrapperNode [2020-10-21 21:55:16,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 21:55:16,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 21:55:16,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 21:55:16,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 21:55:16,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:16" (1/1) ... [2020-10-21 21:55:16,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:16" (1/1) ... [2020-10-21 21:55:16,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 21:55:16,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 21:55:16,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 21:55:16,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 21:55:16,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:16" (1/1) ... [2020-10-21 21:55:16,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:16" (1/1) ... [2020-10-21 21:55:16,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:16" (1/1) ... [2020-10-21 21:55:16,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:16" (1/1) ... [2020-10-21 21:55:16,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:16" (1/1) ... [2020-10-21 21:55:16,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:16" (1/1) ... [2020-10-21 21:55:16,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:16" (1/1) ... [2020-10-21 21:55:16,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 21:55:16,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 21:55:16,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 21:55:16,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 21:55:16,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 21:55:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 21:55:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 21:55:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 21:55:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 21:55:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 21:55:16,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 21:55:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 21:55:16,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 21:55:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 21:55:16,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 21:55:16,441 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 21:55:16,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 21:55:16,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 21:55:16,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 21:55:16,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 21:55:16,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 21:55:16,444 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 21:55:18,413 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 21:55:18,413 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 21:55:18,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:55:18 BoogieIcfgContainer [2020-10-21 21:55:18,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 21:55:18,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 21:55:18,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 21:55:18,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 21:55:18,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 09:55:15" (1/3) ... [2020-10-21 21:55:18,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a302d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:55:18, skipping insertion in model container [2020-10-21 21:55:18,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:55:16" (2/3) ... [2020-10-21 21:55:18,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a302d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:55:18, skipping insertion in model container [2020-10-21 21:55:18,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:55:18" (3/3) ... [2020-10-21 21:55:18,426 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_tso.opt.i [2020-10-21 21:55:18,438 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 21:55:18,438 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-21 21:55:18,446 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 21:55:18,447 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 21:55:18,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,481 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,481 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,484 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,484 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,487 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,487 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,487 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,489 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,497 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,497 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,500 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,501 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,501 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,502 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,502 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,505 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,505 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,507 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,507 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:55:18,509 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 21:55:18,523 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 21:55:18,546 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 21:55:18,547 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 21:55:18,547 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-21 21:55:18,547 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 21:55:18,547 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 21:55:18,547 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 21:55:18,547 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 21:55:18,548 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 21:55:18,563 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-21 21:55:18,566 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-10-21 21:55:18,569 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-10-21 21:55:18,572 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-10-21 21:55:18,628 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-10-21 21:55:18,629 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 21:55:18,634 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-10-21 21:55:18,639 INFO L116 LiptonReduction]: Number of co-enabled transitions 2830 [2020-10-21 21:55:18,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:55:18,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:18,892 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-10-21 21:55:19,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,536 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 21:55:19,648 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-21 21:55:19,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:19,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:19,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:19,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:19,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-21 21:55:19,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:19,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-21 21:55:19,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:19,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-21 21:55:19,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:19,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-21 21:55:19,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,228 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-21 21:55:21,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-21 21:55:21,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:21,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-21 21:55:21,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:22,196 WARN L193 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-21 21:55:22,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-21 21:55:22,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:22,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-21 21:55:22,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:22,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-21 21:55:22,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:22,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-21 21:55:22,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:55:22,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:22,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:22,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:22,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:22,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:22,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:22,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:22,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:22,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:22,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:22,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:22,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:22,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:22,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:22,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:22,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:23,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:23,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:23,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:23,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:23,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:23,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:23,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:23,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:23,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:23,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:23,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:23,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:23,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:55:23,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:23,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:55:23,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:55:23,548 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 21:55:23,650 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 21:55:24,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:55:24,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:55:24,670 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-21 21:55:25,415 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-10-21 21:55:25,621 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-21 21:55:25,635 INFO L131 LiptonReduction]: Checked pairs total: 7226 [2020-10-21 21:55:25,635 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-10-21 21:55:25,645 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-10-21 21:55:25,904 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-10-21 21:55:25,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-10-21 21:55:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 21:55:25,919 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:25,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:25,921 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:25,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash 961632752, now seen corresponding path program 1 times [2020-10-21 21:55:25,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:25,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830175194] [2020-10-21 21:55:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:26,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830175194] [2020-10-21 21:55:26,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:26,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 21:55:26,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532864712] [2020-10-21 21:55:26,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:55:26,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:26,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:55:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:55:26,292 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-10-21 21:55:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:26,418 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-10-21 21:55:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:55:26,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 21:55:26,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:26,465 INFO L225 Difference]: With dead ends: 3082 [2020-10-21 21:55:26,465 INFO L226 Difference]: Without dead ends: 2602 [2020-10-21 21:55:26,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:55:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-10-21 21:55:26,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-10-21 21:55:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-10-21 21:55:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-10-21 21:55:26,662 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-10-21 21:55:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:26,663 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-10-21 21:55:26,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:55:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-10-21 21:55:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 21:55:26,673 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:26,673 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:26,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 21:55:26,675 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:26,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:26,676 INFO L82 PathProgramCache]: Analyzing trace with hash 570752080, now seen corresponding path program 1 times [2020-10-21 21:55:26,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:26,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841856215] [2020-10-21 21:55:26,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:26,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841856215] [2020-10-21 21:55:26,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:26,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:55:26,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603848510] [2020-10-21 21:55:26,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:55:26,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:26,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:55:26,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:55:26,940 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 5 states. [2020-10-21 21:55:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:27,082 INFO L93 Difference]: Finished difference Result 3018 states and 11312 transitions. [2020-10-21 21:55:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:55:27,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 21:55:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:27,104 INFO L225 Difference]: With dead ends: 3018 [2020-10-21 21:55:27,104 INFO L226 Difference]: Without dead ends: 2538 [2020-10-21 21:55:27,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:55:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2020-10-21 21:55:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2020-10-21 21:55:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2538 states. [2020-10-21 21:55:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 9776 transitions. [2020-10-21 21:55:27,202 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 9776 transitions. Word has length 12 [2020-10-21 21:55:27,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:27,203 INFO L481 AbstractCegarLoop]: Abstraction has 2538 states and 9776 transitions. [2020-10-21 21:55:27,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:55:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 9776 transitions. [2020-10-21 21:55:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 21:55:27,205 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:27,205 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:27,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 21:55:27,206 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:27,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:27,206 INFO L82 PathProgramCache]: Analyzing trace with hash 522004274, now seen corresponding path program 1 times [2020-10-21 21:55:27,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:27,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729430426] [2020-10-21 21:55:27,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:27,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729430426] [2020-10-21 21:55:27,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:27,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:55:27,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864077814] [2020-10-21 21:55:27,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:55:27,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:27,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:55:27,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:55:27,311 INFO L87 Difference]: Start difference. First operand 2538 states and 9776 transitions. Second operand 5 states. [2020-10-21 21:55:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:27,436 INFO L93 Difference]: Finished difference Result 2858 states and 10692 transitions. [2020-10-21 21:55:27,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 21:55:27,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-21 21:55:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:27,458 INFO L225 Difference]: With dead ends: 2858 [2020-10-21 21:55:27,458 INFO L226 Difference]: Without dead ends: 2458 [2020-10-21 21:55:27,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:55:27,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2458 states. [2020-10-21 21:55:27,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2458 to 2458. [2020-10-21 21:55:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2458 states. [2020-10-21 21:55:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 9412 transitions. [2020-10-21 21:55:27,569 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 9412 transitions. Word has length 13 [2020-10-21 21:55:27,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:27,570 INFO L481 AbstractCegarLoop]: Abstraction has 2458 states and 9412 transitions. [2020-10-21 21:55:27,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:55:27,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 9412 transitions. [2020-10-21 21:55:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 21:55:27,573 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:27,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:27,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 21:55:27,574 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:27,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:27,575 INFO L82 PathProgramCache]: Analyzing trace with hash 2013479198, now seen corresponding path program 1 times [2020-10-21 21:55:27,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:27,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216769608] [2020-10-21 21:55:27,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:27,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216769608] [2020-10-21 21:55:27,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:27,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 21:55:27,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550757114] [2020-10-21 21:55:27,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:55:27,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:27,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:55:27,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:55:27,764 INFO L87 Difference]: Start difference. First operand 2458 states and 9412 transitions. Second operand 4 states. [2020-10-21 21:55:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:27,858 INFO L93 Difference]: Finished difference Result 2650 states and 9924 transitions. [2020-10-21 21:55:27,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:55:27,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 21:55:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:27,880 INFO L225 Difference]: With dead ends: 2650 [2020-10-21 21:55:27,881 INFO L226 Difference]: Without dead ends: 2362 [2020-10-21 21:55:27,881 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:55:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2020-10-21 21:55:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2020-10-21 21:55:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2020-10-21 21:55:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 9012 transitions. [2020-10-21 21:55:27,964 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 9012 transitions. Word has length 14 [2020-10-21 21:55:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:27,964 INFO L481 AbstractCegarLoop]: Abstraction has 2362 states and 9012 transitions. [2020-10-21 21:55:27,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:55:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 9012 transitions. [2020-10-21 21:55:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 21:55:27,967 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:27,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:27,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 21:55:27,968 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:27,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:27,968 INFO L82 PathProgramCache]: Analyzing trace with hash -860139530, now seen corresponding path program 1 times [2020-10-21 21:55:27,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:27,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519252682] [2020-10-21 21:55:27,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:28,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519252682] [2020-10-21 21:55:28,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:28,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 21:55:28,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112488679] [2020-10-21 21:55:28,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:55:28,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:28,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:55:28,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:55:28,033 INFO L87 Difference]: Start difference. First operand 2362 states and 9012 transitions. Second operand 4 states. [2020-10-21 21:55:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:28,075 INFO L93 Difference]: Finished difference Result 2578 states and 9570 transitions. [2020-10-21 21:55:28,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:55:28,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 21:55:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:28,095 INFO L225 Difference]: With dead ends: 2578 [2020-10-21 21:55:28,095 INFO L226 Difference]: Without dead ends: 2218 [2020-10-21 21:55:28,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:55:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2020-10-21 21:55:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2020-10-21 21:55:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2020-10-21 21:55:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2020-10-21 21:55:28,170 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 14 [2020-10-21 21:55:28,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:28,170 INFO L481 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2020-10-21 21:55:28,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:55:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2020-10-21 21:55:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 21:55:28,173 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:28,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:28,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 21:55:28,174 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:28,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:28,174 INFO L82 PathProgramCache]: Analyzing trace with hash -894564587, now seen corresponding path program 1 times [2020-10-21 21:55:28,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:28,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753797932] [2020-10-21 21:55:28,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:28,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:28,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753797932] [2020-10-21 21:55:28,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:28,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:55:28,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18188836] [2020-10-21 21:55:28,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 21:55:28,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:28,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 21:55:28,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:55:28,300 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 6 states. [2020-10-21 21:55:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:28,461 INFO L93 Difference]: Finished difference Result 2410 states and 8888 transitions. [2020-10-21 21:55:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 21:55:28,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-21 21:55:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:28,489 INFO L225 Difference]: With dead ends: 2410 [2020-10-21 21:55:28,490 INFO L226 Difference]: Without dead ends: 2122 [2020-10-21 21:55:28,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:55:28,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-10-21 21:55:28,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-10-21 21:55:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-10-21 21:55:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 7976 transitions. [2020-10-21 21:55:28,561 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 7976 transitions. Word has length 15 [2020-10-21 21:55:28,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:28,562 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 7976 transitions. [2020-10-21 21:55:28,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 21:55:28,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 7976 transitions. [2020-10-21 21:55:28,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 21:55:28,565 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:28,566 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:28,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 21:55:28,566 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:28,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:28,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1811455833, now seen corresponding path program 1 times [2020-10-21 21:55:28,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:28,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574034452] [2020-10-21 21:55:28,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:28,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574034452] [2020-10-21 21:55:28,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:28,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:55:28,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777379614] [2020-10-21 21:55:28,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 21:55:28,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:28,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 21:55:28,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:55:28,680 INFO L87 Difference]: Start difference. First operand 2122 states and 7976 transitions. Second operand 7 states. [2020-10-21 21:55:28,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:28,830 INFO L93 Difference]: Finished difference Result 2474 states and 9224 transitions. [2020-10-21 21:55:28,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:55:28,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-21 21:55:28,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:28,841 INFO L225 Difference]: With dead ends: 2474 [2020-10-21 21:55:28,842 INFO L226 Difference]: Without dead ends: 2282 [2020-10-21 21:55:28,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:55:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2020-10-21 21:55:28,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2020-10-21 21:55:28,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-10-21 21:55:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8632 transitions. [2020-10-21 21:55:28,986 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8632 transitions. Word has length 16 [2020-10-21 21:55:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:28,986 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8632 transitions. [2020-10-21 21:55:28,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 21:55:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8632 transitions. [2020-10-21 21:55:28,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 21:55:28,991 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:28,991 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:28,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 21:55:28,991 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:28,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:28,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2075999913, now seen corresponding path program 2 times [2020-10-21 21:55:28,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:28,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455281368] [2020-10-21 21:55:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:29,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455281368] [2020-10-21 21:55:29,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:29,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:55:29,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876519877] [2020-10-21 21:55:29,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 21:55:29,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:29,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 21:55:29,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:55:29,117 INFO L87 Difference]: Start difference. First operand 2282 states and 8632 transitions. Second operand 7 states. [2020-10-21 21:55:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:29,509 INFO L93 Difference]: Finished difference Result 2762 states and 10248 transitions. [2020-10-21 21:55:29,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-21 21:55:29,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-21 21:55:29,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:29,521 INFO L225 Difference]: With dead ends: 2762 [2020-10-21 21:55:29,521 INFO L226 Difference]: Without dead ends: 2506 [2020-10-21 21:55:29,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-10-21 21:55:29,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-10-21 21:55:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2346. [2020-10-21 21:55:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2346 states. [2020-10-21 21:55:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 8744 transitions. [2020-10-21 21:55:29,601 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 8744 transitions. Word has length 16 [2020-10-21 21:55:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:29,602 INFO L481 AbstractCegarLoop]: Abstraction has 2346 states and 8744 transitions. [2020-10-21 21:55:29,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 21:55:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 8744 transitions. [2020-10-21 21:55:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 21:55:29,607 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:29,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:29,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 21:55:29,607 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:29,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:29,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1979324700, now seen corresponding path program 1 times [2020-10-21 21:55:29,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:29,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201666215] [2020-10-21 21:55:29,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:29,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201666215] [2020-10-21 21:55:29,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:29,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 21:55:29,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622798744] [2020-10-21 21:55:29,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 21:55:29,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:29,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 21:55:29,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:55:29,821 INFO L87 Difference]: Start difference. First operand 2346 states and 8744 transitions. Second operand 8 states. [2020-10-21 21:55:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:29,983 INFO L93 Difference]: Finished difference Result 2922 states and 10872 transitions. [2020-10-21 21:55:29,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:55:29,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-10-21 21:55:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:29,995 INFO L225 Difference]: With dead ends: 2922 [2020-10-21 21:55:29,995 INFO L226 Difference]: Without dead ends: 2794 [2020-10-21 21:55:29,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-21 21:55:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2794 states. [2020-10-21 21:55:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2506. [2020-10-21 21:55:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-10-21 21:55:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9400 transitions. [2020-10-21 21:55:30,070 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 9400 transitions. Word has length 17 [2020-10-21 21:55:30,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:30,071 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 9400 transitions. [2020-10-21 21:55:30,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 21:55:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 9400 transitions. [2020-10-21 21:55:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 21:55:30,076 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:30,077 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:30,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 21:55:30,077 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:30,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:30,080 INFO L82 PathProgramCache]: Analyzing trace with hash 68230876, now seen corresponding path program 2 times [2020-10-21 21:55:30,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:30,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260104629] [2020-10-21 21:55:30,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:30,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260104629] [2020-10-21 21:55:30,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:30,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 21:55:30,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47020191] [2020-10-21 21:55:30,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 21:55:30,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:30,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 21:55:30,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:55:30,294 INFO L87 Difference]: Start difference. First operand 2506 states and 9400 transitions. Second operand 8 states. [2020-10-21 21:55:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:30,531 INFO L93 Difference]: Finished difference Result 2506 states and 9304 transitions. [2020-10-21 21:55:30,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:55:30,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-10-21 21:55:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:30,544 INFO L225 Difference]: With dead ends: 2506 [2020-10-21 21:55:30,545 INFO L226 Difference]: Without dead ends: 2378 [2020-10-21 21:55:30,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-21 21:55:30,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2020-10-21 21:55:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 1930. [2020-10-21 21:55:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1930 states. [2020-10-21 21:55:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 7176 transitions. [2020-10-21 21:55:30,626 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 7176 transitions. Word has length 17 [2020-10-21 21:55:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:30,627 INFO L481 AbstractCegarLoop]: Abstraction has 1930 states and 7176 transitions. [2020-10-21 21:55:30,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 21:55:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 7176 transitions. [2020-10-21 21:55:30,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 21:55:30,706 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:30,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:30,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 21:55:30,707 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:30,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:30,707 INFO L82 PathProgramCache]: Analyzing trace with hash -684451050, now seen corresponding path program 1 times [2020-10-21 21:55:30,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:30,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56929750] [2020-10-21 21:55:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:30,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56929750] [2020-10-21 21:55:30,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:30,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:55:30,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147155592] [2020-10-21 21:55:30,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:55:30,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:30,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:55:30,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:55:30,807 INFO L87 Difference]: Start difference. First operand 1930 states and 7176 transitions. Second operand 4 states. [2020-10-21 21:55:30,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:30,856 INFO L93 Difference]: Finished difference Result 1990 states and 6760 transitions. [2020-10-21 21:55:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:55:30,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-21 21:55:30,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:30,862 INFO L225 Difference]: With dead ends: 1990 [2020-10-21 21:55:30,862 INFO L226 Difference]: Without dead ends: 1510 [2020-10-21 21:55:30,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:55:30,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2020-10-21 21:55:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2020-10-21 21:55:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2020-10-21 21:55:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 5076 transitions. [2020-10-21 21:55:30,906 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 5076 transitions. Word has length 17 [2020-10-21 21:55:30,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:30,906 INFO L481 AbstractCegarLoop]: Abstraction has 1510 states and 5076 transitions. [2020-10-21 21:55:30,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:55:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 5076 transitions. [2020-10-21 21:55:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 21:55:30,910 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:30,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:30,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 21:55:30,911 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:30,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:30,911 INFO L82 PathProgramCache]: Analyzing trace with hash -100869773, now seen corresponding path program 1 times [2020-10-21 21:55:30,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:30,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174381474] [2020-10-21 21:55:30,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:30,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174381474] [2020-10-21 21:55:30,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:30,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:55:30,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897296899] [2020-10-21 21:55:30,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:55:30,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:30,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:55:30,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:55:30,979 INFO L87 Difference]: Start difference. First operand 1510 states and 5076 transitions. Second operand 5 states. [2020-10-21 21:55:31,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:31,034 INFO L93 Difference]: Finished difference Result 1286 states and 3965 transitions. [2020-10-21 21:55:31,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 21:55:31,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-21 21:55:31,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:31,039 INFO L225 Difference]: With dead ends: 1286 [2020-10-21 21:55:31,040 INFO L226 Difference]: Without dead ends: 986 [2020-10-21 21:55:31,040 INFO L677 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-21 21:55:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2020-10-21 21:55:31,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2020-10-21 21:55:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2020-10-21 21:55:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2980 transitions. [2020-10-21 21:55:31,065 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2980 transitions. Word has length 18 [2020-10-21 21:55:31,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:31,065 INFO L481 AbstractCegarLoop]: Abstraction has 986 states and 2980 transitions. [2020-10-21 21:55:31,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:55:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2980 transitions. [2020-10-21 21:55:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 21:55:31,068 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:31,068 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] [2020-10-21 21:55:31,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 21:55:31,068 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:31,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:31,069 INFO L82 PathProgramCache]: Analyzing trace with hash 156009029, now seen corresponding path program 1 times [2020-10-21 21:55:31,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:31,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797771241] [2020-10-21 21:55:31,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:31,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797771241] [2020-10-21 21:55:31,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:31,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:55:31,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368223078] [2020-10-21 21:55:31,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 21:55:31,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:31,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 21:55:31,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:55:31,140 INFO L87 Difference]: Start difference. First operand 986 states and 2980 transitions. Second operand 6 states. [2020-10-21 21:55:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:31,261 INFO L93 Difference]: Finished difference Result 1487 states and 4378 transitions. [2020-10-21 21:55:31,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:55:31,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-21 21:55:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:31,266 INFO L225 Difference]: With dead ends: 1487 [2020-10-21 21:55:31,266 INFO L226 Difference]: Without dead ends: 1044 [2020-10-21 21:55:31,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:55:31,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2020-10-21 21:55:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1044. [2020-10-21 21:55:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2020-10-21 21:55:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 3104 transitions. [2020-10-21 21:55:31,294 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 3104 transitions. Word has length 20 [2020-10-21 21:55:31,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:31,294 INFO L481 AbstractCegarLoop]: Abstraction has 1044 states and 3104 transitions. [2020-10-21 21:55:31,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 21:55:31,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 3104 transitions. [2020-10-21 21:55:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 21:55:31,297 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:31,297 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] [2020-10-21 21:55:31,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 21:55:31,298 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:31,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash -52830075, now seen corresponding path program 2 times [2020-10-21 21:55:31,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:31,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997048254] [2020-10-21 21:55:31,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:31,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:31,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997048254] [2020-10-21 21:55:31,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:31,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:55:31,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552022824] [2020-10-21 21:55:31,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 21:55:31,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:31,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 21:55:31,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:55:31,373 INFO L87 Difference]: Start difference. First operand 1044 states and 3104 transitions. Second operand 6 states. [2020-10-21 21:55:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:31,486 INFO L93 Difference]: Finished difference Result 1395 states and 4020 transitions. [2020-10-21 21:55:31,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 21:55:31,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-21 21:55:31,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:31,491 INFO L225 Difference]: With dead ends: 1395 [2020-10-21 21:55:31,491 INFO L226 Difference]: Without dead ends: 1064 [2020-10-21 21:55:31,492 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-21 21:55:31,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2020-10-21 21:55:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 974. [2020-10-21 21:55:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2020-10-21 21:55:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 2794 transitions. [2020-10-21 21:55:31,518 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 2794 transitions. Word has length 20 [2020-10-21 21:55:31,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:31,519 INFO L481 AbstractCegarLoop]: Abstraction has 974 states and 2794 transitions. [2020-10-21 21:55:31,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 21:55:31,519 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 2794 transitions. [2020-10-21 21:55:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 21:55:31,522 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:31,522 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-21 21:55:31,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 21:55:31,523 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:31,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:31,523 INFO L82 PathProgramCache]: Analyzing trace with hash -513981036, now seen corresponding path program 1 times [2020-10-21 21:55:31,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:31,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64018038] [2020-10-21 21:55:31,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:31,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64018038] [2020-10-21 21:55:31,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:31,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:55:31,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977181831] [2020-10-21 21:55:31,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:55:31,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:31,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:55:31,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:55:31,587 INFO L87 Difference]: Start difference. First operand 974 states and 2794 transitions. Second operand 5 states. [2020-10-21 21:55:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:31,631 INFO L93 Difference]: Finished difference Result 1305 states and 3677 transitions. [2020-10-21 21:55:31,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:55:31,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-21 21:55:31,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:31,634 INFO L225 Difference]: With dead ends: 1305 [2020-10-21 21:55:31,634 INFO L226 Difference]: Without dead ends: 584 [2020-10-21 21:55:31,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:55:31,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-10-21 21:55:31,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2020-10-21 21:55:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-10-21 21:55:31,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1537 transitions. [2020-10-21 21:55:31,649 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1537 transitions. Word has length 21 [2020-10-21 21:55:31,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:31,649 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 1537 transitions. [2020-10-21 21:55:31,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:55:31,649 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1537 transitions. [2020-10-21 21:55:31,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 21:55:31,651 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:31,651 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-21 21:55:31,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 21:55:31,651 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:31,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:31,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1978467171, now seen corresponding path program 1 times [2020-10-21 21:55:31,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:31,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359769103] [2020-10-21 21:55:31,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:31,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359769103] [2020-10-21 21:55:31,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:31,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:55:31,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876228584] [2020-10-21 21:55:31,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 21:55:31,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:31,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 21:55:31,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:55:31,731 INFO L87 Difference]: Start difference. First operand 584 states and 1537 transitions. Second operand 6 states. [2020-10-21 21:55:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:31,797 INFO L93 Difference]: Finished difference Result 469 states and 1175 transitions. [2020-10-21 21:55:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:55:31,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-21 21:55:31,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:31,801 INFO L225 Difference]: With dead ends: 469 [2020-10-21 21:55:31,801 INFO L226 Difference]: Without dead ends: 400 [2020-10-21 21:55:31,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-21 21:55:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2020-10-21 21:55:31,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2020-10-21 21:55:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-10-21 21:55:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1007 transitions. [2020-10-21 21:55:31,810 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1007 transitions. Word has length 21 [2020-10-21 21:55:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:31,810 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 1007 transitions. [2020-10-21 21:55:31,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 21:55:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1007 transitions. [2020-10-21 21:55:31,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 21:55:31,812 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:31,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:31,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 21:55:31,812 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:31,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:31,813 INFO L82 PathProgramCache]: Analyzing trace with hash -506826856, now seen corresponding path program 1 times [2020-10-21 21:55:31,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:31,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821417322] [2020-10-21 21:55:31,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:31,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821417322] [2020-10-21 21:55:31,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:31,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 21:55:31,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298754294] [2020-10-21 21:55:31,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 21:55:31,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:31,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 21:55:31,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:55:31,895 INFO L87 Difference]: Start difference. First operand 400 states and 1007 transitions. Second operand 7 states. [2020-10-21 21:55:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:31,964 INFO L93 Difference]: Finished difference Result 369 states and 944 transitions. [2020-10-21 21:55:31,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 21:55:31,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-21 21:55:31,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:31,965 INFO L225 Difference]: With dead ends: 369 [2020-10-21 21:55:31,965 INFO L226 Difference]: Without dead ends: 220 [2020-10-21 21:55:31,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:55:31,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-10-21 21:55:31,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2020-10-21 21:55:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-10-21 21:55:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 541 transitions. [2020-10-21 21:55:31,970 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 541 transitions. Word has length 24 [2020-10-21 21:55:31,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:31,971 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 541 transitions. [2020-10-21 21:55:31,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 21:55:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 541 transitions. [2020-10-21 21:55:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 21:55:31,972 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:31,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:31,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 21:55:31,972 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:31,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:31,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1954672749, now seen corresponding path program 1 times [2020-10-21 21:55:31,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:31,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683043361] [2020-10-21 21:55:31,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:32,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683043361] [2020-10-21 21:55:32,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:32,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:55:32,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029088407] [2020-10-21 21:55:32,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 21:55:32,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:32,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 21:55:32,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:55:32,120 INFO L87 Difference]: Start difference. First operand 220 states and 541 transitions. Second operand 7 states. [2020-10-21 21:55:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:32,230 INFO L93 Difference]: Finished difference Result 377 states and 949 transitions. [2020-10-21 21:55:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:55:32,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-21 21:55:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:32,231 INFO L225 Difference]: With dead ends: 377 [2020-10-21 21:55:32,231 INFO L226 Difference]: Without dead ends: 181 [2020-10-21 21:55:32,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-21 21:55:32,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-21 21:55:32,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2020-10-21 21:55:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-10-21 21:55:32,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 451 transitions. [2020-10-21 21:55:32,236 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 451 transitions. Word has length 27 [2020-10-21 21:55:32,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:32,237 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 451 transitions. [2020-10-21 21:55:32,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 21:55:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 451 transitions. [2020-10-21 21:55:32,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 21:55:32,238 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:32,238 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:32,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 21:55:32,238 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:32,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:32,239 INFO L82 PathProgramCache]: Analyzing trace with hash 509129051, now seen corresponding path program 2 times [2020-10-21 21:55:32,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:32,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567090864] [2020-10-21 21:55:32,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:32,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567090864] [2020-10-21 21:55:32,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:32,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 21:55:32,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497821780] [2020-10-21 21:55:32,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 21:55:32,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:32,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 21:55:32,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-21 21:55:32,413 INFO L87 Difference]: Start difference. First operand 181 states and 451 transitions. Second operand 9 states. [2020-10-21 21:55:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:32,680 INFO L93 Difference]: Finished difference Result 324 states and 787 transitions. [2020-10-21 21:55:32,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 21:55:32,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-21 21:55:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:32,681 INFO L225 Difference]: With dead ends: 324 [2020-10-21 21:55:32,682 INFO L226 Difference]: Without dead ends: 118 [2020-10-21 21:55:32,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-10-21 21:55:32,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-21 21:55:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 93. [2020-10-21 21:55:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-21 21:55:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 199 transitions. [2020-10-21 21:55:32,685 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 199 transitions. Word has length 27 [2020-10-21 21:55:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:32,685 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 199 transitions. [2020-10-21 21:55:32,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 21:55:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 199 transitions. [2020-10-21 21:55:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 21:55:32,686 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:32,686 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:32,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-21 21:55:32,686 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:32,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:32,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1748049593, now seen corresponding path program 3 times [2020-10-21 21:55:32,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:32,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540074473] [2020-10-21 21:55:32,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:55:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:55:32,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540074473] [2020-10-21 21:55:32,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:55:32,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:55:32,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926287819] [2020-10-21 21:55:32,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 21:55:32,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:55:32,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 21:55:32,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:55:32,806 INFO L87 Difference]: Start difference. First operand 93 states and 199 transitions. Second operand 7 states. [2020-10-21 21:55:32,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:55:32,873 INFO L93 Difference]: Finished difference Result 120 states and 254 transitions. [2020-10-21 21:55:32,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:55:32,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-21 21:55:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:55:32,874 INFO L225 Difference]: With dead ends: 120 [2020-10-21 21:55:32,874 INFO L226 Difference]: Without dead ends: 65 [2020-10-21 21:55:32,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:55:32,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-21 21:55:32,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-10-21 21:55:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-21 21:55:32,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-10-21 21:55:32,877 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 27 [2020-10-21 21:55:32,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:55:32,878 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-10-21 21:55:32,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 21:55:32,878 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-10-21 21:55:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 21:55:32,879 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:55:32,879 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:55:32,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-21 21:55:32,879 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:55:32,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:55:32,880 INFO L82 PathProgramCache]: Analyzing trace with hash -370388729, now seen corresponding path program 4 times [2020-10-21 21:55:32,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:55:32,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415294377] [2020-10-21 21:55:32,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:55:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 21:55:32,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 21:55:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 21:55:32,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 21:55:32,983 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 21:55:32,984 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 21:55:32,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-21 21:55:33,008 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,008 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,008 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,008 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [801] [2020-10-21 21:55:33,011 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,011 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,011 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,011 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,011 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,012 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,012 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,012 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,012 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,012 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,012 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,013 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,013 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,013 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,013 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,013 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,013 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,014 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,014 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,014 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,015 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,015 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,015 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,015 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,015 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,015 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,015 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,016 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,016 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,016 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,016 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,016 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,017 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,017 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,017 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,017 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,017 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,017 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,018 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,018 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,018 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,018 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,018 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,018 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,018 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,019 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,019 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,019 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,020 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:55:33,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:55:33,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 09:55:33 BasicIcfg [2020-10-21 21:55:33,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 21:55:33,104 INFO L168 Benchmark]: Toolchain (without parser) took 17644.82 ms. Allocated memory was 147.8 MB in the beginning and 535.3 MB in the end (delta: 387.4 MB). Free memory was 102.7 MB in the beginning and 336.7 MB in the end (delta: -234.0 MB). Peak memory consumption was 153.4 MB. Max. memory is 7.1 GB. [2020-10-21 21:55:33,104 INFO L168 Benchmark]: CDTParser took 4.04 ms. Allocated memory is still 147.8 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-21 21:55:33,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.26 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 101.6 MB in the beginning and 155.0 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2020-10-21 21:55:33,105 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.32 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 21:55:33,106 INFO L168 Benchmark]: Boogie Preprocessor took 47.87 ms. Allocated memory is still 204.5 MB. Free memory was 151.6 MB in the beginning and 149.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 21:55:33,107 INFO L168 Benchmark]: RCFGBuilder took 2050.42 ms. Allocated memory was 204.5 MB in the beginning and 245.4 MB in the end (delta: 40.9 MB). Free memory was 149.0 MB in the beginning and 168.9 MB in the end (delta: -19.9 MB). Peak memory consumption was 94.9 MB. Max. memory is 7.1 GB. [2020-10-21 21:55:33,107 INFO L168 Benchmark]: TraceAbstraction took 14683.66 ms. Allocated memory was 245.4 MB in the beginning and 535.3 MB in the end (delta: 289.9 MB). Free memory was 168.9 MB in the beginning and 336.7 MB in the end (delta: -167.9 MB). Peak memory consumption was 122.1 MB. Max. memory is 7.1 GB. [2020-10-21 21:55:33,111 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.04 ms. Allocated memory is still 147.8 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.26 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 101.6 MB in the beginning and 155.0 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.32 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.87 ms. Allocated memory is still 204.5 MB. Free memory was 151.6 MB in the beginning and 149.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2050.42 ms. Allocated memory was 204.5 MB in the beginning and 245.4 MB in the end (delta: 40.9 MB). Free memory was 149.0 MB in the beginning and 168.9 MB in the end (delta: -19.9 MB). Peak memory consumption was 94.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14683.66 ms. Allocated memory was 245.4 MB in the beginning and 535.3 MB in the end (delta: 289.9 MB). Free memory was 168.9 MB in the beginning and 336.7 MB in the end (delta: -167.9 MB). Peak memory consumption was 122.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1888 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 238 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.0s, 131 PlacesBefore, 46 PlacesAfterwards, 121 TransitionsBefore, 34 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 103 TotalNumberOfCompositions, 7226 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1245; [L847] FCALL, FORK 0 pthread_create(&t1245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1246; [L849] FCALL, FORK 0 pthread_create(&t1246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1247; [L851] FCALL, FORK 0 pthread_create(&t1247, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1248; [L853] FCALL, FORK 0 pthread_create(&t1248, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 4 !expression [L17] COND FALSE 4 !(0) [L17] 4 __assert_fail ("0", "mix046_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L782] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix046_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.4s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 793 SDtfs, 1042 SDslu, 1906 SDs, 0 SdLazy, 721 SolverSat, 160 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred 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: 1.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 1011 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 345 ConstructedInterpolants, 0 QuantifiedInterpolants, 44292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...