/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 22:58:18,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 22:58:18,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 22:58:18,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 22:58:18,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 22:58:18,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 22:58:18,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 22:58:18,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 22:58:18,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 22:58:18,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 22:58:18,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 22:58:18,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 22:58:18,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 22:58:18,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 22:58:18,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 22:58:18,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 22:58:18,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 22:58:18,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 22:58:18,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 22:58:18,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 22:58:18,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 22:58:18,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 22:58:18,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 22:58:18,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 22:58:18,276 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 22:58:18,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 22:58:18,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 22:58:18,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 22:58:18,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 22:58:18,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 22:58:18,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 22:58:18,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 22:58:18,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 22:58:18,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 22:58:18,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 22:58:18,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 22:58:18,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 22:58:18,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 22:58:18,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 22:58:18,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 22:58:18,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 22:58:18,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 22:58:18,310 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 22:58:18,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 22:58:18,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 22:58:18,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 22:58:18,312 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 22:58:18,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 22:58:18,312 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 22:58:18,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 22:58:18,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 22:58:18,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 22:58:18,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 22:58:18,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 22:58:18,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 22:58:18,313 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 22:58:18,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 22:58:18,314 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 22:58:18,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 22:58:18,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 22:58:18,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 22:58:18,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 22:58:18,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 22:58:18,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 22:58:18,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 22:58:18,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 22:58:18,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 22:58:18,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 22:58:18,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 22:58:18,316 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 22:58:18,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 22:58:18,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 22:58:18,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 22:58:18,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 22:58:18,636 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 22:58:18,637 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 22:58:18,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2020-10-21 22:58:18,705 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f2223a29/a48e1237cd7745cb938a1b175a71cd38/FLAG074816a4b [2020-10-21 22:58:19,227 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 22:58:19,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2020-10-21 22:58:19,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f2223a29/a48e1237cd7745cb938a1b175a71cd38/FLAG074816a4b [2020-10-21 22:58:19,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f2223a29/a48e1237cd7745cb938a1b175a71cd38 [2020-10-21 22:58:19,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 22:58:19,598 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 22:58:19,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 22:58:19,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 22:58:19,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 22:58:19,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:58:19" (1/1) ... [2020-10-21 22:58:19,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139a7bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:58:19, skipping insertion in model container [2020-10-21 22:58:19,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:58:19" (1/1) ... [2020-10-21 22:58:19,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 22:58:19,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 22:58:20,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:58:20,199 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 22:58:20,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:58:20,379 INFO L208 MainTranslator]: Completed translation [2020-10-21 22:58:20,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:58:20 WrapperNode [2020-10-21 22:58:20,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 22:58:20,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 22:58:20,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 22:58:20,381 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 22:58:20,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:58:20" (1/1) ... [2020-10-21 22:58:20,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:58:20" (1/1) ... [2020-10-21 22:58:20,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 22:58:20,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 22:58:20,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 22:58:20,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 22:58:20,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:58:20" (1/1) ... [2020-10-21 22:58:20,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:58:20" (1/1) ... [2020-10-21 22:58:20,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:58:20" (1/1) ... [2020-10-21 22:58:20,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:58:20" (1/1) ... [2020-10-21 22:58:20,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:58:20" (1/1) ... [2020-10-21 22:58:20,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:58:20" (1/1) ... [2020-10-21 22:58:20,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:58:20" (1/1) ... [2020-10-21 22:58:20,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 22:58:20,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 22:58:20,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 22:58:20,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 22:58:20,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:58:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 22:58:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 22:58:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 22:58:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 22:58:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 22:58:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 22:58:20,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 22:58:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 22:58:20,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 22:58:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 22:58:20,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 22:58:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 22:58:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 22:58:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 22:58:20,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 22:58:20,573 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 22:58:22,691 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 22:58:22,691 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 22:58:22,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:58:22 BoogieIcfgContainer [2020-10-21 22:58:22,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 22:58:22,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 22:58:22,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 22:58:22,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 22:58:22,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:58:19" (1/3) ... [2020-10-21 22:58:22,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b10f5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:58:22, skipping insertion in model container [2020-10-21 22:58:22,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:58:20" (2/3) ... [2020-10-21 22:58:22,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b10f5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:58:22, skipping insertion in model container [2020-10-21 22:58:22,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:58:22" (3/3) ... [2020-10-21 22:58:22,703 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2020-10-21 22:58:22,718 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 22:58:22,719 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 22:58:22,728 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 22:58:22,729 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 22:58:22,764 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,764 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,764 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,765 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,765 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,769 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,770 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,770 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,771 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,775 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,775 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,782 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,785 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,785 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,787 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,788 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,788 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,788 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,788 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,793 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,793 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:58:22,795 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 22:58:22,811 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 22:58:22,833 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 22:58:22,833 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 22:58:22,833 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 22:58:22,833 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 22:58:22,833 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 22:58:22,834 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 22:58:22,834 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 22:58:22,834 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 22:58:22,848 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 22:58:22,849 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 110 transitions, 235 flow [2020-10-21 22:58:22,852 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 110 transitions, 235 flow [2020-10-21 22:58:22,854 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 117 places, 110 transitions, 235 flow [2020-10-21 22:58:22,905 INFO L129 PetriNetUnfolder]: 3/107 cut-off events. [2020-10-21 22:58:22,905 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 22:58:22,911 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 3/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2020-10-21 22:58:22,915 INFO L116 LiptonReduction]: Number of co-enabled transitions 2250 [2020-10-21 22:58:23,342 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 22:58:23,470 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-21 22:58:23,773 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-21 22:58:25,392 WARN L193 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-21 22:58:25,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-21 22:58:25,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:58:25,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-21 22:58:25,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:58:26,621 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-10-21 22:58:27,085 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 22:58:27,195 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 22:58:28,320 WARN L193 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-21 22:58:28,745 WARN L193 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-21 22:58:29,008 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-10-21 22:58:30,141 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 140 DAG size of output: 131 [2020-10-21 22:58:30,552 WARN L193 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-21 22:58:31,183 WARN L193 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-10-21 22:58:31,500 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-21 22:58:32,184 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-21 22:58:32,629 WARN L193 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-10-21 22:58:33,093 WARN L193 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-10-21 22:58:33,296 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-21 22:58:33,327 INFO L131 LiptonReduction]: Checked pairs total: 6120 [2020-10-21 22:58:33,328 INFO L133 LiptonReduction]: Total number of compositions: 94 [2020-10-21 22:58:33,334 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 28 transitions, 71 flow [2020-10-21 22:58:33,401 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1132 states. [2020-10-21 22:58:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states. [2020-10-21 22:58:33,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 22:58:33,415 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:33,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 22:58:33,416 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:33,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:33,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1073645887, now seen corresponding path program 1 times [2020-10-21 22:58:33,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:33,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099276556] [2020-10-21 22:58:33,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:58:33,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099276556] [2020-10-21 22:58:33,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:33,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:58:33,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115248582] [2020-10-21 22:58:33,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:58:33,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:33,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:58:33,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:33,726 INFO L87 Difference]: Start difference. First operand 1132 states. Second operand 3 states. [2020-10-21 22:58:33,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:33,846 INFO L93 Difference]: Finished difference Result 972 states and 3118 transitions. [2020-10-21 22:58:33,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:58:33,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-21 22:58:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:33,881 INFO L225 Difference]: With dead ends: 972 [2020-10-21 22:58:33,881 INFO L226 Difference]: Without dead ends: 792 [2020-10-21 22:58:33,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:33,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2020-10-21 22:58:33,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2020-10-21 22:58:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-10-21 22:58:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2494 transitions. [2020-10-21 22:58:34,002 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2494 transitions. Word has length 5 [2020-10-21 22:58:34,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:34,005 INFO L481 AbstractCegarLoop]: Abstraction has 792 states and 2494 transitions. [2020-10-21 22:58:34,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:58:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2494 transitions. [2020-10-21 22:58:34,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 22:58:34,009 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:34,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:34,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 22:58:34,010 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:34,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:34,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1560698105, now seen corresponding path program 1 times [2020-10-21 22:58:34,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:34,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832855263] [2020-10-21 22:58:34,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:58:34,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832855263] [2020-10-21 22:58:34,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:34,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:58:34,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690523009] [2020-10-21 22:58:34,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:58:34,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:34,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:58:34,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:34,171 INFO L87 Difference]: Start difference. First operand 792 states and 2494 transitions. Second operand 3 states. [2020-10-21 22:58:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:34,186 INFO L93 Difference]: Finished difference Result 732 states and 2276 transitions. [2020-10-21 22:58:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:58:34,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 22:58:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:34,195 INFO L225 Difference]: With dead ends: 732 [2020-10-21 22:58:34,196 INFO L226 Difference]: Without dead ends: 732 [2020-10-21 22:58:34,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-10-21 22:58:34,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2020-10-21 22:58:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2020-10-21 22:58:34,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2276 transitions. [2020-10-21 22:58:34,225 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2276 transitions. Word has length 9 [2020-10-21 22:58:34,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:34,226 INFO L481 AbstractCegarLoop]: Abstraction has 732 states and 2276 transitions. [2020-10-21 22:58:34,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:58:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2276 transitions. [2020-10-21 22:58:34,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:58:34,229 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:34,229 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:34,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 22:58:34,230 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:34,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:34,230 INFO L82 PathProgramCache]: Analyzing trace with hash -887281155, now seen corresponding path program 1 times [2020-10-21 22:58:34,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:34,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346940723] [2020-10-21 22:58:34,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:58:34,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346940723] [2020-10-21 22:58:34,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:34,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:58:34,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53033837] [2020-10-21 22:58:34,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:58:34,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:34,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:58:34,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:34,308 INFO L87 Difference]: Start difference. First operand 732 states and 2276 transitions. Second operand 3 states. [2020-10-21 22:58:34,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:34,323 INFO L93 Difference]: Finished difference Result 692 states and 2134 transitions. [2020-10-21 22:58:34,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:58:34,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 22:58:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:34,329 INFO L225 Difference]: With dead ends: 692 [2020-10-21 22:58:34,329 INFO L226 Difference]: Without dead ends: 692 [2020-10-21 22:58:34,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:34,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2020-10-21 22:58:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2020-10-21 22:58:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2020-10-21 22:58:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 2134 transitions. [2020-10-21 22:58:34,350 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 2134 transitions. Word has length 11 [2020-10-21 22:58:34,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:34,351 INFO L481 AbstractCegarLoop]: Abstraction has 692 states and 2134 transitions. [2020-10-21 22:58:34,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:58:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 2134 transitions. [2020-10-21 22:58:34,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 22:58:34,354 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:34,355 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:34,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 22:58:34,355 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:34,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:34,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1991135112, now seen corresponding path program 1 times [2020-10-21 22:58:34,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:34,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763277266] [2020-10-21 22:58:34,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:58:34,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763277266] [2020-10-21 22:58:34,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:34,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:58:34,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830651134] [2020-10-21 22:58:34,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:58:34,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:34,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:58:34,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:58:34,519 INFO L87 Difference]: Start difference. First operand 692 states and 2134 transitions. Second operand 5 states. [2020-10-21 22:58:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:34,613 INFO L93 Difference]: Finished difference Result 720 states and 2216 transitions. [2020-10-21 22:58:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:58:34,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-21 22:58:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:34,620 INFO L225 Difference]: With dead ends: 720 [2020-10-21 22:58:34,620 INFO L226 Difference]: Without dead ends: 720 [2020-10-21 22:58:34,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2020-10-21 22:58:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2020-10-21 22:58:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2020-10-21 22:58:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 2216 transitions. [2020-10-21 22:58:34,644 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 2216 transitions. Word has length 13 [2020-10-21 22:58:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:34,645 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 2216 transitions. [2020-10-21 22:58:34,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:58:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 2216 transitions. [2020-10-21 22:58:34,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 22:58:34,649 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:34,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:34,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 22:58:34,649 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:34,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:34,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1951262149, now seen corresponding path program 1 times [2020-10-21 22:58:34,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:34,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862634565] [2020-10-21 22:58:34,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:58:34,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862634565] [2020-10-21 22:58:34,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:34,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:58:34,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72104324] [2020-10-21 22:58:34,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:58:34,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:34,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:58:34,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:34,834 INFO L87 Difference]: Start difference. First operand 720 states and 2216 transitions. Second operand 6 states. [2020-10-21 22:58:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:34,998 INFO L93 Difference]: Finished difference Result 860 states and 2630 transitions. [2020-10-21 22:58:34,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:58:34,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-21 22:58:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:35,005 INFO L225 Difference]: With dead ends: 860 [2020-10-21 22:58:35,005 INFO L226 Difference]: Without dead ends: 860 [2020-10-21 22:58:35,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-21 22:58:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2020-10-21 22:58:35,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 854. [2020-10-21 22:58:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2020-10-21 22:58:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 2611 transitions. [2020-10-21 22:58:35,039 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 2611 transitions. Word has length 15 [2020-10-21 22:58:35,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:35,040 INFO L481 AbstractCegarLoop]: Abstraction has 854 states and 2611 transitions. [2020-10-21 22:58:35,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:58:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 2611 transitions. [2020-10-21 22:58:35,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 22:58:35,043 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:35,043 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:35,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 22:58:35,043 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:35,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:35,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2142257583, now seen corresponding path program 1 times [2020-10-21 22:58:35,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:35,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851745016] [2020-10-21 22:58:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:58:35,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851745016] [2020-10-21 22:58:35,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:35,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:58:35,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737727081] [2020-10-21 22:58:35,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:58:35,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:35,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:58:35,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:35,266 INFO L87 Difference]: Start difference. First operand 854 states and 2611 transitions. Second operand 6 states. [2020-10-21 22:58:35,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:35,412 INFO L93 Difference]: Finished difference Result 846 states and 2583 transitions. [2020-10-21 22:58:35,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:58:35,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-21 22:58:35,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:35,420 INFO L225 Difference]: With dead ends: 846 [2020-10-21 22:58:35,420 INFO L226 Difference]: Without dead ends: 846 [2020-10-21 22:58:35,422 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:58:35,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2020-10-21 22:58:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2020-10-21 22:58:35,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2020-10-21 22:58:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 2583 transitions. [2020-10-21 22:58:35,456 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 2583 transitions. Word has length 15 [2020-10-21 22:58:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:35,457 INFO L481 AbstractCegarLoop]: Abstraction has 846 states and 2583 transitions. [2020-10-21 22:58:35,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:58:35,459 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 2583 transitions. [2020-10-21 22:58:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 22:58:35,461 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:35,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:35,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 22:58:35,464 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:35,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:35,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2074641561, now seen corresponding path program 1 times [2020-10-21 22:58:35,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:35,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634644746] [2020-10-21 22:58:35,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:58:35,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634644746] [2020-10-21 22:58:35,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:35,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:58:35,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319630902] [2020-10-21 22:58:35,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:58:35,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:35,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:58:35,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:35,563 INFO L87 Difference]: Start difference. First operand 846 states and 2583 transitions. Second operand 6 states. [2020-10-21 22:58:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:35,741 INFO L93 Difference]: Finished difference Result 1315 states and 3996 transitions. [2020-10-21 22:58:35,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:58:35,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-21 22:58:35,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:35,750 INFO L225 Difference]: With dead ends: 1315 [2020-10-21 22:58:35,750 INFO L226 Difference]: Without dead ends: 1006 [2020-10-21 22:58:35,750 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 22:58:35,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2020-10-21 22:58:35,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 966. [2020-10-21 22:58:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2020-10-21 22:58:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2889 transitions. [2020-10-21 22:58:35,786 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2889 transitions. Word has length 15 [2020-10-21 22:58:35,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:35,787 INFO L481 AbstractCegarLoop]: Abstraction has 966 states and 2889 transitions. [2020-10-21 22:58:35,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:58:35,787 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2889 transitions. [2020-10-21 22:58:35,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 22:58:35,789 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:35,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:35,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 22:58:35,790 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:35,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1078495143, now seen corresponding path program 2 times [2020-10-21 22:58:35,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:35,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134921642] [2020-10-21 22:58:35,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:58:35,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134921642] [2020-10-21 22:58:35,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:35,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:58:35,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032109146] [2020-10-21 22:58:35,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:58:35,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:35,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:58:35,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:58:35,881 INFO L87 Difference]: Start difference. First operand 966 states and 2889 transitions. Second operand 4 states. [2020-10-21 22:58:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:35,921 INFO L93 Difference]: Finished difference Result 910 states and 2413 transitions. [2020-10-21 22:58:35,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:58:35,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-21 22:58:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:35,926 INFO L225 Difference]: With dead ends: 910 [2020-10-21 22:58:35,926 INFO L226 Difference]: Without dead ends: 636 [2020-10-21 22:58:35,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:58:35,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-10-21 22:58:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2020-10-21 22:58:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2020-10-21 22:58:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1613 transitions. [2020-10-21 22:58:35,948 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1613 transitions. Word has length 15 [2020-10-21 22:58:35,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:35,948 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 1613 transitions. [2020-10-21 22:58:35,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:58:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1613 transitions. [2020-10-21 22:58:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:58:35,950 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:35,950 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:35,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 22:58:35,951 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:35,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:35,951 INFO L82 PathProgramCache]: Analyzing trace with hash -901968416, now seen corresponding path program 1 times [2020-10-21 22:58:35,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:35,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439698101] [2020-10-21 22:58:35,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:36,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:58:36,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439698101] [2020-10-21 22:58:36,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:36,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:58:36,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908105960] [2020-10-21 22:58:36,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:58:36,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:36,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:58:36,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:58:36,043 INFO L87 Difference]: Start difference. First operand 636 states and 1613 transitions. Second operand 5 states. [2020-10-21 22:58:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:36,093 INFO L93 Difference]: Finished difference Result 520 states and 1242 transitions. [2020-10-21 22:58:36,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:58:36,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-21 22:58:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:36,097 INFO L225 Difference]: With dead ends: 520 [2020-10-21 22:58:36,097 INFO L226 Difference]: Without dead ends: 401 [2020-10-21 22:58:36,097 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 22:58:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2020-10-21 22:58:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 341. [2020-10-21 22:58:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-10-21 22:58:36,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 797 transitions. [2020-10-21 22:58:36,107 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 797 transitions. Word has length 16 [2020-10-21 22:58:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:36,108 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 797 transitions. [2020-10-21 22:58:36,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:58:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 797 transitions. [2020-10-21 22:58:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 22:58:36,109 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:36,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:36,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 22:58:36,110 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:36,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1959316468, now seen corresponding path program 1 times [2020-10-21 22:58:36,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:36,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461920852] [2020-10-21 22:58:36,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:58:36,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461920852] [2020-10-21 22:58:36,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:36,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:58:36,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166350138] [2020-10-21 22:58:36,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:58:36,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:36,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:58:36,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:36,226 INFO L87 Difference]: Start difference. First operand 341 states and 797 transitions. Second operand 6 states. [2020-10-21 22:58:36,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:36,288 INFO L93 Difference]: Finished difference Result 317 states and 747 transitions. [2020-10-21 22:58:36,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 22:58:36,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-21 22:58:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:36,291 INFO L225 Difference]: With dead ends: 317 [2020-10-21 22:58:36,291 INFO L226 Difference]: Without dead ends: 230 [2020-10-21 22:58:36,291 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 22:58:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-21 22:58:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2020-10-21 22:58:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-21 22:58:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 555 transitions. [2020-10-21 22:58:36,298 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 555 transitions. Word has length 19 [2020-10-21 22:58:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:36,298 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 555 transitions. [2020-10-21 22:58:36,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:58:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 555 transitions. [2020-10-21 22:58:36,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-21 22:58:36,299 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:36,300 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] [2020-10-21 22:58:36,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 22:58:36,300 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:36,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:36,300 INFO L82 PathProgramCache]: Analyzing trace with hash -939884904, now seen corresponding path program 1 times [2020-10-21 22:58:36,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:36,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686858410] [2020-10-21 22:58:36,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:58:36,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686858410] [2020-10-21 22:58:36,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:36,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:58:36,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698194146] [2020-10-21 22:58:36,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:58:36,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:36,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:58:36,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:58:36,363 INFO L87 Difference]: Start difference. First operand 230 states and 555 transitions. Second operand 4 states. [2020-10-21 22:58:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:36,382 INFO L93 Difference]: Finished difference Result 292 states and 690 transitions. [2020-10-21 22:58:36,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:58:36,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-21 22:58:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:36,384 INFO L225 Difference]: With dead ends: 292 [2020-10-21 22:58:36,384 INFO L226 Difference]: Without dead ends: 110 [2020-10-21 22:58:36,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:58:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-21 22:58:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-21 22:58:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-21 22:58:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 227 transitions. [2020-10-21 22:58:36,388 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 227 transitions. Word has length 23 [2020-10-21 22:58:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:36,389 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 227 transitions. [2020-10-21 22:58:36,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:58:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 227 transitions. [2020-10-21 22:58:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-21 22:58:36,390 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:36,390 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] [2020-10-21 22:58:36,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 22:58:36,390 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:36,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:36,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2082788086, now seen corresponding path program 2 times [2020-10-21 22:58:36,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:36,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947898083] [2020-10-21 22:58:36,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:58:36,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947898083] [2020-10-21 22:58:36,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:36,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 22:58:36,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51541353] [2020-10-21 22:58:36,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 22:58:36,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:36,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 22:58:36,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:58:36,841 INFO L87 Difference]: Start difference. First operand 110 states and 227 transitions. Second operand 9 states. [2020-10-21 22:58:37,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:37,110 INFO L93 Difference]: Finished difference Result 145 states and 285 transitions. [2020-10-21 22:58:37,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 22:58:37,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-21 22:58:37,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:37,115 INFO L225 Difference]: With dead ends: 145 [2020-10-21 22:58:37,115 INFO L226 Difference]: Without dead ends: 103 [2020-10-21 22:58:37,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-21 22:58:37,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-21 22:58:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 88. [2020-10-21 22:58:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-10-21 22:58:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 175 transitions. [2020-10-21 22:58:37,119 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 175 transitions. Word has length 23 [2020-10-21 22:58:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:37,119 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 175 transitions. [2020-10-21 22:58:37,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 22:58:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 175 transitions. [2020-10-21 22:58:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-21 22:58:37,120 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:37,120 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] [2020-10-21 22:58:37,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 22:58:37,121 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:37,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:37,121 INFO L82 PathProgramCache]: Analyzing trace with hash -784784998, now seen corresponding path program 3 times [2020-10-21 22:58:37,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:37,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306122322] [2020-10-21 22:58:37,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:58:37,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:58:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:58:37,266 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:58:37,325 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 22:58:37,325 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 22:58:37,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 22:58:37,326 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 22:58:37,341 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1073] [1073] L2-->L856: Formula: (let ((.cse6 (= (mod ~x$w_buff0_used~0_In387505200 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In387505200 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In387505200 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In387505200 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~x$r_buff1_thd0~0_In387505200 ~x$r_buff1_thd0~0_Out387505200) (or (and .cse0 (= ~x$w_buff1_used~0_Out387505200 ~x$w_buff1_used~0_In387505200)) (and .cse1 (= ~x$w_buff1_used~0_Out387505200 0) .cse2)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In387505200| ULTIMATE.start_assume_abort_if_not_~cond_Out387505200) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out387505200 0)) (or (and .cse3 (or (and .cse1 (= ~x~0_Out387505200 ~x$w_buff1~0_In387505200) .cse2) (and (= ~x~0_Out387505200 ~x~0_In387505200) .cse0))) (and .cse4 (= ~x~0_Out387505200 ~x$w_buff0~0_In387505200) .cse5)) (or (and .cse3 (= ~x$w_buff0_used~0_Out387505200 ~x$w_buff0_used~0_In387505200)) (and .cse4 .cse5 (= ~x$w_buff0_used~0_Out387505200 0))) (= ~x$r_buff0_thd0~0_In387505200 ~x$r_buff0_thd0~0_Out387505200)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In387505200, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In387505200, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In387505200|, ~x$w_buff1~0=~x$w_buff1~0_In387505200, ~x$w_buff1_used~0=~x$w_buff1_used~0_In387505200, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In387505200, ~x~0=~x~0_In387505200, ~x$w_buff0_used~0=~x$w_buff0_used~0_In387505200} OutVars{~x$w_buff0~0=~x$w_buff0~0_In387505200, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out387505200, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out387505200|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out387505200|, ~x$w_buff1~0=~x$w_buff1~0_In387505200, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out387505200, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out387505200|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out387505200|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out387505200|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out387505200, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out387505200, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In387505200|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out387505200|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out387505200, ~x~0=~x~0_Out387505200} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-21 22:58:37,356 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,356 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [770] [2020-10-21 22:58:37,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,361 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,361 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,361 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,361 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,361 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,362 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,362 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,362 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,362 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,362 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,362 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,364 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,365 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,365 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,368 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,368 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,368 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:58:37,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:37,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:58:37 BasicIcfg [2020-10-21 22:58:37,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 22:58:37,441 INFO L168 Benchmark]: Toolchain (without parser) took 17848.20 ms. Allocated memory was 137.9 MB in the beginning and 428.9 MB in the end (delta: 291.0 MB). Free memory was 98.7 MB in the beginning and 304.9 MB in the end (delta: -206.2 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:37,442 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.0 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-10-21 22:58:37,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.00 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 97.8 MB in the beginning and 152.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:37,443 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.34 ms. Allocated memory is still 200.8 MB. Free memory was 152.8 MB in the beginning and 149.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:37,444 INFO L168 Benchmark]: Boogie Preprocessor took 43.66 ms. Allocated memory is still 200.8 MB. Free memory was 149.8 MB in the beginning and 146.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:37,444 INFO L168 Benchmark]: RCFGBuilder took 2200.63 ms. Allocated memory was 200.8 MB in the beginning and 252.7 MB in the end (delta: 51.9 MB). Free memory was 146.8 MB in the beginning and 171.1 MB in the end (delta: -24.2 MB). Peak memory consumption was 102.9 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:37,445 INFO L168 Benchmark]: TraceAbstraction took 14743.79 ms. Allocated memory was 252.7 MB in the beginning and 428.9 MB in the end (delta: 176.2 MB). Free memory was 168.9 MB in the beginning and 304.9 MB in the end (delta: -136.0 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:37,449 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.0 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.00 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 97.8 MB in the beginning and 152.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.34 ms. Allocated memory is still 200.8 MB. Free memory was 152.8 MB in the beginning and 149.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.66 ms. Allocated memory is still 200.8 MB. Free memory was 149.8 MB in the beginning and 146.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2200.63 ms. Allocated memory was 200.8 MB in the beginning and 252.7 MB in the end (delta: 51.9 MB). Free memory was 146.8 MB in the beginning and 171.1 MB in the end (delta: -24.2 MB). Peak memory consumption was 102.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14743.79 ms. Allocated memory was 252.7 MB in the beginning and 428.9 MB in the end (delta: 176.2 MB). Free memory was 168.9 MB in the beginning and 304.9 MB in the end (delta: -136.0 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1176 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 98 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.4s, 117 PlacesBefore, 38 PlacesAfterwards, 110 TransitionsBefore, 28 TransitionsAfterwards, 2250 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 94 TotalNumberOfCompositions, 6120 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L844] 0 pthread_t t893; [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 3 a = 1 [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L863] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L864] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L864] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L865] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L865] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L867] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L867] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix033_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 108 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.5s, HoareTripleCheckerStatistics: 332 SDtfs, 416 SDslu, 621 SDs, 0 SdLazy, 314 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1132occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 121 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 21273 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...