/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:19:22,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:19:22,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:19:22,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:19:22,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:19:22,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:19:22,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:19:22,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:19:22,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:19:22,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:19:22,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:19:22,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:19:22,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:19:22,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:19:22,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:19:22,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:19:22,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:19:22,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:19:22,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:19:22,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:19:22,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:19:22,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:19:22,870 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:19:22,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:19:22,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:19:22,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:19:22,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:19:22,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:19:22,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:19:22,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:19:22,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:19:22,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:19:22,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:19:22,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:19:22,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:19:22,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:19:22,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:19:22,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:19:22,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:19:22,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:19:22,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:19:22,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-22 00:19:22,947 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:19:22,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:19:22,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:19:22,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:19:22,951 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:19:22,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:19:22,951 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:19:22,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:19:22,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:19:22,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:19:22,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:19:22,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:19:22,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:19:22,954 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:19:22,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:19:22,954 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:19:22,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:19:22,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:19:22,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:19:22,955 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:19:22,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:19:22,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:19:22,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:19:22,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:19:22,956 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:19:22,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:19:22,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:19:22,957 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:19:22,957 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:19:22,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:19:22,958 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:19:23,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:19:23,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:19:23,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:19:23,339 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:19:23,341 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:19:23,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2020-10-22 00:19:23,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19c0a3afe/d15781041cbb4075877538b128cf76ac/FLAGc8c2d6b46 [2020-10-22 00:19:23,911 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:19:23,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2020-10-22 00:19:23,926 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19c0a3afe/d15781041cbb4075877538b128cf76ac/FLAGc8c2d6b46 [2020-10-22 00:19:24,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19c0a3afe/d15781041cbb4075877538b128cf76ac [2020-10-22 00:19:24,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:19:24,216 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:19:24,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:19:24,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:19:24,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:19:24,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:19:24" (1/1) ... [2020-10-22 00:19:24,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce0cdd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:19:24, skipping insertion in model container [2020-10-22 00:19:24,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:19:24" (1/1) ... [2020-10-22 00:19:24,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:19:24,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:19:24,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:19:24,985 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:19:25,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:19:25,128 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:19:25,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:19:25 WrapperNode [2020-10-22 00:19:25,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:19:25,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:19:25,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:19:25,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:19:25,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:19:25" (1/1) ... [2020-10-22 00:19:25,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:19:25" (1/1) ... [2020-10-22 00:19:25,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:19:25,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:19:25,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:19:25,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:19:25,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:19:25" (1/1) ... [2020-10-22 00:19:25,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:19:25" (1/1) ... [2020-10-22 00:19:25,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:19:25" (1/1) ... [2020-10-22 00:19:25,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:19:25" (1/1) ... [2020-10-22 00:19:25,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:19:25" (1/1) ... [2020-10-22 00:19:25,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:19:25" (1/1) ... [2020-10-22 00:19:25,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:19:25" (1/1) ... [2020-10-22 00:19:25,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:19:25,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:19:25,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:19:25,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:19:25,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:19:25" (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-22 00:19:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:19:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 00:19:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:19:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:19:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 00:19:25,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 00:19:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 00:19:25,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 00:19:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 00:19:25,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 00:19:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:19:25,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 00:19:25,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:19:25,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:19:25,320 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:19:27,385 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:19:27,385 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 00:19:27,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:19:27 BoogieIcfgContainer [2020-10-22 00:19:27,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:19:27,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:19:27,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:19:27,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:19:27,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:19:24" (1/3) ... [2020-10-22 00:19:27,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359048c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:19:27, skipping insertion in model container [2020-10-22 00:19:27,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:19:25" (2/3) ... [2020-10-22 00:19:27,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359048c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:19:27, skipping insertion in model container [2020-10-22 00:19:27,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:19:27" (3/3) ... [2020-10-22 00:19:27,396 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_pso.opt.i [2020-10-22 00:19:27,408 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:19:27,408 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:19:27,416 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 00:19:27,417 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:19:27,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,446 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,446 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,447 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,447 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,450 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,450 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,451 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,452 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,458 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,458 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,467 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,470 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,470 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:19:27,471 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:19:27,485 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 00:19:27,506 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:19:27,506 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:19:27,506 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:19:27,506 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:19:27,507 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:19:27,507 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:19:27,507 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:19:27,507 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:19:27,521 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:19:27,521 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 104 transitions, 223 flow [2020-10-22 00:19:27,524 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 104 transitions, 223 flow [2020-10-22 00:19:27,526 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 111 places, 104 transitions, 223 flow [2020-10-22 00:19:27,575 INFO L129 PetriNetUnfolder]: 3/101 cut-off events. [2020-10-22 00:19:27,576 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:19:27,581 INFO L80 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 3/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2020-10-22 00:19:27,584 INFO L116 LiptonReduction]: Number of co-enabled transitions 1922 [2020-10-22 00:19:28,010 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-22 00:19:30,122 WARN L193 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-22 00:19:30,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-22 00:19:30,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:19:30,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-22 00:19:30,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:19:31,358 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-22 00:19:31,806 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-22 00:19:33,584 WARN L193 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-10-22 00:19:33,814 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-22 00:19:33,823 INFO L131 LiptonReduction]: Checked pairs total: 5760 [2020-10-22 00:19:33,825 INFO L133 LiptonReduction]: Total number of compositions: 91 [2020-10-22 00:19:33,848 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-10-22 00:19:33,943 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1030 states. [2020-10-22 00:19:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states. [2020-10-22 00:19:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-22 00:19:33,964 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:19:33,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:19:33,965 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:19:33,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:19:33,972 INFO L82 PathProgramCache]: Analyzing trace with hash -141166123, now seen corresponding path program 1 times [2020-10-22 00:19:33,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:19:33,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260280150] [2020-10-22 00:19:33,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:19:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:19:34,257 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-22 00:19:34,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260280150] [2020-10-22 00:19:34,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:19:34,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:19:34,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1191952712] [2020-10-22 00:19:34,261 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:19:34,265 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:19:34,281 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-22 00:19:34,281 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:19:34,286 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:19:34,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:19:34,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:19:34,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:19:34,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:19:34,301 INFO L87 Difference]: Start difference. First operand 1030 states. Second operand 3 states. [2020-10-22 00:19:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:19:34,383 INFO L93 Difference]: Finished difference Result 890 states and 2840 transitions. [2020-10-22 00:19:34,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:19:34,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-22 00:19:34,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:19:34,411 INFO L225 Difference]: With dead ends: 890 [2020-10-22 00:19:34,411 INFO L226 Difference]: Without dead ends: 650 [2020-10-22 00:19:34,413 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-22 00:19:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-10-22 00:19:34,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2020-10-22 00:19:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2020-10-22 00:19:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2020-10-22 00:19:34,534 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 7 [2020-10-22 00:19:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:19:34,536 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2020-10-22 00:19:34,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:19:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2020-10-22 00:19:34,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:19:34,539 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:19:34,539 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:19:34,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:19:34,540 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:19:34,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:19:34,540 INFO L82 PathProgramCache]: Analyzing trace with hash -704607506, now seen corresponding path program 1 times [2020-10-22 00:19:34,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:19:34,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693602937] [2020-10-22 00:19:34,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:19:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:19:34,801 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-22 00:19:34,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693602937] [2020-10-22 00:19:34,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:19:34,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:19:34,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1260139450] [2020-10-22 00:19:34,802 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:19:34,803 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:19:34,806 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-22 00:19:34,806 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:19:34,807 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:19:34,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:19:34,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:19:34,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:19:34,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:19:34,809 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand 5 states. [2020-10-22 00:19:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:19:34,917 INFO L93 Difference]: Finished difference Result 766 states and 2300 transitions. [2020-10-22 00:19:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:19:34,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-22 00:19:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:19:34,925 INFO L225 Difference]: With dead ends: 766 [2020-10-22 00:19:34,925 INFO L226 Difference]: Without dead ends: 646 [2020-10-22 00:19:34,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:19:34,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-10-22 00:19:34,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2020-10-22 00:19:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2020-10-22 00:19:34,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 2012 transitions. [2020-10-22 00:19:34,950 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 2012 transitions. Word has length 10 [2020-10-22 00:19:34,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:19:34,951 INFO L481 AbstractCegarLoop]: Abstraction has 646 states and 2012 transitions. [2020-10-22 00:19:34,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:19:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 2012 transitions. [2020-10-22 00:19:34,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:19:34,953 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:19:34,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:19:34,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:19:34,954 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:19:34,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:19:34,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1874850536, now seen corresponding path program 1 times [2020-10-22 00:19:34,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:19:34,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064973897] [2020-10-22 00:19:34,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:19:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:19:35,057 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-22 00:19:35,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064973897] [2020-10-22 00:19:35,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:19:35,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:19:35,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [588791751] [2020-10-22 00:19:35,059 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:19:35,060 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:19:35,063 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions. [2020-10-22 00:19:35,063 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:19:35,191 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:19:35,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:19:35,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:19:35,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:19:35,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:19:35,193 INFO L87 Difference]: Start difference. First operand 646 states and 2012 transitions. Second operand 4 states. [2020-10-22 00:19:35,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:19:35,227 INFO L93 Difference]: Finished difference Result 688 states and 2062 transitions. [2020-10-22 00:19:35,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:19:35,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-22 00:19:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:19:35,232 INFO L225 Difference]: With dead ends: 688 [2020-10-22 00:19:35,232 INFO L226 Difference]: Without dead ends: 570 [2020-10-22 00:19:35,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-22 00:19:35,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-10-22 00:19:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2020-10-22 00:19:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2020-10-22 00:19:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1744 transitions. [2020-10-22 00:19:35,252 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1744 transitions. Word has length 11 [2020-10-22 00:19:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:19:35,252 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 1744 transitions. [2020-10-22 00:19:35,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:19:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1744 transitions. [2020-10-22 00:19:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 00:19:35,254 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:19:35,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:19:35,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:19:35,255 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:19:35,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:19:35,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1473373074, now seen corresponding path program 1 times [2020-10-22 00:19:35,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:19:35,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773816987] [2020-10-22 00:19:35,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:19:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:19:35,508 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-22 00:19:35,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773816987] [2020-10-22 00:19:35,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:19:35,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:19:35,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1370646779] [2020-10-22 00:19:35,509 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:19:35,511 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:19:35,514 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 18 transitions. [2020-10-22 00:19:35,514 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:19:35,575 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:19:35,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:19:35,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:19:35,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:19:35,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:19:35,576 INFO L87 Difference]: Start difference. First operand 570 states and 1744 transitions. Second operand 6 states. [2020-10-22 00:19:35,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:19:35,681 INFO L93 Difference]: Finished difference Result 634 states and 1876 transitions. [2020-10-22 00:19:35,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:19:35,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-22 00:19:35,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:19:35,686 INFO L225 Difference]: With dead ends: 634 [2020-10-22 00:19:35,687 INFO L226 Difference]: Without dead ends: 554 [2020-10-22 00:19:35,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:19:35,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-10-22 00:19:35,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2020-10-22 00:19:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2020-10-22 00:19:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1684 transitions. [2020-10-22 00:19:35,709 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1684 transitions. Word has length 12 [2020-10-22 00:19:35,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:19:35,709 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 1684 transitions. [2020-10-22 00:19:35,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:19:35,709 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1684 transitions. [2020-10-22 00:19:35,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:19:35,713 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:19:35,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:19:35,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:19:35,714 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:19:35,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:19:35,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2143714500, now seen corresponding path program 1 times [2020-10-22 00:19:35,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:19:35,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403012327] [2020-10-22 00:19:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:19:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:19:36,061 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-22 00:19:36,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403012327] [2020-10-22 00:19:36,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:19:36,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:19:36,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [23408270] [2020-10-22 00:19:36,063 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:19:36,065 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:19:36,070 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 40 transitions. [2020-10-22 00:19:36,070 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:19:36,726 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:19:36,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:19:36,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:19:36,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:19:36,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:19:36,728 INFO L87 Difference]: Start difference. First operand 554 states and 1684 transitions. Second operand 6 states. [2020-10-22 00:19:36,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:19:36,887 INFO L93 Difference]: Finished difference Result 650 states and 1924 transitions. [2020-10-22 00:19:36,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:19:36,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-22 00:19:36,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:19:36,895 INFO L225 Difference]: With dead ends: 650 [2020-10-22 00:19:36,895 INFO L226 Difference]: Without dead ends: 578 [2020-10-22 00:19:36,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:19:36,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-10-22 00:19:36,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2020-10-22 00:19:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2020-10-22 00:19:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1750 transitions. [2020-10-22 00:19:36,918 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 1750 transitions. Word has length 13 [2020-10-22 00:19:36,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:19:36,918 INFO L481 AbstractCegarLoop]: Abstraction has 578 states and 1750 transitions. [2020-10-22 00:19:36,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:19:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1750 transitions. [2020-10-22 00:19:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:19:36,920 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:19:36,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:19:36,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:19:36,921 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:19:36,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:19:36,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2139908940, now seen corresponding path program 2 times [2020-10-22 00:19:36,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:19:36,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497269302] [2020-10-22 00:19:36,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:19:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:19:37,129 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-22 00:19:37,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497269302] [2020-10-22 00:19:37,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:19:37,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:19:37,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2138688064] [2020-10-22 00:19:37,130 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:19:37,132 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:19:37,136 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2020-10-22 00:19:37,136 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:19:37,387 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:19:37,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:19:37,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:19:37,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:19:37,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:19:37,389 INFO L87 Difference]: Start difference. First operand 578 states and 1750 transitions. Second operand 6 states. [2020-10-22 00:19:37,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:19:37,549 INFO L93 Difference]: Finished difference Result 626 states and 1836 transitions. [2020-10-22 00:19:37,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:19:37,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-22 00:19:37,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:19:37,554 INFO L225 Difference]: With dead ends: 626 [2020-10-22 00:19:37,555 INFO L226 Difference]: Without dead ends: 554 [2020-10-22 00:19:37,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:19:37,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-10-22 00:19:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 530. [2020-10-22 00:19:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-22 00:19:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1596 transitions. [2020-10-22 00:19:37,571 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1596 transitions. Word has length 13 [2020-10-22 00:19:37,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:19:37,572 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1596 transitions. [2020-10-22 00:19:37,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:19:37,572 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1596 transitions. [2020-10-22 00:19:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:19:37,573 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:19:37,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:19:37,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:19:37,574 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:19:37,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:19:37,574 INFO L82 PathProgramCache]: Analyzing trace with hash -851135848, now seen corresponding path program 1 times [2020-10-22 00:19:37,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:19:37,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602485451] [2020-10-22 00:19:37,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:19:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:19:37,773 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-22 00:19:37,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602485451] [2020-10-22 00:19:37,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:19:37,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:19:37,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [514382224] [2020-10-22 00:19:37,774 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:19:37,777 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:19:37,782 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 52 transitions. [2020-10-22 00:19:37,782 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:19:38,455 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13533#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 0) (= 2 ~y$w_buff0~0) (<= 0 ~y$r_buff1_thd0~0) (<= 0 ~y$r_buff0_thd0~0))] [2020-10-22 00:19:38,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 00:19:38,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:19:38,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 00:19:38,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:19:38,457 INFO L87 Difference]: Start difference. First operand 530 states and 1596 transitions. Second operand 8 states. [2020-10-22 00:19:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:19:38,784 INFO L93 Difference]: Finished difference Result 642 states and 1892 transitions. [2020-10-22 00:19:38,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 00:19:38,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-22 00:19:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:19:38,793 INFO L225 Difference]: With dead ends: 642 [2020-10-22 00:19:38,795 INFO L226 Difference]: Without dead ends: 586 [2020-10-22 00:19:38,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-22 00:19:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-10-22 00:19:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 570. [2020-10-22 00:19:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2020-10-22 00:19:38,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1710 transitions. [2020-10-22 00:19:38,816 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1710 transitions. Word has length 14 [2020-10-22 00:19:38,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:19:38,817 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 1710 transitions. [2020-10-22 00:19:38,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 00:19:38,817 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1710 transitions. [2020-10-22 00:19:38,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:19:38,818 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:19:38,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:19:38,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:19:38,819 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:19:38,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:19:38,819 INFO L82 PathProgramCache]: Analyzing trace with hash -847330288, now seen corresponding path program 2 times [2020-10-22 00:19:38,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:19:38,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768553351] [2020-10-22 00:19:38,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:19:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:19:39,036 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-22 00:19:39,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768553351] [2020-10-22 00:19:39,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:19:39,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:19:39,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2126139623] [2020-10-22 00:19:39,038 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:19:39,040 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:19:39,044 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 26 transitions. [2020-10-22 00:19:39,045 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:19:39,199 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:19:39,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:19:39,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:19:39,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:19:39,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:19:39,201 INFO L87 Difference]: Start difference. First operand 570 states and 1710 transitions. Second operand 7 states. [2020-10-22 00:19:39,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:19:39,469 INFO L93 Difference]: Finished difference Result 690 states and 2024 transitions. [2020-10-22 00:19:39,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:19:39,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-22 00:19:39,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:19:39,475 INFO L225 Difference]: With dead ends: 690 [2020-10-22 00:19:39,475 INFO L226 Difference]: Without dead ends: 626 [2020-10-22 00:19:39,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-22 00:19:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-10-22 00:19:39,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 610. [2020-10-22 00:19:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-10-22 00:19:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1816 transitions. [2020-10-22 00:19:39,497 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1816 transitions. Word has length 14 [2020-10-22 00:19:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:19:39,497 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 1816 transitions. [2020-10-22 00:19:39,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:19:39,498 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1816 transitions. [2020-10-22 00:19:39,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:19:39,500 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:19:39,500 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:19:39,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:19:39,500 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:19:39,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:19:39,501 INFO L82 PathProgramCache]: Analyzing trace with hash -615473533, now seen corresponding path program 1 times [2020-10-22 00:19:39,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:19:39,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505023330] [2020-10-22 00:19:39,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:19:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:19:39,775 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-22 00:19:39,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505023330] [2020-10-22 00:19:39,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:19:39,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:19:39,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1045690880] [2020-10-22 00:19:39,777 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:19:39,779 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:19:39,786 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 55 transitions. [2020-10-22 00:19:39,787 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:19:40,341 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [17253#(and (<= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff1_thd0~0) (<= 0 ~y$r_buff0_thd0~0) (= ~y$r_buff0_thd2~0 0))] [2020-10-22 00:19:40,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:19:40,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:19:40,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:19:40,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:19:40,342 INFO L87 Difference]: Start difference. First operand 610 states and 1816 transitions. Second operand 9 states. [2020-10-22 00:19:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:19:40,641 INFO L93 Difference]: Finished difference Result 722 states and 2068 transitions. [2020-10-22 00:19:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 00:19:40,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-22 00:19:40,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:19:40,648 INFO L225 Difference]: With dead ends: 722 [2020-10-22 00:19:40,648 INFO L226 Difference]: Without dead ends: 602 [2020-10-22 00:19:40,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-10-22 00:19:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-10-22 00:19:40,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 482. [2020-10-22 00:19:40,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-22 00:19:40,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1408 transitions. [2020-10-22 00:19:40,670 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1408 transitions. Word has length 15 [2020-10-22 00:19:40,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:19:40,670 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1408 transitions. [2020-10-22 00:19:40,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:19:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1408 transitions. [2020-10-22 00:19:40,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:19:40,672 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:19:40,673 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:19:40,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:19:40,673 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:19:40,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:19:40,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1409204827, now seen corresponding path program 1 times [2020-10-22 00:19:40,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:19:40,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402250667] [2020-10-22 00:19:40,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:19:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:19:40,775 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-22 00:19:40,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402250667] [2020-10-22 00:19:40,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:19:40,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:19:40,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1261476832] [2020-10-22 00:19:40,776 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:19:40,779 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:19:40,786 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 51 transitions. [2020-10-22 00:19:40,787 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:19:40,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:19:41,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:19:41,135 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [18952#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-22 00:19:41,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:19:41,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:19:41,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:19:41,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:19:41,136 INFO L87 Difference]: Start difference. First operand 482 states and 1408 transitions. Second operand 5 states. [2020-10-22 00:19:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:19:41,195 INFO L93 Difference]: Finished difference Result 334 states and 863 transitions. [2020-10-22 00:19:41,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:19:41,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-22 00:19:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:19:41,197 INFO L225 Difference]: With dead ends: 334 [2020-10-22 00:19:41,197 INFO L226 Difference]: Without dead ends: 214 [2020-10-22 00:19:41,198 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:19:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-10-22 00:19:41,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2020-10-22 00:19:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-22 00:19:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 478 transitions. [2020-10-22 00:19:41,204 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 478 transitions. Word has length 15 [2020-10-22 00:19:41,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:19:41,204 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 478 transitions. [2020-10-22 00:19:41,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:19:41,205 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 478 transitions. [2020-10-22 00:19:41,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 00:19:41,205 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:19:41,206 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:19:41,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:19:41,206 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:19:41,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:19:41,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1337391238, now seen corresponding path program 1 times [2020-10-22 00:19:41,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:19:41,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443168910] [2020-10-22 00:19:41,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:19:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:19:41,374 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-22 00:19:41,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443168910] [2020-10-22 00:19:41,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:19:41,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:19:41,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [341043843] [2020-10-22 00:19:41,375 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:19:41,378 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:19:41,387 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 62 transitions. [2020-10-22 00:19:41,387 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:19:41,889 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [19727#(and (<= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 0) (<= 0 ~y$r_buff1_thd0~0) (<= 0 ~y$r_buff0_thd0~0))] [2020-10-22 00:19:41,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:19:41,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:19:41,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:19:41,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:19:41,890 INFO L87 Difference]: Start difference. First operand 214 states and 478 transitions. Second operand 9 states. [2020-10-22 00:19:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:19:41,993 INFO L93 Difference]: Finished difference Result 285 states and 615 transitions. [2020-10-22 00:19:41,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:19:41,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-10-22 00:19:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:19:41,995 INFO L225 Difference]: With dead ends: 285 [2020-10-22 00:19:41,995 INFO L226 Difference]: Without dead ends: 127 [2020-10-22 00:19:41,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-10-22 00:19:41,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-22 00:19:42,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-10-22 00:19:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-22 00:19:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 244 transitions. [2020-10-22 00:19:42,001 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 244 transitions. Word has length 18 [2020-10-22 00:19:42,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:19:42,001 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 244 transitions. [2020-10-22 00:19:42,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:19:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 244 transitions. [2020-10-22 00:19:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 00:19:42,002 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:19:42,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:19:42,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:19:42,002 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:19:42,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:19:42,003 INFO L82 PathProgramCache]: Analyzing trace with hash -717373716, now seen corresponding path program 2 times [2020-10-22 00:19:42,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:19:42,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085554353] [2020-10-22 00:19:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:19:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:19:42,140 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-22 00:19:42,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085554353] [2020-10-22 00:19:42,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:19:42,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:19:42,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [327493297] [2020-10-22 00:19:42,141 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:19:42,143 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:19:42,148 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-10-22 00:19:42,148 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:19:42,193 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:19:42,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:19:42,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:19:42,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:19:42,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:19:42,194 INFO L87 Difference]: Start difference. First operand 127 states and 244 transitions. Second operand 7 states. [2020-10-22 00:19:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:19:42,279 INFO L93 Difference]: Finished difference Result 178 states and 326 transitions. [2020-10-22 00:19:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:19:42,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-22 00:19:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:19:42,281 INFO L225 Difference]: With dead ends: 178 [2020-10-22 00:19:42,281 INFO L226 Difference]: Without dead ends: 125 [2020-10-22 00:19:42,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:19:42,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-22 00:19:42,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2020-10-22 00:19:42,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-22 00:19:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 216 transitions. [2020-10-22 00:19:42,285 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 216 transitions. Word has length 18 [2020-10-22 00:19:42,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:19:42,285 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 216 transitions. [2020-10-22 00:19:42,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:19:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 216 transitions. [2020-10-22 00:19:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:19:42,286 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:19:42,286 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-22 00:19:42,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:19:42,315 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:19:42,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:19:42,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1155310386, now seen corresponding path program 1 times [2020-10-22 00:19:42,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:19:42,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96841006] [2020-10-22 00:19:42,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:19:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:19:42,405 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-22 00:19:42,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96841006] [2020-10-22 00:19:42,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:19:42,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:19:42,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [218109272] [2020-10-22 00:19:42,406 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:19:42,409 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:19:42,415 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 41 transitions. [2020-10-22 00:19:42,416 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:19:42,496 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [20708#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:19:42,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:19:42,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:19:42,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:19:42,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:19:42,498 INFO L87 Difference]: Start difference. First operand 121 states and 216 transitions. Second operand 7 states. [2020-10-22 00:19:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:19:42,550 INFO L93 Difference]: Finished difference Result 99 states and 172 transitions. [2020-10-22 00:19:42,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:19:42,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 00:19:42,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:19:42,552 INFO L225 Difference]: With dead ends: 99 [2020-10-22 00:19:42,552 INFO L226 Difference]: Without dead ends: 37 [2020-10-22 00:19:42,553 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:19:42,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-22 00:19:42,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-22 00:19:42,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-22 00:19:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2020-10-22 00:19:42,555 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 19 [2020-10-22 00:19:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:19:42,555 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2020-10-22 00:19:42,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:19:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2020-10-22 00:19:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:19:42,556 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:19:42,556 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-22 00:19:42,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 00:19:42,557 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:19:42,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:19:42,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1615855003, now seen corresponding path program 1 times [2020-10-22 00:19:42,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:19:42,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189766878] [2020-10-22 00:19:42,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:19:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:19:42,596 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:19:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:19:42,630 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:19:42,666 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:19:42,666 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:19:42,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 00:19:42,686 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-22 00:19:42,687 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [779] [2020-10-22 00:19:42,689 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-22 00:19:42,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,689 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-22 00:19:42,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,689 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-22 00:19:42,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,690 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-22 00:19:42,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,690 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-22 00:19:42,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,691 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-22 00:19:42,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,691 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-22 00:19:42,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,692 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-22 00:19:42,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,692 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-22 00:19:42,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,692 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-22 00:19:42,693 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,693 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-22 00:19:42,693 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,694 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-22 00:19:42,694 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,694 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-22 00:19:42,694 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,694 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-22 00:19:42,694 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,695 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-22 00:19:42,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,695 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-22 00:19:42,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,696 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-22 00:19:42,696 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,696 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-22 00:19:42,696 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,696 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-22 00:19:42,696 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,697 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-22 00:19:42,697 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,697 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-22 00:19:42,697 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,697 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-22 00:19:42,697 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,698 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-22 00:19:42,698 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,698 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-22 00:19:42,698 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,698 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-22 00:19:42,698 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,699 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-22 00:19:42,699 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,699 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-22 00:19:42,699 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:19:42,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:19:42 BasicIcfg [2020-10-22 00:19:42,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:19:42,770 INFO L168 Benchmark]: Toolchain (without parser) took 18558.95 ms. Allocated memory was 143.1 MB in the beginning and 417.9 MB in the end (delta: 274.7 MB). Free memory was 103.6 MB in the beginning and 291.0 MB in the end (delta: -187.4 MB). Peak memory consumption was 87.3 MB. Max. memory is 7.1 GB. [2020-10-22 00:19:42,770 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 143.1 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-22 00:19:42,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 911.85 ms. Allocated memory was 143.1 MB in the beginning and 205.5 MB in the end (delta: 62.4 MB). Free memory was 102.7 MB in the beginning and 157.5 MB in the end (delta: -54.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-10-22 00:19:42,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.31 ms. Allocated memory is still 205.5 MB. Free memory was 157.5 MB in the beginning and 154.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-10-22 00:19:42,772 INFO L168 Benchmark]: Boogie Preprocessor took 46.03 ms. Allocated memory is still 205.5 MB. Free memory was 154.4 MB in the beginning and 151.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-10-22 00:19:42,773 INFO L168 Benchmark]: RCFGBuilder took 2138.41 ms. Allocated memory was 205.5 MB in the beginning and 242.7 MB in the end (delta: 37.2 MB). Free memory was 151.9 MB in the beginning and 165.2 MB in the end (delta: -13.2 MB). Peak memory consumption was 88.8 MB. Max. memory is 7.1 GB. [2020-10-22 00:19:42,774 INFO L168 Benchmark]: TraceAbstraction took 15378.90 ms. Allocated memory was 242.7 MB in the beginning and 417.9 MB in the end (delta: 175.1 MB). Free memory was 163.5 MB in the beginning and 291.0 MB in the end (delta: -127.5 MB). Peak memory consumption was 47.6 MB. Max. memory is 7.1 GB. [2020-10-22 00:19:42,778 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.17 ms. Allocated memory is still 143.1 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 911.85 ms. Allocated memory was 143.1 MB in the beginning and 205.5 MB in the end (delta: 62.4 MB). Free memory was 102.7 MB in the beginning and 157.5 MB in the end (delta: -54.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.31 ms. Allocated memory is still 205.5 MB. Free memory was 157.5 MB in the beginning and 154.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.03 ms. Allocated memory is still 205.5 MB. Free memory was 154.4 MB in the beginning and 151.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2138.41 ms. Allocated memory was 205.5 MB in the beginning and 242.7 MB in the end (delta: 37.2 MB). Free memory was 151.9 MB in the beginning and 165.2 MB in the end (delta: -13.2 MB). Peak memory consumption was 88.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15378.90 ms. Allocated memory was 242.7 MB in the beginning and 417.9 MB in the end (delta: 175.1 MB). Free memory was 163.5 MB in the beginning and 291.0 MB in the end (delta: -127.5 MB). Peak memory consumption was 47.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1040 VarBasedMoverChecksPositive, 38 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 96 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.3s, 111 PlacesBefore, 38 PlacesAfterwards, 104 TransitionsBefore, 29 TransitionsAfterwards, 1922 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 5760 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1202; [L824] FCALL, FORK 0 pthread_create(&t1202, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1203; [L826] FCALL, FORK 0 pthread_create(&t1203, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1204; [L828] FCALL, FORK 0 pthread_create(&t1204, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L760] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L845] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L846] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L846] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L850] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L850] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix045_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 413 SDtfs, 499 SDslu, 1029 SDs, 0 SdLazy, 445 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1030occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 180 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 25757 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...