/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/mix057_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:01:51,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:01:51,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:01:51,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:01:51,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:01:51,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:01:51,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:01:51,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:01:51,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:01:51,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:01:51,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:01:51,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:01:51,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:01:51,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:01:51,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:01:51,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:01:51,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:01:51,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:01:51,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:01:51,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:01:51,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:01:51,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:01:51,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:01:51,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:01:51,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:01:51,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:01:51,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:01:51,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:01:51,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:01:51,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:01:51,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:01:51,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:01:51,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:01:51,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:01:51,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:01:51,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:01:51,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:01:51,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:01:51,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:01:51,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:01:51,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:01:51,221 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 23:01:51,242 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:01:51,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:01:51,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:01:51,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:01:51,244 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:01:51,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:01:51,245 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:01:51,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:01:51,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:01:51,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:01:51,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:01:51,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:01:51,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:01:51,246 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:01:51,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:01:51,246 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:01:51,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:01:51,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:01:51,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:01:51,247 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:01:51,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:01:51,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:01:51,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:01:51,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:01:51,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:01:51,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:01:51,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:01:51,249 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:01:51,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:01:51,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:01:51,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:01:51,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:01:51,593 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:01:51,594 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:01:51,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i [2020-10-21 23:01:51,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd044fead/3f077558c7984731b401f08be8a10cdd/FLAGc78e88814 [2020-10-21 23:01:52,193 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:01:52,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i [2020-10-21 23:01:52,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd044fead/3f077558c7984731b401f08be8a10cdd/FLAGc78e88814 [2020-10-21 23:01:52,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd044fead/3f077558c7984731b401f08be8a10cdd [2020-10-21 23:01:52,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:01:52,449 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:01:52,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:01:52,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:01:52,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:01:52,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:01:52" (1/1) ... [2020-10-21 23:01:52,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d83ff23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:52, skipping insertion in model container [2020-10-21 23:01:52,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:01:52" (1/1) ... [2020-10-21 23:01:52,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:01:52,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:01:53,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:01:53,145 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:01:53,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:01:53,288 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:01:53,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:53 WrapperNode [2020-10-21 23:01:53,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:01:53,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:01:53,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:01:53,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:01:53,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:53" (1/1) ... [2020-10-21 23:01:53,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:53" (1/1) ... [2020-10-21 23:01:53,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:01:53,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:01:53,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:01:53,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:01:53,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:53" (1/1) ... [2020-10-21 23:01:53,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:53" (1/1) ... [2020-10-21 23:01:53,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:53" (1/1) ... [2020-10-21 23:01:53,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:53" (1/1) ... [2020-10-21 23:01:53,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:53" (1/1) ... [2020-10-21 23:01:53,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:53" (1/1) ... [2020-10-21 23:01:53,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:53" (1/1) ... [2020-10-21 23:01:53,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:01:53,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:01:53,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:01:53,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:01:53,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:01:53,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:01:53,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:01:53,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:01:53,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:01:53,501 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:01:53,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:01:53,503 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:01:53,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:01:53,504 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:01:53,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:01:53,507 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 23:01:53,507 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 23:01:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:01:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:01:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:01:53,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:01:53,511 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:01:55,497 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:01:55,498 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:01:55,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:01:55 BoogieIcfgContainer [2020-10-21 23:01:55,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:01:55,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:01:55,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:01:55,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:01:55,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:01:52" (1/3) ... [2020-10-21 23:01:55,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8b7ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:01:55, skipping insertion in model container [2020-10-21 23:01:55,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:53" (2/3) ... [2020-10-21 23:01:55,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8b7ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:01:55, skipping insertion in model container [2020-10-21 23:01:55,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:01:55" (3/3) ... [2020-10-21 23:01:55,509 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.oepc.i [2020-10-21 23:01:55,521 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:01:55,522 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:01:55,530 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:01:55,531 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:01:55,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,563 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,563 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,563 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,563 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,564 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,564 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,564 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,566 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,566 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,569 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,569 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,569 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,569 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,569 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,570 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,570 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,570 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,570 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,570 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,571 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,571 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,571 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,571 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,571 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,577 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,578 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,579 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,579 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,579 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,579 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,579 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,580 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,580 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,580 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,586 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,586 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,588 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,588 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,590 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,591 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:55,593 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:01:55,607 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 23:01:55,629 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:01:55,629 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:01:55,629 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:01:55,630 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:01:55,630 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:01:55,630 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:01:55,630 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:01:55,630 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:01:55,646 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:01:55,647 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 116 transitions, 252 flow [2020-10-21 23:01:55,650 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 116 transitions, 252 flow [2020-10-21 23:01:55,652 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 116 transitions, 252 flow [2020-10-21 23:01:55,708 INFO L129 PetriNetUnfolder]: 3/112 cut-off events. [2020-10-21 23:01:55,709 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:01:55,717 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-10-21 23:01:55,722 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-10-21 23:01:56,400 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 23:01:57,790 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-10-21 23:01:59,148 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-10-21 23:01:59,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-21 23:01:59,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:01:59,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 23:01:59,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:02:00,107 WARN L193 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 109 [2020-10-21 23:02:01,126 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-10-21 23:02:01,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-21 23:02:01,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:02:01,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 23:02:01,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:02:02,149 WARN L193 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 110 [2020-10-21 23:02:02,793 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-10-21 23:02:02,992 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-21 23:02:04,707 WARN L193 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 247 DAG size of output: 206 [2020-10-21 23:02:04,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-21 23:02:04,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:02:04,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 23:02:04,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:02:05,841 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 163 DAG size of output: 134 [2020-10-21 23:02:05,903 INFO L131 LiptonReduction]: Checked pairs total: 7247 [2020-10-21 23:02:05,904 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-10-21 23:02:05,911 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-21 23:02:06,069 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-10-21 23:02:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-10-21 23:02:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:02:06,082 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:06,083 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:06,083 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:06,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:06,090 INFO L82 PathProgramCache]: Analyzing trace with hash 477405012, now seen corresponding path program 1 times [2020-10-21 23:02:06,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:06,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191748056] [2020-10-21 23:02:06,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:02:06,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191748056] [2020-10-21 23:02:06,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:06,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:02:06,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261133227] [2020-10-21 23:02:06,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:02:06,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:06,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:02:06,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:06,405 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-10-21 23:02:06,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:06,520 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-10-21 23:02:06,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:02:06,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:02:06,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:06,559 INFO L225 Difference]: With dead ends: 2202 [2020-10-21 23:02:06,559 INFO L226 Difference]: Without dead ends: 1802 [2020-10-21 23:02:06,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:06,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-21 23:02:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-10-21 23:02:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-10-21 23:02:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-10-21 23:02:06,759 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-10-21 23:02:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:06,760 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-10-21 23:02:06,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:02:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-10-21 23:02:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:02:06,766 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:06,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:06,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:02:06,767 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:06,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:06,768 INFO L82 PathProgramCache]: Analyzing trace with hash -775206985, now seen corresponding path program 1 times [2020-10-21 23:02:06,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:06,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12369835] [2020-10-21 23:02:06,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:02:06,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12369835] [2020-10-21 23:02:06,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:06,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:02:06,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559488866] [2020-10-21 23:02:06,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:02:06,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:06,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:02:06,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:06,947 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-10-21 23:02:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:06,976 INFO L93 Difference]: Finished difference Result 1762 states and 6602 transitions. [2020-10-21 23:02:06,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:02:06,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 23:02:06,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:06,993 INFO L225 Difference]: With dead ends: 1762 [2020-10-21 23:02:06,993 INFO L226 Difference]: Without dead ends: 1762 [2020-10-21 23:02:06,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:07,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2020-10-21 23:02:07,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2020-10-21 23:02:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2020-10-21 23:02:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 6602 transitions. [2020-10-21 23:02:07,065 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 6602 transitions. Word has length 11 [2020-10-21 23:02:07,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:07,065 INFO L481 AbstractCegarLoop]: Abstraction has 1762 states and 6602 transitions. [2020-10-21 23:02:07,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:02:07,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 6602 transitions. [2020-10-21 23:02:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:02:07,068 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:07,069 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:07,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:02:07,069 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:07,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:07,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1738386307, now seen corresponding path program 1 times [2020-10-21 23:02:07,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:07,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441012187] [2020-10-21 23:02:07,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:02:07,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441012187] [2020-10-21 23:02:07,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:07,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:02:07,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870588869] [2020-10-21 23:02:07,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:02:07,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:07,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:02:07,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:07,217 INFO L87 Difference]: Start difference. First operand 1762 states and 6602 transitions. Second operand 3 states. [2020-10-21 23:02:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:07,265 INFO L93 Difference]: Finished difference Result 1722 states and 6420 transitions. [2020-10-21 23:02:07,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:02:07,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-21 23:02:07,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:07,282 INFO L225 Difference]: With dead ends: 1722 [2020-10-21 23:02:07,282 INFO L226 Difference]: Without dead ends: 1722 [2020-10-21 23:02:07,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2020-10-21 23:02:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2020-10-21 23:02:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2020-10-21 23:02:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 6420 transitions. [2020-10-21 23:02:07,352 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 6420 transitions. Word has length 12 [2020-10-21 23:02:07,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:07,353 INFO L481 AbstractCegarLoop]: Abstraction has 1722 states and 6420 transitions. [2020-10-21 23:02:07,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:02:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 6420 transitions. [2020-10-21 23:02:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:02:07,355 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:07,356 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:07,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:02:07,356 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:07,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:07,356 INFO L82 PathProgramCache]: Analyzing trace with hash -709915685, now seen corresponding path program 1 times [2020-10-21 23:02:07,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:07,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300896174] [2020-10-21 23:02:07,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:02:07,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300896174] [2020-10-21 23:02:07,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:07,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:02:07,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106401072] [2020-10-21 23:02:07,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:02:07,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:07,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:02:07,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:02:07,461 INFO L87 Difference]: Start difference. First operand 1722 states and 6420 transitions. Second operand 4 states. [2020-10-21 23:02:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:07,568 INFO L93 Difference]: Finished difference Result 1906 states and 7026 transitions. [2020-10-21 23:02:07,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:02:07,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 23:02:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:07,653 INFO L225 Difference]: With dead ends: 1906 [2020-10-21 23:02:07,653 INFO L226 Difference]: Without dead ends: 1906 [2020-10-21 23:02:07,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:02:07,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2020-10-21 23:02:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1874. [2020-10-21 23:02:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2020-10-21 23:02:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 6930 transitions. [2020-10-21 23:02:07,734 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 6930 transitions. Word has length 13 [2020-10-21 23:02:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:07,735 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 6930 transitions. [2020-10-21 23:02:07,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:02:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 6930 transitions. [2020-10-21 23:02:07,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:02:07,738 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:07,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:07,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:02:07,738 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:07,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:07,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1037055385, now seen corresponding path program 1 times [2020-10-21 23:02:07,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:07,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716341466] [2020-10-21 23:02:07,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:02:07,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716341466] [2020-10-21 23:02:07,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:07,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:02:07,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52846138] [2020-10-21 23:02:07,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:02:07,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:07,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:02:07,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:07,837 INFO L87 Difference]: Start difference. First operand 1874 states and 6930 transitions. Second operand 3 states. [2020-10-21 23:02:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:07,890 INFO L93 Difference]: Finished difference Result 1818 states and 6696 transitions. [2020-10-21 23:02:07,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:02:07,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-21 23:02:07,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:07,908 INFO L225 Difference]: With dead ends: 1818 [2020-10-21 23:02:07,908 INFO L226 Difference]: Without dead ends: 1818 [2020-10-21 23:02:07,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:07,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2020-10-21 23:02:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1658. [2020-10-21 23:02:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2020-10-21 23:02:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 6152 transitions. [2020-10-21 23:02:07,979 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 6152 transitions. Word has length 13 [2020-10-21 23:02:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:07,979 INFO L481 AbstractCegarLoop]: Abstraction has 1658 states and 6152 transitions. [2020-10-21 23:02:07,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:02:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 6152 transitions. [2020-10-21 23:02:07,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:02:07,983 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:07,984 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:07,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:02:07,984 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:07,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:07,985 INFO L82 PathProgramCache]: Analyzing trace with hash -533968753, now seen corresponding path program 1 times [2020-10-21 23:02:07,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:07,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388493597] [2020-10-21 23:02:07,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:08,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:02:08,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388493597] [2020-10-21 23:02:08,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:08,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:02:08,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415257808] [2020-10-21 23:02:08,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:02:08,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:08,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:02:08,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:08,048 INFO L87 Difference]: Start difference. First operand 1658 states and 6152 transitions. Second operand 3 states. [2020-10-21 23:02:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:08,097 INFO L93 Difference]: Finished difference Result 2298 states and 8232 transitions. [2020-10-21 23:02:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:02:08,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-21 23:02:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:08,119 INFO L225 Difference]: With dead ends: 2298 [2020-10-21 23:02:08,119 INFO L226 Difference]: Without dead ends: 1754 [2020-10-21 23:02:08,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2020-10-21 23:02:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1626. [2020-10-21 23:02:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2020-10-21 23:02:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 5752 transitions. [2020-10-21 23:02:08,213 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 5752 transitions. Word has length 14 [2020-10-21 23:02:08,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:08,214 INFO L481 AbstractCegarLoop]: Abstraction has 1626 states and 5752 transitions. [2020-10-21 23:02:08,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:02:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 5752 transitions. [2020-10-21 23:02:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:02:08,219 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:08,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:08,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:02:08,220 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:08,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:08,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2127906781, now seen corresponding path program 1 times [2020-10-21 23:02:08,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:08,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513103982] [2020-10-21 23:02:08,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:02:08,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513103982] [2020-10-21 23:02:08,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:08,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:02:08,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726912296] [2020-10-21 23:02:08,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:02:08,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:08,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:02:08,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:02:08,379 INFO L87 Difference]: Start difference. First operand 1626 states and 5752 transitions. Second operand 5 states. [2020-10-21 23:02:08,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:08,485 INFO L93 Difference]: Finished difference Result 1762 states and 6160 transitions. [2020-10-21 23:02:08,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:02:08,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-21 23:02:08,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:08,501 INFO L225 Difference]: With dead ends: 1762 [2020-10-21 23:02:08,501 INFO L226 Difference]: Without dead ends: 1762 [2020-10-21 23:02:08,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:02:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2020-10-21 23:02:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2020-10-21 23:02:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2020-10-21 23:02:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 6160 transitions. [2020-10-21 23:02:08,573 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 6160 transitions. Word has length 14 [2020-10-21 23:02:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:08,574 INFO L481 AbstractCegarLoop]: Abstraction has 1762 states and 6160 transitions. [2020-10-21 23:02:08,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:02:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 6160 transitions. [2020-10-21 23:02:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:02:08,579 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:08,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:08,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:02:08,579 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:08,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:08,580 INFO L82 PathProgramCache]: Analyzing trace with hash -591786302, now seen corresponding path program 1 times [2020-10-21 23:02:08,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:08,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517573938] [2020-10-21 23:02:08,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:02:08,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517573938] [2020-10-21 23:02:08,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:08,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:02:08,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388110864] [2020-10-21 23:02:08,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:02:08,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:08,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:02:08,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:02:08,687 INFO L87 Difference]: Start difference. First operand 1762 states and 6160 transitions. Second operand 4 states. [2020-10-21 23:02:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:08,755 INFO L93 Difference]: Finished difference Result 1867 states and 5947 transitions. [2020-10-21 23:02:08,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:02:08,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-21 23:02:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:08,765 INFO L225 Difference]: With dead ends: 1867 [2020-10-21 23:02:08,765 INFO L226 Difference]: Without dead ends: 1403 [2020-10-21 23:02:08,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:02:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-10-21 23:02:08,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1403. [2020-10-21 23:02:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1403 states. [2020-10-21 23:02:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 4449 transitions. [2020-10-21 23:02:08,815 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 4449 transitions. Word has length 16 [2020-10-21 23:02:08,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:08,816 INFO L481 AbstractCegarLoop]: Abstraction has 1403 states and 4449 transitions. [2020-10-21 23:02:08,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:02:08,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 4449 transitions. [2020-10-21 23:02:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:02:08,820 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:08,820 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:08,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:02:08,820 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:08,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:08,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1393825750, now seen corresponding path program 1 times [2020-10-21 23:02:08,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:08,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576593506] [2020-10-21 23:02:08,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:02:08,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576593506] [2020-10-21 23:02:08,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:08,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:02:08,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482334800] [2020-10-21 23:02:08,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:02:08,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:08,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:02:08,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:02:08,917 INFO L87 Difference]: Start difference. First operand 1403 states and 4449 transitions. Second operand 5 states. [2020-10-21 23:02:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:08,997 INFO L93 Difference]: Finished difference Result 1237 states and 3587 transitions. [2020-10-21 23:02:08,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:02:08,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-21 23:02:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:09,004 INFO L225 Difference]: With dead ends: 1237 [2020-10-21 23:02:09,004 INFO L226 Difference]: Without dead ends: 935 [2020-10-21 23:02:09,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:02:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2020-10-21 23:02:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 935. [2020-10-21 23:02:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2020-10-21 23:02:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 2659 transitions. [2020-10-21 23:02:09,047 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 2659 transitions. Word has length 17 [2020-10-21 23:02:09,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:09,048 INFO L481 AbstractCegarLoop]: Abstraction has 935 states and 2659 transitions. [2020-10-21 23:02:09,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:02:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 2659 transitions. [2020-10-21 23:02:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:02:09,052 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:09,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:09,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:02:09,053 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:09,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:09,054 INFO L82 PathProgramCache]: Analyzing trace with hash -232445824, now seen corresponding path program 1 times [2020-10-21 23:02:09,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:09,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786994159] [2020-10-21 23:02:09,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:02:09,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786994159] [2020-10-21 23:02:09,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:09,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:02:09,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588185559] [2020-10-21 23:02:09,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:02:09,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:09,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:02:09,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:09,179 INFO L87 Difference]: Start difference. First operand 935 states and 2659 transitions. Second operand 3 states. [2020-10-21 23:02:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:09,215 INFO L93 Difference]: Finished difference Result 1319 states and 3612 transitions. [2020-10-21 23:02:09,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:02:09,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-21 23:02:09,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:09,225 INFO L225 Difference]: With dead ends: 1319 [2020-10-21 23:02:09,225 INFO L226 Difference]: Without dead ends: 945 [2020-10-21 23:02:09,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:02:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2020-10-21 23:02:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 919. [2020-10-21 23:02:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2020-10-21 23:02:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 2471 transitions. [2020-10-21 23:02:09,264 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 2471 transitions. Word has length 19 [2020-10-21 23:02:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:09,266 INFO L481 AbstractCegarLoop]: Abstraction has 919 states and 2471 transitions. [2020-10-21 23:02:09,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:02:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 2471 transitions. [2020-10-21 23:02:09,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:02:09,269 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:09,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:09,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:02:09,270 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:09,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:09,271 INFO L82 PathProgramCache]: Analyzing trace with hash 106051531, now seen corresponding path program 1 times [2020-10-21 23:02:09,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:09,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398755695] [2020-10-21 23:02:09,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:02:09,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398755695] [2020-10-21 23:02:09,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:09,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:02:09,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536144426] [2020-10-21 23:02:09,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:02:09,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:09,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:02:09,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:02:09,423 INFO L87 Difference]: Start difference. First operand 919 states and 2471 transitions. Second operand 6 states. [2020-10-21 23:02:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:09,495 INFO L93 Difference]: Finished difference Result 808 states and 2125 transitions. [2020-10-21 23:02:09,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:02:09,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-21 23:02:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:09,499 INFO L225 Difference]: With dead ends: 808 [2020-10-21 23:02:09,499 INFO L226 Difference]: Without dead ends: 648 [2020-10-21 23:02:09,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:02:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-10-21 23:02:09,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 608. [2020-10-21 23:02:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2020-10-21 23:02:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1578 transitions. [2020-10-21 23:02:09,517 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1578 transitions. Word has length 19 [2020-10-21 23:02:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:09,517 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 1578 transitions. [2020-10-21 23:02:09,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:02:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1578 transitions. [2020-10-21 23:02:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:02:09,519 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:09,519 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:09,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:02:09,520 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:09,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:09,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1372551299, now seen corresponding path program 1 times [2020-10-21 23:02:09,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:09,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799655578] [2020-10-21 23:02:09,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:02:09,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799655578] [2020-10-21 23:02:09,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:09,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:02:09,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350413707] [2020-10-21 23:02:09,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:02:09,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:09,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:02:09,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:02:09,604 INFO L87 Difference]: Start difference. First operand 608 states and 1578 transitions. Second operand 4 states. [2020-10-21 23:02:09,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:09,632 INFO L93 Difference]: Finished difference Result 803 states and 2028 transitions. [2020-10-21 23:02:09,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:02:09,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-21 23:02:09,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:09,636 INFO L225 Difference]: With dead ends: 803 [2020-10-21 23:02:09,637 INFO L226 Difference]: Without dead ends: 435 [2020-10-21 23:02:09,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:02:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2020-10-21 23:02:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 432. [2020-10-21 23:02:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-10-21 23:02:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1005 transitions. [2020-10-21 23:02:09,653 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1005 transitions. Word has length 22 [2020-10-21 23:02:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:09,653 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 1005 transitions. [2020-10-21 23:02:09,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:02:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1005 transitions. [2020-10-21 23:02:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:02:09,655 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:09,655 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:09,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:02:09,655 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:09,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:09,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1722088816, now seen corresponding path program 1 times [2020-10-21 23:02:09,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:09,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680754252] [2020-10-21 23:02:09,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:02:09,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680754252] [2020-10-21 23:02:09,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:09,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:02:09,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169619811] [2020-10-21 23:02:09,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:02:09,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:09,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:02:09,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:02:09,865 INFO L87 Difference]: Start difference. First operand 432 states and 1005 transitions. Second operand 7 states. [2020-10-21 23:02:09,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:09,989 INFO L93 Difference]: Finished difference Result 537 states and 1219 transitions. [2020-10-21 23:02:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:02:09,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-21 23:02:09,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:09,991 INFO L225 Difference]: With dead ends: 537 [2020-10-21 23:02:09,991 INFO L226 Difference]: Without dead ends: 299 [2020-10-21 23:02:09,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:02:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-10-21 23:02:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2020-10-21 23:02:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-10-21 23:02:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 646 transitions. [2020-10-21 23:02:10,000 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 646 transitions. Word has length 22 [2020-10-21 23:02:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:10,001 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 646 transitions. [2020-10-21 23:02:10,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:02:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 646 transitions. [2020-10-21 23:02:10,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:02:10,002 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:10,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:10,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:02:10,003 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:10,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:10,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2144444351, now seen corresponding path program 1 times [2020-10-21 23:02:10,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:10,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104423692] [2020-10-21 23:02:10,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:02:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:02:10,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104423692] [2020-10-21 23:02:10,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:02:10,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:02:10,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102712323] [2020-10-21 23:02:10,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:02:10,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:02:10,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:02:10,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:02:10,124 INFO L87 Difference]: Start difference. First operand 296 states and 646 transitions. Second operand 7 states. [2020-10-21 23:02:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:02:10,219 INFO L93 Difference]: Finished difference Result 276 states and 607 transitions. [2020-10-21 23:02:10,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:02:10,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-21 23:02:10,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:02:10,221 INFO L225 Difference]: With dead ends: 276 [2020-10-21 23:02:10,221 INFO L226 Difference]: Without dead ends: 63 [2020-10-21 23:02:10,221 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:02:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-21 23:02:10,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-21 23:02:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-21 23:02:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 121 transitions. [2020-10-21 23:02:10,224 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 121 transitions. Word has length 22 [2020-10-21 23:02:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:02:10,224 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 121 transitions. [2020-10-21 23:02:10,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:02:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 121 transitions. [2020-10-21 23:02:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-21 23:02:10,225 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:02:10,225 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:02:10,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:02:10,226 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:02:10,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:02:10,226 INFO L82 PathProgramCache]: Analyzing trace with hash 81887815, now seen corresponding path program 1 times [2020-10-21 23:02:10,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:02:10,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059393620] [2020-10-21 23:02:10,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:02:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:02:10,274 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:02:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:02:10,317 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:02:10,361 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:02:10,362 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:02:10,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:02:10,363 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:02:10,379 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L3-->L852: Formula: (let ((.cse7 (= (mod ~z$w_buff1_used~0_In1297583783 256) 0)) (.cse6 (= (mod ~z$r_buff1_thd0~0_In1297583783 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In1297583783 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In1297583783 256) 0))) (let ((.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse3 (or .cse8 .cse9)) (.cse0 (not .cse6)) (.cse1 (not .cse7)) (.cse2 (or .cse6 .cse7))) (and (= ~z$r_buff0_thd0~0_In1297583783 ~z$r_buff0_thd0~0_Out1297583783) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1297583783 0)) (or (and (or (and .cse0 .cse1 (= ~z$w_buff1~0_In1297583783 ~z~0_Out1297583783)) (and .cse2 (= ~z~0_In1297583783 ~z~0_Out1297583783))) .cse3) (and (= ~z~0_Out1297583783 ~z$w_buff0~0_In1297583783) .cse4 .cse5)) (or (and .cse4 .cse5 (= ~z$w_buff0_used~0_Out1297583783 0)) (and (= ~z$w_buff0_used~0_In1297583783 ~z$w_buff0_used~0_Out1297583783) .cse3)) (or (and .cse0 .cse1 (= ~z$w_buff1_used~0_Out1297583783 0)) (and (= ~z$w_buff1_used~0_In1297583783 ~z$w_buff1_used~0_Out1297583783) .cse2)) (= ~z$r_buff1_thd0~0_Out1297583783 ~z$r_buff1_thd0~0_In1297583783)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1297583783, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1297583783, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1297583783, ~z$w_buff0~0=~z$w_buff0~0_In1297583783, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1297583783, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1297583783, ~z$w_buff1~0=~z$w_buff1~0_In1297583783, ~z~0=~z~0_In1297583783} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1297583783, ~z$w_buff0~0=~z$w_buff0~0_In1297583783, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1297583783, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1297583783|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1297583783|, ~z$w_buff1~0=~z$w_buff1~0_In1297583783, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1297583783|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1297583783|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1297583783|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1297583783|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1297583783, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1297583783, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1297583783, ~z~0=~z~0_Out1297583783} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ~z~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-21 23:02:10,387 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,387 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [795] [2020-10-21 23:02:10,390 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,390 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,390 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,391 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,391 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,392 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,392 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,393 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,393 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,393 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,395 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,395 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,395 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,395 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,395 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,395 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,396 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,396 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,396 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,397 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,397 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,398 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,398 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,399 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,399 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,399 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:02:10,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:02:10,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:02:10 BasicIcfg [2020-10-21 23:02:10,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:02:10,481 INFO L168 Benchmark]: Toolchain (without parser) took 18037.70 ms. Allocated memory was 140.5 MB in the beginning and 395.3 MB in the end (delta: 254.8 MB). Free memory was 102.4 MB in the beginning and 133.1 MB in the end (delta: -30.8 MB). Peak memory consumption was 224.0 MB. Max. memory is 7.1 GB. [2020-10-21 23:02:10,482 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 140.5 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-21 23:02:10,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 839.61 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.5 MB in the beginning and 154.0 MB in the end (delta: -52.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-10-21 23:02:10,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.61 ms. Allocated memory is still 203.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:02:10,484 INFO L168 Benchmark]: Boogie Preprocessor took 57.16 ms. Allocated memory is still 203.9 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:02:10,485 INFO L168 Benchmark]: RCFGBuilder took 2076.27 ms. Allocated memory was 203.9 MB in the beginning and 246.9 MB in the end (delta: 43.0 MB). Free memory was 148.6 MB in the beginning and 171.3 MB in the end (delta: -22.7 MB). Peak memory consumption was 98.0 MB. Max. memory is 7.1 GB. [2020-10-21 23:02:10,485 INFO L168 Benchmark]: TraceAbstraction took 14976.03 ms. Allocated memory was 246.9 MB in the beginning and 395.3 MB in the end (delta: 148.4 MB). Free memory was 171.3 MB in the beginning and 133.1 MB in the end (delta: 38.2 MB). Peak memory consumption was 186.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:02:10,489 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 140.5 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 839.61 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.5 MB in the beginning and 154.0 MB in the end (delta: -52.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.61 ms. Allocated memory is still 203.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.16 ms. Allocated memory is still 203.9 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2076.27 ms. Allocated memory was 203.9 MB in the beginning and 246.9 MB in the end (delta: 43.0 MB). Free memory was 148.6 MB in the beginning and 171.3 MB in the end (delta: -22.7 MB). Peak memory consumption was 98.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14976.03 ms. Allocated memory was 246.9 MB in the beginning and 395.3 MB in the end (delta: 148.4 MB). Free memory was 171.3 MB in the beginning and 133.1 MB in the end (delta: 38.2 MB). Peak memory consumption was 186.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1396 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 105 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.2s, 126 PlacesBefore, 44 PlacesAfterwards, 116 TransitionsBefore, 31 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, 7247 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1537; [L835] FCALL, FORK 0 pthread_create(&t1537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1538; [L837] FCALL, FORK 0 pthread_create(&t1538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1539; [L839] FCALL, FORK 0 pthread_create(&t1539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1540; [L841] FCALL, FORK 0 pthread_create(&t1540, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, 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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix057_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.4s, HoareTripleCheckerStatistics: 425 SDtfs, 419 SDslu, 553 SDs, 0 SdLazy, 258 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred 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.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 392 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 18658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...