/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:06:25,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:06:25,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:06:25,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:06:25,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:06:25,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:06:25,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:06:25,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:06:25,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:06:25,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:06:25,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:06:25,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:06:25,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:06:25,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:06:25,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:06:25,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:06:25,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:06:25,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:06:25,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:06:25,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:06:25,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:06:25,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:06:25,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:06:25,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:06:25,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:06:25,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:06:25,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:06:25,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:06:25,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:06:25,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:06:25,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:06:25,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:06:25,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:06:25,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:06:25,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:06:25,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:06:25,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:06:25,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:06:25,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:06:25,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:06:25,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:06:25,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 23:06:25,297 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:06:25,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:06:25,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:06:25,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:06:25,302 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:06:25,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:06:25,302 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:06:25,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:06:25,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:06:25,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:06:25,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:06:25,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:06:25,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:06:25,304 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:06:25,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:06:25,304 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:06:25,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:06:25,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:06:25,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:06:25,305 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:06:25,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:06:25,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:06:25,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:06:25,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:06:25,306 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:06:25,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:06:25,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:06:25,306 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:06:25,307 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:06:25,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:06:25,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:06:25,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:06:25,638 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:06:25,639 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:06:25,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i [2020-10-21 23:06:25,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1a9c028/c18643682195465b9a2028de09cb8121/FLAG5baa419b3 [2020-10-21 23:06:26,246 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:06:26,247 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i [2020-10-21 23:06:26,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1a9c028/c18643682195465b9a2028de09cb8121/FLAG5baa419b3 [2020-10-21 23:06:26,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1a9c028/c18643682195465b9a2028de09cb8121 [2020-10-21 23:06:26,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:06:26,489 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:06:26,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:06:26,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:06:26,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:06:26,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:06:26" (1/1) ... [2020-10-21 23:06:26,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66be459d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:26, skipping insertion in model container [2020-10-21 23:06:26,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:06:26" (1/1) ... [2020-10-21 23:06:26,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:06:26,554 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:06:27,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:06:27,159 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:06:27,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:06:27,305 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:06:27,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:27 WrapperNode [2020-10-21 23:06:27,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:06:27,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:06:27,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:06:27,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:06:27,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:27" (1/1) ... [2020-10-21 23:06:27,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:27" (1/1) ... [2020-10-21 23:06:27,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:06:27,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:06:27,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:06:27,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:06:27,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:27" (1/1) ... [2020-10-21 23:06:27,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:27" (1/1) ... [2020-10-21 23:06:27,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:27" (1/1) ... [2020-10-21 23:06:27,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:27" (1/1) ... [2020-10-21 23:06:27,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:27" (1/1) ... [2020-10-21 23:06:27,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:27" (1/1) ... [2020-10-21 23:06:27,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:27" (1/1) ... [2020-10-21 23:06:27,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:06:27,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:06:27,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:06:27,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:06:27,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:06:27,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:06:27,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:06:27,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:06:27,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:06:27,514 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:06:27,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:06:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:06:27,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:06:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:06:27,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:06:27,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:06:27,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:06:27,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:06:27,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:06:27,523 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:06:29,656 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:06:29,656 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:06:29,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:06:29 BoogieIcfgContainer [2020-10-21 23:06:29,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:06:29,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:06:29,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:06:29,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:06:29,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:06:26" (1/3) ... [2020-10-21 23:06:29,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cccc109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:06:29, skipping insertion in model container [2020-10-21 23:06:29,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:27" (2/3) ... [2020-10-21 23:06:29,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cccc109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:06:29, skipping insertion in model container [2020-10-21 23:06:29,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:06:29" (3/3) ... [2020-10-21 23:06:29,669 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_power.opt.i [2020-10-21 23:06:29,681 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:06:29,681 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:06:29,689 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:06:29,690 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:06:29,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,721 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,721 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,722 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,723 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,726 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,726 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,729 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,729 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,736 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,737 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,738 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,743 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,743 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,743 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,746 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,746 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:29,749 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:06:29,763 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 23:06:29,784 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:06:29,784 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:06:29,785 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:06:29,785 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:06:29,785 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:06:29,785 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:06:29,785 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:06:29,785 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:06:29,800 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:06:29,800 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 99 transitions, 213 flow [2020-10-21 23:06:29,803 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 99 transitions, 213 flow [2020-10-21 23:06:29,805 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 106 places, 99 transitions, 213 flow [2020-10-21 23:06:29,854 INFO L129 PetriNetUnfolder]: 3/96 cut-off events. [2020-10-21 23:06:29,855 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:06:29,860 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-10-21 23:06:29,863 INFO L116 LiptonReduction]: Number of co-enabled transitions 1770 [2020-10-21 23:06:30,294 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-21 23:06:32,444 WARN L193 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-21 23:06:32,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-21 23:06:32,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:06:32,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 23:06:32,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:06:33,718 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-21 23:06:34,003 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-21 23:06:34,781 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-10-21 23:06:35,594 WARN L193 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-10-21 23:06:35,891 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-21 23:06:36,996 WARN L193 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-21 23:06:37,289 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-21 23:06:37,724 WARN L193 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-10-21 23:06:37,895 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-21 23:06:37,919 INFO L131 LiptonReduction]: Checked pairs total: 4422 [2020-10-21 23:06:37,920 INFO L133 LiptonReduction]: Total number of compositions: 91 [2020-10-21 23:06:37,927 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-21 23:06:37,969 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states. [2020-10-21 23:06:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states. [2020-10-21 23:06:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-21 23:06:37,978 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:37,979 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-21 23:06:37,980 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:37,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:37,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1087337, now seen corresponding path program 1 times [2020-10-21 23:06:37,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:37,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931057206] [2020-10-21 23:06:37,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:38,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931057206] [2020-10-21 23:06:38,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:38,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:06:38,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456391983] [2020-10-21 23:06:38,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:06:38,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:38,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:06:38,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:06:38,244 INFO L87 Difference]: Start difference. First operand 662 states. Second operand 3 states. [2020-10-21 23:06:38,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:38,385 INFO L93 Difference]: Finished difference Result 552 states and 1697 transitions. [2020-10-21 23:06:38,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:06:38,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-21 23:06:38,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:38,410 INFO L225 Difference]: With dead ends: 552 [2020-10-21 23:06:38,410 INFO L226 Difference]: Without dead ends: 452 [2020-10-21 23:06:38,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:06:38,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-21 23:06:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-10-21 23:06:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-10-21 23:06:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions. [2020-10-21 23:06:38,513 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3 [2020-10-21 23:06:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:38,513 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions. [2020-10-21 23:06:38,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:06:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions. [2020-10-21 23:06:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:06:38,517 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:38,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:38,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:06:38,517 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:38,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:38,518 INFO L82 PathProgramCache]: Analyzing trace with hash 153095369, now seen corresponding path program 1 times [2020-10-21 23:06:38,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:38,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508188225] [2020-10-21 23:06:38,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:38,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508188225] [2020-10-21 23:06:38,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:38,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:06:38,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8779213] [2020-10-21 23:06:38,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:06:38,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:38,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:06:38,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:06:38,671 INFO L87 Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 3 states. [2020-10-21 23:06:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:38,687 INFO L93 Difference]: Finished difference Result 432 states and 1291 transitions. [2020-10-21 23:06:38,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:06:38,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:06:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:38,693 INFO L225 Difference]: With dead ends: 432 [2020-10-21 23:06:38,693 INFO L226 Difference]: Without dead ends: 432 [2020-10-21 23:06:38,694 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:06:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-10-21 23:06:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-10-21 23:06:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-10-21 23:06:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1291 transitions. [2020-10-21 23:06:38,717 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1291 transitions. Word has length 9 [2020-10-21 23:06:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:38,718 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 1291 transitions. [2020-10-21 23:06:38,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:06:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1291 transitions. [2020-10-21 23:06:38,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:06:38,720 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:38,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:38,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:06:38,721 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:38,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:38,721 INFO L82 PathProgramCache]: Analyzing trace with hash 450921755, now seen corresponding path program 1 times [2020-10-21 23:06:38,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:38,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998371446] [2020-10-21 23:06:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:38,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998371446] [2020-10-21 23:06:38,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:38,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:06:38,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847633552] [2020-10-21 23:06:38,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:06:38,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:38,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:06:38,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:06:38,873 INFO L87 Difference]: Start difference. First operand 432 states and 1291 transitions. Second operand 4 states. [2020-10-21 23:06:38,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:38,948 INFO L93 Difference]: Finished difference Result 464 states and 1387 transitions. [2020-10-21 23:06:38,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:06:38,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-21 23:06:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:38,959 INFO L225 Difference]: With dead ends: 464 [2020-10-21 23:06:38,959 INFO L226 Difference]: Without dead ends: 464 [2020-10-21 23:06:38,959 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:06:38,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-10-21 23:06:38,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-10-21 23:06:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-10-21 23:06:38,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1387 transitions. [2020-10-21 23:06:38,988 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1387 transitions. Word has length 10 [2020-10-21 23:06:38,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:38,993 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 1387 transitions. [2020-10-21 23:06:38,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:06:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1387 transitions. [2020-10-21 23:06:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:06:39,005 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:39,006 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:39,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:06:39,006 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:39,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash -795853152, now seen corresponding path program 1 times [2020-10-21 23:06:39,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:39,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233445617] [2020-10-21 23:06:39,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:39,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233445617] [2020-10-21 23:06:39,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:39,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:06:39,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096274113] [2020-10-21 23:06:39,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:06:39,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:39,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:06:39,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:06:39,116 INFO L87 Difference]: Start difference. First operand 464 states and 1387 transitions. Second operand 4 states. [2020-10-21 23:06:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:39,145 INFO L93 Difference]: Finished difference Result 640 states and 1891 transitions. [2020-10-21 23:06:39,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:06:39,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-21 23:06:39,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:39,150 INFO L225 Difference]: With dead ends: 640 [2020-10-21 23:06:39,150 INFO L226 Difference]: Without dead ends: 400 [2020-10-21 23:06:39,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:06:39,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2020-10-21 23:06:39,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2020-10-21 23:06:39,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-10-21 23:06:39,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1173 transitions. [2020-10-21 23:06:39,163 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1173 transitions. Word has length 11 [2020-10-21 23:06:39,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:39,163 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 1173 transitions. [2020-10-21 23:06:39,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:06:39,164 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1173 transitions. [2020-10-21 23:06:39,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:06:39,165 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:39,165 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:39,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:06:39,165 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:39,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:39,166 INFO L82 PathProgramCache]: Analyzing trace with hash 308607583, now seen corresponding path program 1 times [2020-10-21 23:06:39,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:39,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405452858] [2020-10-21 23:06:39,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:39,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405452858] [2020-10-21 23:06:39,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:39,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:06:39,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348168315] [2020-10-21 23:06:39,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:06:39,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:39,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:06:39,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:06:39,265 INFO L87 Difference]: Start difference. First operand 400 states and 1173 transitions. Second operand 4 states. [2020-10-21 23:06:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:39,324 INFO L93 Difference]: Finished difference Result 403 states and 1179 transitions. [2020-10-21 23:06:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:06:39,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-21 23:06:39,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:39,328 INFO L225 Difference]: With dead ends: 403 [2020-10-21 23:06:39,328 INFO L226 Difference]: Without dead ends: 403 [2020-10-21 23:06:39,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:06:39,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2020-10-21 23:06:39,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2020-10-21 23:06:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2020-10-21 23:06:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1179 transitions. [2020-10-21 23:06:39,341 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1179 transitions. Word has length 11 [2020-10-21 23:06:39,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:39,341 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 1179 transitions. [2020-10-21 23:06:39,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:06:39,342 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1179 transitions. [2020-10-21 23:06:39,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:06:39,343 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:39,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:39,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:06:39,343 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:39,344 INFO L82 PathProgramCache]: Analyzing trace with hash 313291130, now seen corresponding path program 1 times [2020-10-21 23:06:39,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:39,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141608184] [2020-10-21 23:06:39,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:39,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141608184] [2020-10-21 23:06:39,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:39,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:06:39,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802398655] [2020-10-21 23:06:39,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:06:39,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:39,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:06:39,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:06:39,458 INFO L87 Difference]: Start difference. First operand 403 states and 1179 transitions. Second operand 5 states. [2020-10-21 23:06:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:39,526 INFO L93 Difference]: Finished difference Result 400 states and 1167 transitions. [2020-10-21 23:06:39,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:06:39,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 23:06:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:39,531 INFO L225 Difference]: With dead ends: 400 [2020-10-21 23:06:39,532 INFO L226 Difference]: Without dead ends: 400 [2020-10-21 23:06:39,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:06:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2020-10-21 23:06:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2020-10-21 23:06:39,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-10-21 23:06:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1167 transitions. [2020-10-21 23:06:39,545 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1167 transitions. Word has length 12 [2020-10-21 23:06:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:39,546 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 1167 transitions. [2020-10-21 23:06:39,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:06:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1167 transitions. [2020-10-21 23:06:39,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:06:39,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:39,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:39,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:06:39,548 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:39,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:39,548 INFO L82 PathProgramCache]: Analyzing trace with hash 976819639, now seen corresponding path program 1 times [2020-10-21 23:06:39,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:39,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322892390] [2020-10-21 23:06:39,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:39,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322892390] [2020-10-21 23:06:39,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:39,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:06:39,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428990849] [2020-10-21 23:06:39,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:06:39,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:39,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:06:39,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:06:39,671 INFO L87 Difference]: Start difference. First operand 400 states and 1167 transitions. Second operand 5 states. [2020-10-21 23:06:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:39,787 INFO L93 Difference]: Finished difference Result 396 states and 1152 transitions. [2020-10-21 23:06:39,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:06:39,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 23:06:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:39,791 INFO L225 Difference]: With dead ends: 396 [2020-10-21 23:06:39,791 INFO L226 Difference]: Without dead ends: 396 [2020-10-21 23:06:39,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2020-10-21 23:06:39,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 385. [2020-10-21 23:06:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-10-21 23:06:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1120 transitions. [2020-10-21 23:06:39,805 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1120 transitions. Word has length 12 [2020-10-21 23:06:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:39,805 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 1120 transitions. [2020-10-21 23:06:39,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:06:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1120 transitions. [2020-10-21 23:06:39,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:06:39,807 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:39,807 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:39,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:06:39,807 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:39,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:39,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1088485586, now seen corresponding path program 1 times [2020-10-21 23:06:39,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:39,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627790821] [2020-10-21 23:06:39,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:39,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627790821] [2020-10-21 23:06:39,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:39,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:06:39,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354792572] [2020-10-21 23:06:39,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:06:39,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:39,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:06:39,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:39,978 INFO L87 Difference]: Start difference. First operand 385 states and 1120 transitions. Second operand 6 states. [2020-10-21 23:06:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:40,093 INFO L93 Difference]: Finished difference Result 381 states and 1106 transitions. [2020-10-21 23:06:40,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:06:40,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-21 23:06:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:40,097 INFO L225 Difference]: With dead ends: 381 [2020-10-21 23:06:40,097 INFO L226 Difference]: Without dead ends: 381 [2020-10-21 23:06:40,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:06:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2020-10-21 23:06:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2020-10-21 23:06:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2020-10-21 23:06:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1106 transitions. [2020-10-21 23:06:40,110 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1106 transitions. Word has length 13 [2020-10-21 23:06:40,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:40,110 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 1106 transitions. [2020-10-21 23:06:40,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:06:40,110 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1106 transitions. [2020-10-21 23:06:40,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:06:40,111 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:40,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:40,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:06:40,112 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:40,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:40,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1122009596, now seen corresponding path program 1 times [2020-10-21 23:06:40,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:40,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432426001] [2020-10-21 23:06:40,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:40,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432426001] [2020-10-21 23:06:40,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:40,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:06:40,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317058408] [2020-10-21 23:06:40,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:06:40,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:40,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:06:40,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:40,259 INFO L87 Difference]: Start difference. First operand 381 states and 1106 transitions. Second operand 6 states. [2020-10-21 23:06:40,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:40,384 INFO L93 Difference]: Finished difference Result 430 states and 1250 transitions. [2020-10-21 23:06:40,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:06:40,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-21 23:06:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:40,389 INFO L225 Difference]: With dead ends: 430 [2020-10-21 23:06:40,389 INFO L226 Difference]: Without dead ends: 430 [2020-10-21 23:06:40,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2020-10-21 23:06:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 422. [2020-10-21 23:06:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2020-10-21 23:06:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1232 transitions. [2020-10-21 23:06:40,405 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1232 transitions. Word has length 13 [2020-10-21 23:06:40,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:40,405 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 1232 transitions. [2020-10-21 23:06:40,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:06:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1232 transitions. [2020-10-21 23:06:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:06:40,407 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:40,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:40,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:06:40,407 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:40,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:40,408 INFO L82 PathProgramCache]: Analyzing trace with hash -337816853, now seen corresponding path program 1 times [2020-10-21 23:06:40,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:40,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217942112] [2020-10-21 23:06:40,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:40,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217942112] [2020-10-21 23:06:40,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:40,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:06:40,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534329561] [2020-10-21 23:06:40,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:06:40,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:40,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:06:40,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:06:40,466 INFO L87 Difference]: Start difference. First operand 422 states and 1232 transitions. Second operand 4 states. [2020-10-21 23:06:40,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:40,500 INFO L93 Difference]: Finished difference Result 879 states and 2473 transitions. [2020-10-21 23:06:40,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:06:40,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 23:06:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:40,504 INFO L225 Difference]: With dead ends: 879 [2020-10-21 23:06:40,504 INFO L226 Difference]: Without dead ends: 393 [2020-10-21 23:06:40,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:06:40,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-10-21 23:06:40,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 367. [2020-10-21 23:06:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2020-10-21 23:06:40,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 988 transitions. [2020-10-21 23:06:40,518 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 988 transitions. Word has length 13 [2020-10-21 23:06:40,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:40,519 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 988 transitions. [2020-10-21 23:06:40,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:06:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 988 transitions. [2020-10-21 23:06:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:06:40,554 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:40,555 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:40,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:06:40,555 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:40,555 INFO L82 PathProgramCache]: Analyzing trace with hash 216590530, now seen corresponding path program 2 times [2020-10-21 23:06:40,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:40,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368073519] [2020-10-21 23:06:40,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:40,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368073519] [2020-10-21 23:06:40,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:40,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:06:40,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748043494] [2020-10-21 23:06:40,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:06:40,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:40,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:06:40,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:40,686 INFO L87 Difference]: Start difference. First operand 367 states and 988 transitions. Second operand 6 states. [2020-10-21 23:06:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:40,810 INFO L93 Difference]: Finished difference Result 381 states and 1025 transitions. [2020-10-21 23:06:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:06:40,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-21 23:06:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:40,814 INFO L225 Difference]: With dead ends: 381 [2020-10-21 23:06:40,814 INFO L226 Difference]: Without dead ends: 381 [2020-10-21 23:06:40,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2020-10-21 23:06:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 372. [2020-10-21 23:06:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-10-21 23:06:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1004 transitions. [2020-10-21 23:06:40,827 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1004 transitions. Word has length 13 [2020-10-21 23:06:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:40,827 INFO L481 AbstractCegarLoop]: Abstraction has 372 states and 1004 transitions. [2020-10-21 23:06:40,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:06:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1004 transitions. [2020-10-21 23:06:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:06:40,829 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:40,829 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:40,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:06:40,829 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:40,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:40,830 INFO L82 PathProgramCache]: Analyzing trace with hash 216637030, now seen corresponding path program 3 times [2020-10-21 23:06:40,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:40,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153228799] [2020-10-21 23:06:40,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:40,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:40,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153228799] [2020-10-21 23:06:40,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:40,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:06:40,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368308711] [2020-10-21 23:06:40,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:06:40,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:40,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:06:40,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:40,951 INFO L87 Difference]: Start difference. First operand 372 states and 1004 transitions. Second operand 6 states. [2020-10-21 23:06:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:41,124 INFO L93 Difference]: Finished difference Result 418 states and 1093 transitions. [2020-10-21 23:06:41,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:06:41,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-21 23:06:41,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:41,128 INFO L225 Difference]: With dead ends: 418 [2020-10-21 23:06:41,128 INFO L226 Difference]: Without dead ends: 394 [2020-10-21 23:06:41,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:06:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-10-21 23:06:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 356. [2020-10-21 23:06:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2020-10-21 23:06:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 942 transitions. [2020-10-21 23:06:41,140 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 942 transitions. Word has length 13 [2020-10-21 23:06:41,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:41,141 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 942 transitions. [2020-10-21 23:06:41,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:06:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 942 transitions. [2020-10-21 23:06:41,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:06:41,142 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:41,142 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:41,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:06:41,142 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:41,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:41,143 INFO L82 PathProgramCache]: Analyzing trace with hash 422472500, now seen corresponding path program 1 times [2020-10-21 23:06:41,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:41,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259367156] [2020-10-21 23:06:41,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:41,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259367156] [2020-10-21 23:06:41,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:41,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:06:41,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839010345] [2020-10-21 23:06:41,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:06:41,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:41,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:06:41,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:06:41,341 INFO L87 Difference]: Start difference. First operand 356 states and 942 transitions. Second operand 7 states. [2020-10-21 23:06:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:41,573 INFO L93 Difference]: Finished difference Result 370 states and 973 transitions. [2020-10-21 23:06:41,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:06:41,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-21 23:06:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:41,578 INFO L225 Difference]: With dead ends: 370 [2020-10-21 23:06:41,578 INFO L226 Difference]: Without dead ends: 370 [2020-10-21 23:06:41,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:06:41,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-10-21 23:06:41,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 340. [2020-10-21 23:06:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-10-21 23:06:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 896 transitions. [2020-10-21 23:06:41,592 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 896 transitions. Word has length 14 [2020-10-21 23:06:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:41,592 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 896 transitions. [2020-10-21 23:06:41,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:06:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 896 transitions. [2020-10-21 23:06:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:06:41,594 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:41,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:41,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:06:41,594 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:41,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:41,594 INFO L82 PathProgramCache]: Analyzing trace with hash 422479227, now seen corresponding path program 1 times [2020-10-21 23:06:41,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:41,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511616342] [2020-10-21 23:06:41,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:41,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511616342] [2020-10-21 23:06:41,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:41,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:06:41,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901878213] [2020-10-21 23:06:41,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:06:41,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:41,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:06:41,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:06:41,787 INFO L87 Difference]: Start difference. First operand 340 states and 896 transitions. Second operand 7 states. [2020-10-21 23:06:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:42,000 INFO L93 Difference]: Finished difference Result 444 states and 1128 transitions. [2020-10-21 23:06:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:06:42,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-21 23:06:42,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:42,004 INFO L225 Difference]: With dead ends: 444 [2020-10-21 23:06:42,004 INFO L226 Difference]: Without dead ends: 352 [2020-10-21 23:06:42,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:06:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2020-10-21 23:06:42,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 328. [2020-10-21 23:06:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2020-10-21 23:06:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 844 transitions. [2020-10-21 23:06:42,023 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 844 transitions. Word has length 14 [2020-10-21 23:06:42,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:42,024 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 844 transitions. [2020-10-21 23:06:42,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:06:42,024 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 844 transitions. [2020-10-21 23:06:42,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:06:42,025 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:42,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:42,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:06:42,025 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:42,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:42,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1854000029, now seen corresponding path program 1 times [2020-10-21 23:06:42,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:42,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859202599] [2020-10-21 23:06:42,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:42,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859202599] [2020-10-21 23:06:42,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:42,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:06:42,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290264418] [2020-10-21 23:06:42,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:06:42,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:42,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:06:42,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:06:42,097 INFO L87 Difference]: Start difference. First operand 328 states and 844 transitions. Second operand 4 states. [2020-10-21 23:06:42,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:42,132 INFO L93 Difference]: Finished difference Result 332 states and 756 transitions. [2020-10-21 23:06:42,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:06:42,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 23:06:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:42,135 INFO L225 Difference]: With dead ends: 332 [2020-10-21 23:06:42,135 INFO L226 Difference]: Without dead ends: 248 [2020-10-21 23:06:42,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:06:42,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-10-21 23:06:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2020-10-21 23:06:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-21 23:06:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 558 transitions. [2020-10-21 23:06:42,144 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 558 transitions. Word has length 14 [2020-10-21 23:06:42,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:42,144 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 558 transitions. [2020-10-21 23:06:42,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:06:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 558 transitions. [2020-10-21 23:06:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:06:42,145 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:42,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:42,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:06:42,146 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:42,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:42,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1637663200, now seen corresponding path program 1 times [2020-10-21 23:06:42,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:42,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896827965] [2020-10-21 23:06:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:42,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896827965] [2020-10-21 23:06:42,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:42,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:06:42,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926656393] [2020-10-21 23:06:42,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:06:42,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:42,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:06:42,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:06:42,225 INFO L87 Difference]: Start difference. First operand 248 states and 558 transitions. Second operand 5 states. [2020-10-21 23:06:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:42,269 INFO L93 Difference]: Finished difference Result 211 states and 427 transitions. [2020-10-21 23:06:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:06:42,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 23:06:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:42,271 INFO L225 Difference]: With dead ends: 211 [2020-10-21 23:06:42,272 INFO L226 Difference]: Without dead ends: 163 [2020-10-21 23:06:42,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-10-21 23:06:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2020-10-21 23:06:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-21 23:06:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 321 transitions. [2020-10-21 23:06:42,278 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 321 transitions. Word has length 15 [2020-10-21 23:06:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:42,278 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 321 transitions. [2020-10-21 23:06:42,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:06:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 321 transitions. [2020-10-21 23:06:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:06:42,279 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:42,279 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:42,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:06:42,280 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:42,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:42,280 INFO L82 PathProgramCache]: Analyzing trace with hash 70390188, now seen corresponding path program 1 times [2020-10-21 23:06:42,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:42,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818128144] [2020-10-21 23:06:42,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:42,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818128144] [2020-10-21 23:06:42,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:42,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:06:42,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142340106] [2020-10-21 23:06:42,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:06:42,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:42,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:06:42,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:06:42,576 INFO L87 Difference]: Start difference. First operand 163 states and 321 transitions. Second operand 7 states. [2020-10-21 23:06:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:42,740 INFO L93 Difference]: Finished difference Result 180 states and 345 transitions. [2020-10-21 23:06:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:06:42,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-21 23:06:42,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:42,746 INFO L225 Difference]: With dead ends: 180 [2020-10-21 23:06:42,746 INFO L226 Difference]: Without dead ends: 126 [2020-10-21 23:06:42,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:06:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-10-21 23:06:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 115. [2020-10-21 23:06:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-10-21 23:06:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 228 transitions. [2020-10-21 23:06:42,751 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 228 transitions. Word has length 17 [2020-10-21 23:06:42,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:42,751 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 228 transitions. [2020-10-21 23:06:42,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:06:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 228 transitions. [2020-10-21 23:06:42,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:06:42,752 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:42,752 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:42,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 23:06:42,753 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:42,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash 630847422, now seen corresponding path program 1 times [2020-10-21 23:06:42,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:42,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627800148] [2020-10-21 23:06:42,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:42,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627800148] [2020-10-21 23:06:42,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:42,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:06:42,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168618352] [2020-10-21 23:06:42,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:06:42,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:42,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:06:42,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:42,844 INFO L87 Difference]: Start difference. First operand 115 states and 228 transitions. Second operand 6 states. [2020-10-21 23:06:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:42,893 INFO L93 Difference]: Finished difference Result 102 states and 201 transitions. [2020-10-21 23:06:42,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:06:42,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-21 23:06:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:42,895 INFO L225 Difference]: With dead ends: 102 [2020-10-21 23:06:42,895 INFO L226 Difference]: Without dead ends: 59 [2020-10-21 23:06:42,895 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:06:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-21 23:06:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-21 23:06:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-21 23:06:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 104 transitions. [2020-10-21 23:06:42,898 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 104 transitions. Word has length 17 [2020-10-21 23:06:42,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:42,898 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 104 transitions. [2020-10-21 23:06:42,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:06:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 104 transitions. [2020-10-21 23:06:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 23:06:42,899 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:42,900 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:42,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 23:06:42,900 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:42,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:42,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1828977790, now seen corresponding path program 1 times [2020-10-21 23:06:42,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:42,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894682952] [2020-10-21 23:06:42,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:06:42,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:06:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:06:43,000 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:06:43,036 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:06:43,037 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:06:43,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-21 23:06:43,038 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:06:43,051 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1053] [1053] L2-->L829: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In2135441516 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In2135441516 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In2135441516 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In2135441516 256) 0))) (let ((.cse5 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse0 (not .cse6)) (.cse1 (not .cse7)) (.cse2 (or .cse6 .cse7))) (and (= ~y$r_buff0_thd0~0_Out2135441516 ~y$r_buff0_thd0~0_In2135441516) (or (and .cse0 .cse1 (= ~y$w_buff0~0_In2135441516 ~y~0_Out2135441516)) (and .cse2 (or (and .cse3 .cse4 (= ~y~0_Out2135441516 ~y$w_buff1~0_In2135441516)) (and .cse5 (= ~y~0_In2135441516 ~y~0_Out2135441516))))) (= ~y$r_buff1_thd0~0_Out2135441516 ~y$r_buff1_thd0~0_In2135441516) (or (and .cse5 (= ~y$w_buff1_used~0_Out2135441516 ~y$w_buff1_used~0_In2135441516)) (and .cse3 .cse4 (= ~y$w_buff1_used~0_Out2135441516 0))) (or (and (= ~y$w_buff0_used~0_Out2135441516 0) .cse0 .cse1) (and .cse2 (= ~y$w_buff0_used~0_In2135441516 ~y$w_buff0_used~0_Out2135441516))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out2135441516 |ULTIMATE.start_assume_abort_if_not_#in~cond_In2135441516|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out2135441516 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2135441516|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2135441516, ~y$w_buff1~0=~y$w_buff1~0_In2135441516, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2135441516, ~y$w_buff0~0=~y$w_buff0~0_In2135441516, ~y~0=~y~0_In2135441516, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2135441516, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2135441516} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out2135441516, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out2135441516|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out2135441516|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out2135441516|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out2135441516|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out2135441516|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2135441516|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out2135441516|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out2135441516, ~y$w_buff1~0=~y$w_buff1~0_In2135441516, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out2135441516, ~y$w_buff0~0=~y$w_buff0~0_In2135441516, ~y~0=~y~0_Out2135441516, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out2135441516, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out2135441516} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-21 23:06:43,056 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,056 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [738] [2020-10-21 23:06:43,059 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,059 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,059 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,060 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,060 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,061 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,062 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,062 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,062 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,062 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,062 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,062 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,063 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,063 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,063 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,063 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,064 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,064 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,064 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,064 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,064 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,064 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,065 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,065 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,066 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,066 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,066 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,066 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,067 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,067 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,067 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,068 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,068 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,068 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,068 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,068 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,068 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,069 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,069 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,069 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,070 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,070 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,070 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:43,070 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:43,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:06:43 BasicIcfg [2020-10-21 23:06:43,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:06:43,136 INFO L168 Benchmark]: Toolchain (without parser) took 16651.26 ms. Allocated memory was 140.0 MB in the beginning and 408.4 MB in the end (delta: 268.4 MB). Free memory was 101.6 MB in the beginning and 246.3 MB in the end (delta: -144.7 MB). Peak memory consumption was 123.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:06:43,139 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-10-21 23:06:43,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.02 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 100.8 MB in the beginning and 153.8 MB in the end (delta: -53.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:06:43,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.86 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 150.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:06:43,141 INFO L168 Benchmark]: Boogie Preprocessor took 43.72 ms. Allocated memory is still 203.4 MB. Free memory was 150.9 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:06:43,141 INFO L168 Benchmark]: RCFGBuilder took 2230.46 ms. Allocated memory was 203.4 MB in the beginning and 248.0 MB in the end (delta: 44.6 MB). Free memory was 148.2 MB in the beginning and 162.8 MB in the end (delta: -14.6 MB). Peak memory consumption was 100.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:06:43,142 INFO L168 Benchmark]: TraceAbstraction took 13471.79 ms. Allocated memory was 248.0 MB in the beginning and 408.4 MB in the end (delta: 160.4 MB). Free memory was 162.8 MB in the beginning and 246.3 MB in the end (delta: -83.5 MB). Peak memory consumption was 77.0 MB. Max. memory is 7.1 GB. [2020-10-21 23:06:43,147 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.22 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 816.02 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 100.8 MB in the beginning and 153.8 MB in the end (delta: -53.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.86 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 150.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.72 ms. Allocated memory is still 203.4 MB. Free memory was 150.9 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2230.46 ms. Allocated memory was 203.4 MB in the beginning and 248.0 MB in the end (delta: 44.6 MB). Free memory was 148.2 MB in the beginning and 162.8 MB in the end (delta: -14.6 MB). Peak memory consumption was 100.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13471.79 ms. Allocated memory was 248.0 MB in the beginning and 408.4 MB in the end (delta: 160.4 MB). Free memory was 162.8 MB in the beginning and 246.3 MB in the end (delta: -83.5 MB). Peak memory consumption was 77.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 911 VarBasedMoverChecksPositive, 37 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 56 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.1s, 106 PlacesBefore, 35 PlacesAfterwards, 99 TransitionsBefore, 25 TransitionsAfterwards, 1770 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 91 TotalNumberOfCompositions, 4422 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; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2180; [L814] FCALL, FORK 0 pthread_create(&t2180, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2181; [L816] FCALL, FORK 0 pthread_create(&t2181, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2182; [L818] FCALL, FORK 0 pthread_create(&t2182, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] 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) [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 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 [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] 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) [L791] 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) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 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 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 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 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 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) [L835] 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) [L836] 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)) [L836] 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) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L836] 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) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 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)) [L840] 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) [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] 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) [L840] 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)) [L840] 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)) [L841] 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)) [L841] EXPR 0 !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) [L841] 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)) [L841] 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)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe017_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.2s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.1s, HoareTripleCheckerStatistics: 359 SDtfs, 451 SDslu, 669 SDs, 0 SdLazy, 476 SolverSat, 164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred 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, 18 MinimizatonAttempts, 157 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 26695 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...