/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/safe001_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:07:10,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:07:10,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:07:10,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:07:10,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:07:10,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:07:10,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:07:10,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:07:10,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:07:10,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:07:10,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:07:10,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:07:10,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:07:10,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:07:10,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:07:10,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:07:10,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:07:10,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:07:10,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:07:10,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:07:10,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:07:10,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:07:10,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:07:10,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:07:10,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:07:10,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:07:10,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:07:10,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:07:10,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:07:10,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:07:10,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:07:10,173 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:07:10,174 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:07:10,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:07:10,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:07:10,176 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:07:10,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:07:10,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:07:10,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:07:10,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:07:10,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:07:10,180 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:07:10,225 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:07:10,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:07:10,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:07:10,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:07:10,227 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:07:10,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:07:10,228 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:07:10,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:07:10,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:07:10,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:07:10,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:07:10,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:07:10,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:07:10,231 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:07:10,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:07:10,231 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:07:10,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:07:10,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:07:10,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:07:10,232 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:07:10,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:07:10,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:07:10,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:07:10,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:07:10,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:07:10,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:07:10,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:07:10,234 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:07:10,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:07:10,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:07:10,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:07:10,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:07:10,540 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:07:10,540 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:07:10,541 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.opt.i [2020-10-16 12:07:10,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/452e974e5/847d30070d6b43069a61aa24adacb52b/FLAG17bf69519 [2020-10-16 12:07:11,137 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:07:11,138 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe001_pso.opt.i [2020-10-16 12:07:11,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/452e974e5/847d30070d6b43069a61aa24adacb52b/FLAG17bf69519 [2020-10-16 12:07:11,412 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/452e974e5/847d30070d6b43069a61aa24adacb52b [2020-10-16 12:07:11,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:07:11,423 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:07:11,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:07:11,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:07:11,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:07:11,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:07:11" (1/1) ... [2020-10-16 12:07:11,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@570c475f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:11, skipping insertion in model container [2020-10-16 12:07:11,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:07:11" (1/1) ... [2020-10-16 12:07:11,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:07:11,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:07:12,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:07:12,030 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:07:12,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:07:12,204 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:07:12,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:12 WrapperNode [2020-10-16 12:07:12,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:07:12,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:07:12,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:07:12,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:07:12,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:12" (1/1) ... [2020-10-16 12:07:12,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:12" (1/1) ... [2020-10-16 12:07:12,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:07:12,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:07:12,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:07:12,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:07:12,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:12" (1/1) ... [2020-10-16 12:07:12,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:12" (1/1) ... [2020-10-16 12:07:12,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:12" (1/1) ... [2020-10-16 12:07:12,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:12" (1/1) ... [2020-10-16 12:07:12,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:12" (1/1) ... [2020-10-16 12:07:12,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:12" (1/1) ... [2020-10-16 12:07:12,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:12" (1/1) ... [2020-10-16 12:07:12,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:07:12,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:07:12,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:07:12,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:07:12,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:12" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 12:07:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:07:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:07:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:07:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:07:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:07:12,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:07:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:07:12,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:07:12,392 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:07:12,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:07:12,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:07:12,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:07:12,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:07:12,395 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:07:14,546 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:07:14,546 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:07:14,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:07:14 BoogieIcfgContainer [2020-10-16 12:07:14,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:07:14,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:07:14,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:07:14,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:07:14,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:07:11" (1/3) ... [2020-10-16 12:07:14,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbada5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:07:14, skipping insertion in model container [2020-10-16 12:07:14,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:12" (2/3) ... [2020-10-16 12:07:14,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbada5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:07:14, skipping insertion in model container [2020-10-16 12:07:14,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:07:14" (3/3) ... [2020-10-16 12:07:14,558 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_pso.opt.i [2020-10-16 12:07:14,569 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:07:14,570 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:07:14,577 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:07:14,578 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:07:14,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,609 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,609 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,613 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,613 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,613 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,613 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,617 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,617 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,624 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,624 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,630 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,631 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,635 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,636 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,636 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:14,639 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:07:14,653 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:07:14,674 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:07:14,674 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:07:14,674 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:07:14,675 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:07:14,675 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:07:14,675 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:07:14,675 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:07:14,675 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:07:14,689 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:07:14,690 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 12:07:14,693 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 12:07:14,695 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 12:07:14,741 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 12:07:14,742 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:07:14,747 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 12:07:14,751 INFO L117 LiptonReduction]: Number of co-enabled transitions 1642 [2020-10-16 12:07:16,219 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 12:07:16,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 12:07:16,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:07:16,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 12:07:16,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:07:17,389 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2020-10-16 12:07:18,271 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 12:07:18,384 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:07:18,926 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 12:07:19,269 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 12:07:20,150 WARN L193 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-16 12:07:20,450 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 12:07:21,973 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-16 12:07:22,366 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 12:07:22,826 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 12:07:23,205 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 12:07:23,480 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 12:07:23,592 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 12:07:23,613 INFO L132 LiptonReduction]: Checked pairs total: 4586 [2020-10-16 12:07:23,613 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 12:07:23,620 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-16 12:07:23,683 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states. [2020-10-16 12:07:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2020-10-16 12:07:23,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 12:07:23,696 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:23,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 12:07:23,698 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:23,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:23,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1000627320, now seen corresponding path program 1 times [2020-10-16 12:07:23,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:23,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083593348] [2020-10-16 12:07:23,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:23,982 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-16 12:07:23,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083593348] [2020-10-16 12:07:23,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:23,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:07:23,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870579033] [2020-10-16 12:07:23,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:23,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:24,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:24,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:24,006 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 3 states. [2020-10-16 12:07:24,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:24,126 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-16 12:07:24,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:24,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 12:07:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:24,153 INFO L225 Difference]: With dead ends: 687 [2020-10-16 12:07:24,154 INFO L226 Difference]: Without dead ends: 562 [2020-10-16 12:07:24,155 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-16 12:07:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-16 12:07:24,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-16 12:07:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-16 12:07:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-16 12:07:24,256 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2020-10-16 12:07:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:24,256 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-16 12:07:24,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:24,257 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-16 12:07:24,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:07:24,258 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:24,258 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:24,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:07:24,259 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:24,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:24,260 INFO L82 PathProgramCache]: Analyzing trace with hash -486051602, now seen corresponding path program 1 times [2020-10-16 12:07:24,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:24,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757515207] [2020-10-16 12:07:24,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:24,422 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-16 12:07:24,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757515207] [2020-10-16 12:07:24,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:24,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:07:24,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753693579] [2020-10-16 12:07:24,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:24,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:24,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:24,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:24,426 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-16 12:07:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:24,488 INFO L93 Difference]: Finished difference Result 552 states and 1687 transitions. [2020-10-16 12:07:24,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:24,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:07:24,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:24,495 INFO L225 Difference]: With dead ends: 552 [2020-10-16 12:07:24,496 INFO L226 Difference]: Without dead ends: 552 [2020-10-16 12:07:24,497 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-16 12:07:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-10-16 12:07:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2020-10-16 12:07:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-10-16 12:07:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1687 transitions. [2020-10-16 12:07:24,526 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1687 transitions. Word has length 9 [2020-10-16 12:07:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:24,528 INFO L481 AbstractCegarLoop]: Abstraction has 552 states and 1687 transitions. [2020-10-16 12:07:24,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1687 transitions. [2020-10-16 12:07:24,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:07:24,530 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:24,530 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:24,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:07:24,531 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:24,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:24,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2146239772, now seen corresponding path program 1 times [2020-10-16 12:07:24,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:24,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054200663] [2020-10-16 12:07:24,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:24,612 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-16 12:07:24,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054200663] [2020-10-16 12:07:24,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:24,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:07:24,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710771227] [2020-10-16 12:07:24,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:24,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:24,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:24,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:24,615 INFO L87 Difference]: Start difference. First operand 552 states and 1687 transitions. Second operand 3 states. [2020-10-16 12:07:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:24,639 INFO L93 Difference]: Finished difference Result 542 states and 1649 transitions. [2020-10-16 12:07:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:24,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 12:07:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:24,645 INFO L225 Difference]: With dead ends: 542 [2020-10-16 12:07:24,645 INFO L226 Difference]: Without dead ends: 542 [2020-10-16 12:07:24,646 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-16 12:07:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-10-16 12:07:24,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2020-10-16 12:07:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2020-10-16 12:07:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1649 transitions. [2020-10-16 12:07:24,666 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1649 transitions. Word has length 10 [2020-10-16 12:07:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:24,667 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 1649 transitions. [2020-10-16 12:07:24,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1649 transitions. [2020-10-16 12:07:24,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:07:24,676 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:24,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:24,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:07:24,680 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:24,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:24,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2094870650, now seen corresponding path program 1 times [2020-10-16 12:07:24,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:24,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995272859] [2020-10-16 12:07:24,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:24,833 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-16 12:07:24,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995272859] [2020-10-16 12:07:24,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:24,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:24,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175351913] [2020-10-16 12:07:24,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:24,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:24,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:24,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:24,836 INFO L87 Difference]: Start difference. First operand 542 states and 1649 transitions. Second operand 4 states. [2020-10-16 12:07:24,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:24,918 INFO L93 Difference]: Finished difference Result 521 states and 1575 transitions. [2020-10-16 12:07:24,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:24,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 12:07:24,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:24,923 INFO L225 Difference]: With dead ends: 521 [2020-10-16 12:07:24,923 INFO L226 Difference]: Without dead ends: 521 [2020-10-16 12:07:24,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:24,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-10-16 12:07:24,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2020-10-16 12:07:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2020-10-16 12:07:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1575 transitions. [2020-10-16 12:07:24,941 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 1575 transitions. Word has length 11 [2020-10-16 12:07:24,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:24,941 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 1575 transitions. [2020-10-16 12:07:24,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 1575 transitions. [2020-10-16 12:07:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:07:24,943 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:24,943 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:24,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:07:24,944 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1669512842, now seen corresponding path program 1 times [2020-10-16 12:07:24,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:24,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406238323] [2020-10-16 12:07:24,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:25,068 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-16 12:07:25,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406238323] [2020-10-16 12:07:25,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:25,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:07:25,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172768796] [2020-10-16 12:07:25,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:07:25,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:25,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:07:25,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:25,070 INFO L87 Difference]: Start difference. First operand 521 states and 1575 transitions. Second operand 5 states. [2020-10-16 12:07:25,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:25,145 INFO L93 Difference]: Finished difference Result 539 states and 1625 transitions. [2020-10-16 12:07:25,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:25,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 12:07:25,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:25,151 INFO L225 Difference]: With dead ends: 539 [2020-10-16 12:07:25,151 INFO L226 Difference]: Without dead ends: 539 [2020-10-16 12:07:25,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:25,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-10-16 12:07:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2020-10-16 12:07:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2020-10-16 12:07:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1625 transitions. [2020-10-16 12:07:25,169 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 1625 transitions. Word has length 12 [2020-10-16 12:07:25,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:25,169 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 1625 transitions. [2020-10-16 12:07:25,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:07:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1625 transitions. [2020-10-16 12:07:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:07:25,171 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:25,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:25,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:07:25,171 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:25,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:25,171 INFO L82 PathProgramCache]: Analyzing trace with hash 630486214, now seen corresponding path program 1 times [2020-10-16 12:07:25,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:25,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326809664] [2020-10-16 12:07:25,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:25,234 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-16 12:07:25,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326809664] [2020-10-16 12:07:25,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:25,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:25,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158252210] [2020-10-16 12:07:25,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:25,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:25,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:25,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:25,238 INFO L87 Difference]: Start difference. First operand 539 states and 1625 transitions. Second operand 4 states. [2020-10-16 12:07:25,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:25,319 INFO L93 Difference]: Finished difference Result 575 states and 1736 transitions. [2020-10-16 12:07:25,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:25,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 12:07:25,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:25,325 INFO L225 Difference]: With dead ends: 575 [2020-10-16 12:07:25,325 INFO L226 Difference]: Without dead ends: 575 [2020-10-16 12:07:25,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:25,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-10-16 12:07:25,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2020-10-16 12:07:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2020-10-16 12:07:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1736 transitions. [2020-10-16 12:07:25,385 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1736 transitions. Word has length 12 [2020-10-16 12:07:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:25,386 INFO L481 AbstractCegarLoop]: Abstraction has 575 states and 1736 transitions. [2020-10-16 12:07:25,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1736 transitions. [2020-10-16 12:07:25,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:07:25,387 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:25,387 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:25,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:07:25,388 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:25,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:25,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1628574476, now seen corresponding path program 2 times [2020-10-16 12:07:25,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:25,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053755496] [2020-10-16 12:07:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:25,437 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-16 12:07:25,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053755496] [2020-10-16 12:07:25,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:25,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:25,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004661163] [2020-10-16 12:07:25,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:25,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:25,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:25,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:25,439 INFO L87 Difference]: Start difference. First operand 575 states and 1736 transitions. Second operand 4 states. [2020-10-16 12:07:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:25,525 INFO L93 Difference]: Finished difference Result 563 states and 1695 transitions. [2020-10-16 12:07:25,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:25,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 12:07:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:25,531 INFO L225 Difference]: With dead ends: 563 [2020-10-16 12:07:25,532 INFO L226 Difference]: Without dead ends: 563 [2020-10-16 12:07:25,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-10-16 12:07:25,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 527. [2020-10-16 12:07:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2020-10-16 12:07:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1584 transitions. [2020-10-16 12:07:25,551 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 1584 transitions. Word has length 12 [2020-10-16 12:07:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:25,551 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 1584 transitions. [2020-10-16 12:07:25,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:25,552 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1584 transitions. [2020-10-16 12:07:25,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:07:25,553 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:25,553 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:25,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:07:25,553 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:25,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:25,554 INFO L82 PathProgramCache]: Analyzing trace with hash 202161229, now seen corresponding path program 1 times [2020-10-16 12:07:25,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:25,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647671407] [2020-10-16 12:07:25,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:25,595 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-16 12:07:25,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647671407] [2020-10-16 12:07:25,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:25,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:07:25,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897286815] [2020-10-16 12:07:25,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:25,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:25,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:25,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:25,598 INFO L87 Difference]: Start difference. First operand 527 states and 1584 transitions. Second operand 3 states. [2020-10-16 12:07:25,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:25,609 INFO L93 Difference]: Finished difference Result 517 states and 1551 transitions. [2020-10-16 12:07:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:25,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 12:07:25,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:25,615 INFO L225 Difference]: With dead ends: 517 [2020-10-16 12:07:25,615 INFO L226 Difference]: Without dead ends: 517 [2020-10-16 12:07:25,615 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-16 12:07:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-10-16 12:07:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 497. [2020-10-16 12:07:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2020-10-16 12:07:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1493 transitions. [2020-10-16 12:07:25,632 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1493 transitions. Word has length 13 [2020-10-16 12:07:25,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:25,632 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 1493 transitions. [2020-10-16 12:07:25,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1493 transitions. [2020-10-16 12:07:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:07:25,633 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:25,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:25,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:07:25,634 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:25,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:25,634 INFO L82 PathProgramCache]: Analyzing trace with hash 215290535, now seen corresponding path program 1 times [2020-10-16 12:07:25,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:25,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532780597] [2020-10-16 12:07:25,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:25,674 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-16 12:07:25,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532780597] [2020-10-16 12:07:25,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:25,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:25,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995624902] [2020-10-16 12:07:25,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:25,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:25,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:25,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:25,677 INFO L87 Difference]: Start difference. First operand 497 states and 1493 transitions. Second operand 4 states. [2020-10-16 12:07:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:25,709 INFO L93 Difference]: Finished difference Result 773 states and 2292 transitions. [2020-10-16 12:07:25,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:25,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 12:07:25,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:25,714 INFO L225 Difference]: With dead ends: 773 [2020-10-16 12:07:25,714 INFO L226 Difference]: Without dead ends: 425 [2020-10-16 12:07:25,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:25,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2020-10-16 12:07:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2020-10-16 12:07:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-10-16 12:07:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1253 transitions. [2020-10-16 12:07:25,728 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1253 transitions. Word has length 13 [2020-10-16 12:07:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:25,728 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 1253 transitions. [2020-10-16 12:07:25,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1253 transitions. [2020-10-16 12:07:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:07:25,729 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:25,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:25,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:07:25,730 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:25,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:25,730 INFO L82 PathProgramCache]: Analyzing trace with hash -974763969, now seen corresponding path program 2 times [2020-10-16 12:07:25,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:25,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120868322] [2020-10-16 12:07:25,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:25,768 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-16 12:07:25,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120868322] [2020-10-16 12:07:25,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:25,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:07:25,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227703141] [2020-10-16 12:07:25,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:25,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:25,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:25,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:25,772 INFO L87 Difference]: Start difference. First operand 425 states and 1253 transitions. Second operand 4 states. [2020-10-16 12:07:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:25,809 INFO L93 Difference]: Finished difference Result 800 states and 2259 transitions. [2020-10-16 12:07:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:07:25,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 12:07:25,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:25,813 INFO L225 Difference]: With dead ends: 800 [2020-10-16 12:07:25,813 INFO L226 Difference]: Without dead ends: 353 [2020-10-16 12:07:25,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-10-16 12:07:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 317. [2020-10-16 12:07:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2020-10-16 12:07:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 863 transitions. [2020-10-16 12:07:25,825 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 863 transitions. Word has length 13 [2020-10-16 12:07:25,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:25,825 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 863 transitions. [2020-10-16 12:07:25,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 863 transitions. [2020-10-16 12:07:25,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:07:25,826 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:25,827 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:25,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:07:25,827 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:25,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:25,827 INFO L82 PathProgramCache]: Analyzing trace with hash -549142010, now seen corresponding path program 1 times [2020-10-16 12:07:25,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:25,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269331337] [2020-10-16 12:07:25,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:25,870 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-16 12:07:25,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269331337] [2020-10-16 12:07:25,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:25,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:25,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751702381] [2020-10-16 12:07:25,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:25,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:25,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:25,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:25,872 INFO L87 Difference]: Start difference. First operand 317 states and 863 transitions. Second operand 4 states. [2020-10-16 12:07:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:25,899 INFO L93 Difference]: Finished difference Result 449 states and 1221 transitions. [2020-10-16 12:07:25,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:25,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 12:07:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:25,902 INFO L225 Difference]: With dead ends: 449 [2020-10-16 12:07:25,903 INFO L226 Difference]: Without dead ends: 209 [2020-10-16 12:07:25,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:25,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-16 12:07:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-10-16 12:07:25,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-16 12:07:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 563 transitions. [2020-10-16 12:07:25,913 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 563 transitions. Word has length 13 [2020-10-16 12:07:25,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:25,913 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 563 transitions. [2020-10-16 12:07:25,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:25,914 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 563 transitions. [2020-10-16 12:07:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:07:25,914 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:25,914 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:25,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:07:25,915 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:25,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:25,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1878298136, now seen corresponding path program 1 times [2020-10-16 12:07:25,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:25,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184540320] [2020-10-16 12:07:25,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:26,043 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-16 12:07:26,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184540320] [2020-10-16 12:07:26,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:26,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:07:26,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105422288] [2020-10-16 12:07:26,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:07:26,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:26,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:07:26,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:26,046 INFO L87 Difference]: Start difference. First operand 209 states and 563 transitions. Second operand 5 states. [2020-10-16 12:07:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:26,139 INFO L93 Difference]: Finished difference Result 208 states and 559 transitions. [2020-10-16 12:07:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:26,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:07:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:26,142 INFO L225 Difference]: With dead ends: 208 [2020-10-16 12:07:26,142 INFO L226 Difference]: Without dead ends: 208 [2020-10-16 12:07:26,142 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:07:26,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-10-16 12:07:26,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2020-10-16 12:07:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-10-16 12:07:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 559 transitions. [2020-10-16 12:07:26,150 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 559 transitions. Word has length 14 [2020-10-16 12:07:26,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:26,151 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 559 transitions. [2020-10-16 12:07:26,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:07:26,151 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 559 transitions. [2020-10-16 12:07:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:07:26,151 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:26,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:26,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:07:26,152 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:26,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:26,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1610345253, now seen corresponding path program 1 times [2020-10-16 12:07:26,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:26,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015958964] [2020-10-16 12:07:26,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:26,225 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-16 12:07:26,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015958964] [2020-10-16 12:07:26,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:26,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:07:26,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314720177] [2020-10-16 12:07:26,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:26,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:26,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:26,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:26,228 INFO L87 Difference]: Start difference. First operand 208 states and 559 transitions. Second operand 4 states. [2020-10-16 12:07:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:26,261 INFO L93 Difference]: Finished difference Result 206 states and 485 transitions. [2020-10-16 12:07:26,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:07:26,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-16 12:07:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:26,263 INFO L225 Difference]: With dead ends: 206 [2020-10-16 12:07:26,263 INFO L226 Difference]: Without dead ends: 153 [2020-10-16 12:07:26,263 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-16 12:07:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-10-16 12:07:26,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2020-10-16 12:07:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-16 12:07:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 355 transitions. [2020-10-16 12:07:26,268 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 355 transitions. Word has length 15 [2020-10-16 12:07:26,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:26,268 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 355 transitions. [2020-10-16 12:07:26,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 355 transitions. [2020-10-16 12:07:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:07:26,269 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:26,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:26,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:07:26,270 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:26,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2130702573, now seen corresponding path program 1 times [2020-10-16 12:07:26,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:26,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564403420] [2020-10-16 12:07:26,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:26,353 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-16 12:07:26,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564403420] [2020-10-16 12:07:26,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:26,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:07:26,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313518391] [2020-10-16 12:07:26,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:07:26,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:26,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:07:26,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:26,355 INFO L87 Difference]: Start difference. First operand 153 states and 355 transitions. Second operand 5 states. [2020-10-16 12:07:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:26,407 INFO L93 Difference]: Finished difference Result 124 states and 251 transitions. [2020-10-16 12:07:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:07:26,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 12:07:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:26,408 INFO L225 Difference]: With dead ends: 124 [2020-10-16 12:07:26,409 INFO L226 Difference]: Without dead ends: 93 [2020-10-16 12:07:26,409 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-16 12:07:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-16 12:07:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-10-16 12:07:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-16 12:07:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 179 transitions. [2020-10-16 12:07:26,412 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 179 transitions. Word has length 16 [2020-10-16 12:07:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:26,412 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 179 transitions. [2020-10-16 12:07:26,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:07:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 179 transitions. [2020-10-16 12:07:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 12:07:26,413 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:26,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:26,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:07:26,414 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:26,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:26,414 INFO L82 PathProgramCache]: Analyzing trace with hash -2010009971, now seen corresponding path program 1 times [2020-10-16 12:07:26,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:26,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112368804] [2020-10-16 12:07:26,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:26,533 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-16 12:07:26,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112368804] [2020-10-16 12:07:26,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:26,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:07:26,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951244157] [2020-10-16 12:07:26,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:07:26,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:26,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:07:26,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:07:26,536 INFO L87 Difference]: Start difference. First operand 93 states and 179 transitions. Second operand 6 states. [2020-10-16 12:07:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:26,605 INFO L93 Difference]: Finished difference Result 79 states and 149 transitions. [2020-10-16 12:07:26,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:07:26,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-16 12:07:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:26,608 INFO L225 Difference]: With dead ends: 79 [2020-10-16 12:07:26,608 INFO L226 Difference]: Without dead ends: 70 [2020-10-16 12:07:26,608 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-16 12:07:26,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-16 12:07:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-16 12:07:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-16 12:07:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 133 transitions. [2020-10-16 12:07:26,611 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 133 transitions. Word has length 18 [2020-10-16 12:07:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:26,612 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 133 transitions. [2020-10-16 12:07:26,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:07:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 133 transitions. [2020-10-16 12:07:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:07:26,613 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:26,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:26,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:07:26,614 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:26,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:26,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1937510697, now seen corresponding path program 1 times [2020-10-16 12:07:26,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:26,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135202754] [2020-10-16 12:07:26,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:26,986 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-16 12:07:26,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135202754] [2020-10-16 12:07:26,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:26,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:07:26,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343267228] [2020-10-16 12:07:26,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:07:26,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:26,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:07:26,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:07:26,991 INFO L87 Difference]: Start difference. First operand 70 states and 133 transitions. Second operand 9 states. [2020-10-16 12:07:27,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:27,298 INFO L93 Difference]: Finished difference Result 119 states and 213 transitions. [2020-10-16 12:07:27,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:07:27,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-16 12:07:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:27,300 INFO L225 Difference]: With dead ends: 119 [2020-10-16 12:07:27,300 INFO L226 Difference]: Without dead ends: 65 [2020-10-16 12:07:27,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:07:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-16 12:07:27,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2020-10-16 12:07:27,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-16 12:07:27,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2020-10-16 12:07:27,303 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 85 transitions. Word has length 21 [2020-10-16 12:07:27,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:27,304 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 85 transitions. [2020-10-16 12:07:27,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:07:27,304 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 85 transitions. [2020-10-16 12:07:27,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:07:27,305 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:27,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:27,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:07:27,305 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:27,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:27,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1137754697, now seen corresponding path program 2 times [2020-10-16 12:07:27,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:27,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708263527] [2020-10-16 12:07:27,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:07:27,382 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:07:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:07:27,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:07:27,502 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:07:27,503 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:07:27,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:07:27,504 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:07:27,515 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L2-->L823: Formula: (let ((.cse7 (= 0 (mod ~x$r_buff0_thd0~0_In-2107492058 256))) (.cse6 (= (mod ~x$w_buff0_used~0_In-2107492058 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In-2107492058 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-2107492058 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (or (and (or (and .cse0 (= ~x$w_buff1~0_In-2107492058 ~x~0_Out-2107492058) .cse1) (and .cse2 (= ~x~0_In-2107492058 ~x~0_Out-2107492058))) .cse3) (and .cse4 (= ~x$w_buff0~0_In-2107492058 ~x~0_Out-2107492058) .cse5)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2107492058 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-2107492058|) (or (and (= ~x$w_buff1_used~0_Out-2107492058 0) .cse0 .cse1) (and .cse2 (= ~x$w_buff1_used~0_In-2107492058 ~x$w_buff1_used~0_Out-2107492058))) (= ~x$r_buff1_thd0~0_Out-2107492058 ~x$r_buff1_thd0~0_In-2107492058) (or (and .cse4 .cse5 (= ~x$w_buff0_used~0_Out-2107492058 0)) (and (= ~x$w_buff0_used~0_Out-2107492058 ~x$w_buff0_used~0_In-2107492058) .cse3)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2107492058 0)) (= ~x$r_buff0_thd0~0_In-2107492058 ~x$r_buff0_thd0~0_Out-2107492058)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-2107492058, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2107492058, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2107492058|, ~x$w_buff1~0=~x$w_buff1~0_In-2107492058, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2107492058, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2107492058, ~x~0=~x~0_In-2107492058, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2107492058} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-2107492058, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-2107492058, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-2107492058|, ~x$w_buff1~0=~x$w_buff1~0_In-2107492058, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-2107492058|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-2107492058, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-2107492058|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-2107492058|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-2107492058|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-2107492058, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-2107492058, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-2107492058|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2107492058|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-2107492058, ~x~0=~x~0_Out-2107492058} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 12:07:27,520 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-16 12:07:27,520 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,522 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-16 12:07:27,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,523 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-16 12:07:27,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,523 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-16 12:07:27,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,523 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-16 12:07:27,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,524 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-16 12:07:27,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,524 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-16 12:07:27,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,525 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-16 12:07:27,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,525 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-16 12:07:27,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,525 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-16 12:07:27,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,526 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-16 12:07:27,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,526 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-16 12:07:27,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,527 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-16 12:07:27,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,527 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-16 12:07:27,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,528 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-16 12:07:27,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,528 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-16 12:07:27,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,528 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-16 12:07:27,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,529 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-16 12:07:27,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,530 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-16 12:07:27,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,530 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-16 12:07:27,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,530 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-16 12:07:27,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,531 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-16 12:07:27,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,531 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-16 12:07:27,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,532 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-16 12:07:27,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,532 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-16 12:07:27,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,532 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-16 12:07:27,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,533 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-16 12:07:27,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,533 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-16 12:07:27,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,533 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-16 12:07:27,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,533 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-16 12:07:27,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,534 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-16 12:07:27,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,534 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-16 12:07:27,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:27,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:07:27 BasicIcfg [2020-10-16 12:07:27,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:07:27,590 INFO L168 Benchmark]: Toolchain (without parser) took 16167.93 ms. Allocated memory was 147.3 MB in the beginning and 379.6 MB in the end (delta: 232.3 MB). Free memory was 101.7 MB in the beginning and 247.2 MB in the end (delta: -145.5 MB). Peak memory consumption was 86.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:27,591 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 147.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-16 12:07:27,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.95 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 159.5 MB in the end (delta: -58.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:27,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.78 ms. Allocated memory is still 205.0 MB. Free memory was 159.5 MB in the beginning and 156.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:27,593 INFO L168 Benchmark]: Boogie Preprocessor took 40.44 ms. Allocated memory is still 205.0 MB. Free memory was 156.2 MB in the beginning and 154.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:27,593 INFO L168 Benchmark]: RCFGBuilder took 2228.16 ms. Allocated memory was 205.0 MB in the beginning and 246.9 MB in the end (delta: 41.9 MB). Free memory was 154.3 MB in the beginning and 165.0 MB in the end (delta: -10.8 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:27,594 INFO L168 Benchmark]: TraceAbstraction took 13038.38 ms. Allocated memory was 246.9 MB in the beginning and 379.6 MB in the end (delta: 132.6 MB). Free memory was 163.3 MB in the beginning and 247.2 MB in the end (delta: -83.9 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:27,598 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 147.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.95 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 159.5 MB in the end (delta: -58.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.78 ms. Allocated memory is still 205.0 MB. Free memory was 159.5 MB in the beginning and 156.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.44 ms. Allocated memory is still 205.0 MB. Free memory was 156.2 MB in the beginning and 154.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2228.16 ms. Allocated memory was 205.0 MB in the beginning and 246.9 MB in the end (delta: 41.9 MB). Free memory was 154.3 MB in the beginning and 165.0 MB in the end (delta: -10.8 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13038.38 ms. Allocated memory was 246.9 MB in the beginning and 379.6 MB in the end (delta: 132.6 MB). Free memory was 163.3 MB in the beginning and 247.2 MB in the end (delta: -83.9 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 822 VarBasedMoverChecksPositive, 34 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 64 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.9s, 100 PlacesBefore, 36 PlacesAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 4586 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L707] 0 _Bool x$flush_delayed; [L708] 0 int x$mem_tmp; [L709] 0 _Bool x$r_buff0_thd0; [L710] 0 _Bool x$r_buff0_thd1; [L711] 0 _Bool x$r_buff0_thd2; [L712] 0 _Bool x$r_buff0_thd3; [L713] 0 _Bool x$r_buff1_thd0; [L714] 0 _Bool x$r_buff1_thd1; [L715] 0 _Bool x$r_buff1_thd2; [L716] 0 _Bool x$r_buff1_thd3; [L717] 0 _Bool x$read_delayed; [L718] 0 int *x$read_delayed_var; [L719] 0 int x$w_buff0; [L720] 0 _Bool x$w_buff0_used; [L721] 0 int x$w_buff1; [L722] 0 _Bool x$w_buff1_used; [L724] 0 int y = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L807] 0 pthread_t t1810; [L808] FCALL, FORK 0 pthread_create(&t1810, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] 0 pthread_t t1811; [L810] FCALL, FORK 0 pthread_create(&t1811, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L811] 0 pthread_t t1812; [L750] 2 x$w_buff1 = x$w_buff0 [L751] 2 x$w_buff0 = 2 [L752] 2 x$w_buff1_used = x$w_buff0_used [L753] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L755] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L756] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L757] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L758] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L759] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L812] FCALL, FORK 0 pthread_create(&t1812, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L779] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2] [L730] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2] [L765] 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) [L765] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L765] 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) [L765] 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) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] 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 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L769] 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 [L785] 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) [L785] 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) [L786] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L786] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 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 [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L788] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L789] 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 [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L736] 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) [L736] 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) [L737] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 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 [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L739] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L740] 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 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 x$flush_delayed = weak$$choice2 [L828] 0 x$mem_tmp = x [L829] 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) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L829] 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) [L829] 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) [L830] 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)) [L830] 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) [L830] 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)) [L830] 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)) [L831] 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)) [L831] 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) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L831] 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) [L831] 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)) [L831] 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)) [L832] 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)) [L832] 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) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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) [L832] 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)) [L832] 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)) [L833] 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)) [L833] 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)) [L834] 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)) [L834] 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)) [L835] 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)) [L835] EXPR 0 !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) [L835] 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)) [L835] 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)) [L836] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L837] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L837] 0 x = x$flush_delayed ? x$mem_tmp : x [L838] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 339 SDtfs, 331 SDslu, 503 SDs, 0 SdLazy, 333 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred 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, 16 MinimizatonAttempts, 107 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 18107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...