/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:05:06,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:05:06,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:05:07,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:05:07,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:05:07,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:05:07,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:05:07,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:05:07,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:05:07,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:05:07,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:05:07,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:05:07,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:05:07,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:05:07,045 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:05:07,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:05:07,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:05:07,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:05:07,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:05:07,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:05:07,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:05:07,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:05:07,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:05:07,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:05:07,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:05:07,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:05:07,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:05:07,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:05:07,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:05:07,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:05:07,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:05:07,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:05:07,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:05:07,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:05:07,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:05:07,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:05:07,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:05:07,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:05:07,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:05:07,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:05:07,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:05:07,085 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:05:07,130 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:05:07,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:05:07,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:05:07,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:05:07,134 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:05:07,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:05:07,134 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:05:07,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:05:07,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:05:07,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:05:07,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:05:07,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:05:07,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:05:07,137 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:05:07,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:05:07,137 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:05:07,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:05:07,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:05:07,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:05:07,138 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:05:07,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:05:07,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:05:07,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:05:07,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:05:07,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:05:07,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:05:07,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:05:07,140 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:05:07,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:05:07,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:05:07,445 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:05:07,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:05:07,450 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:05:07,451 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:05:07,452 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i [2020-10-16 12:05:07,540 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8889ee937/89bdac3b175d4d8c87d2c89552809907/FLAGc0dda8ff3 [2020-10-16 12:05:08,134 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:05:08,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i [2020-10-16 12:05:08,160 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8889ee937/89bdac3b175d4d8c87d2c89552809907/FLAGc0dda8ff3 [2020-10-16 12:05:08,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8889ee937/89bdac3b175d4d8c87d2c89552809907 [2020-10-16 12:05:08,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:05:08,405 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:05:08,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:05:08,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:05:08,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:05:08,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:05:08" (1/1) ... [2020-10-16 12:05:08,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702b61ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:08, skipping insertion in model container [2020-10-16 12:05:08,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:05:08" (1/1) ... [2020-10-16 12:05:08,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:05:08,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:05:09,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:05:09,039 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:05:09,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:05:09,214 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:05:09,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:09 WrapperNode [2020-10-16 12:05:09,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:05:09,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:05:09,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:05:09,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:05:09,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:09" (1/1) ... [2020-10-16 12:05:09,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:09" (1/1) ... [2020-10-16 12:05:09,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:05:09,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:05:09,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:05:09,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:05:09,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:09" (1/1) ... [2020-10-16 12:05:09,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:09" (1/1) ... [2020-10-16 12:05:09,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:09" (1/1) ... [2020-10-16 12:05:09,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:09" (1/1) ... [2020-10-16 12:05:09,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:09" (1/1) ... [2020-10-16 12:05:09,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:09" (1/1) ... [2020-10-16 12:05:09,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:09" (1/1) ... [2020-10-16 12:05:09,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:05:09,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:05:09,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:05:09,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:05:09,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:09" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:05:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:05:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:05:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:05:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:05:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:05:09,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:05:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:05:09,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:05:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:05:09,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:05:09,399 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 12:05:09,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 12:05:09,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:05:09,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:05:09,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:05:09,402 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:05:11,448 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:05:11,449 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:05:11,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:05:11 BoogieIcfgContainer [2020-10-16 12:05:11,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:05:11,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:05:11,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:05:11,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:05:11,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:05:08" (1/3) ... [2020-10-16 12:05:11,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a37b79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:05:11, skipping insertion in model container [2020-10-16 12:05:11,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:09" (2/3) ... [2020-10-16 12:05:11,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a37b79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:05:11, skipping insertion in model container [2020-10-16 12:05:11,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:05:11" (3/3) ... [2020-10-16 12:05:11,460 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.opt.i [2020-10-16 12:05:11,472 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:05:11,473 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:05:11,481 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:05:11,482 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:05:11,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,513 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,513 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,515 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,515 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,516 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,516 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,520 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,520 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,520 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,521 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,523 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,523 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,528 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,529 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,534 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,535 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,536 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,536 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,536 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,538 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,538 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,540 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,540 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:11,542 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:05:11,557 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 12:05:11,579 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:05:11,580 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:05:11,580 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:05:11,580 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:05:11,580 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:05:11,580 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:05:11,580 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:05:11,580 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:05:11,595 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:05:11,596 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-16 12:05:11,599 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-16 12:05:11,601 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-16 12:05:11,654 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-16 12:05:11,654 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:05:11,660 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 12:05:11,664 INFO L117 LiptonReduction]: Number of co-enabled transitions 2352 [2020-10-16 12:05:13,128 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-16 12:05:13,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 12:05:13,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:05:13,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 12:05:13,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:05:14,432 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-16 12:05:15,093 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:05:15,210 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 12:05:16,069 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-16 12:05:16,394 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-16 12:05:16,557 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 12:05:17,745 WARN L193 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 128 [2020-10-16 12:05:18,090 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 12:05:18,726 WARN L193 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 108 [2020-10-16 12:05:19,014 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-16 12:05:19,814 WARN L193 SmtUtils]: Spent 531.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-16 12:05:20,140 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-16 12:05:20,417 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-16 12:05:20,539 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 12:05:20,562 INFO L132 LiptonReduction]: Checked pairs total: 5641 [2020-10-16 12:05:20,562 INFO L134 LiptonReduction]: Total number of compositions: 86 [2020-10-16 12:05:20,569 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-16 12:05:20,753 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-10-16 12:05:20,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-10-16 12:05:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:05:20,765 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:20,766 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:20,766 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:20,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1680903237, now seen corresponding path program 1 times [2020-10-16 12:05:20,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:20,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665546298] [2020-10-16 12:05:20,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:21,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665546298] [2020-10-16 12:05:21,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:21,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:05:21,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949013833] [2020-10-16 12:05:21,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:21,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:21,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:21,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:21,208 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-10-16 12:05:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:21,336 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-10-16 12:05:21,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:21,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:05:21,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:21,389 INFO L225 Difference]: With dead ends: 2202 [2020-10-16 12:05:21,390 INFO L226 Difference]: Without dead ends: 1802 [2020-10-16 12:05:21,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-16 12:05:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-10-16 12:05:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-10-16 12:05:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-10-16 12:05:21,582 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-10-16 12:05:21,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:21,584 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-10-16 12:05:21,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:21,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-10-16 12:05:21,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:05:21,589 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:21,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:21,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:05:21,590 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:21,590 INFO L82 PathProgramCache]: Analyzing trace with hash 440307530, now seen corresponding path program 1 times [2020-10-16 12:05:21,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:21,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555584708] [2020-10-16 12:05:21,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:21,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555584708] [2020-10-16 12:05:21,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:21,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:05:21,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461772522] [2020-10-16 12:05:21,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:21,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:21,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:21,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:21,735 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-10-16 12:05:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:21,765 INFO L93 Difference]: Finished difference Result 1762 states and 6602 transitions. [2020-10-16 12:05:21,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:21,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:05:21,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:21,782 INFO L225 Difference]: With dead ends: 1762 [2020-10-16 12:05:21,782 INFO L226 Difference]: Without dead ends: 1762 [2020-10-16 12:05:21,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:21,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2020-10-16 12:05:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2020-10-16 12:05:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2020-10-16 12:05:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 6602 transitions. [2020-10-16 12:05:21,858 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 6602 transitions. Word has length 11 [2020-10-16 12:05:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:21,859 INFO L481 AbstractCegarLoop]: Abstraction has 1762 states and 6602 transitions. [2020-10-16 12:05:21,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 6602 transitions. [2020-10-16 12:05:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:05:21,862 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:21,862 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:21,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:05:21,862 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:21,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:21,863 INFO L82 PathProgramCache]: Analyzing trace with hash 249955351, now seen corresponding path program 1 times [2020-10-16 12:05:21,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:21,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420272377] [2020-10-16 12:05:21,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:22,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420272377] [2020-10-16 12:05:22,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:22,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:05:22,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092981888] [2020-10-16 12:05:22,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:05:22,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:22,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:05:22,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:05:22,005 INFO L87 Difference]: Start difference. First operand 1762 states and 6602 transitions. Second operand 4 states. [2020-10-16 12:05:22,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:22,081 INFO L93 Difference]: Finished difference Result 1738 states and 6496 transitions. [2020-10-16 12:05:22,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:22,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 12:05:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:22,101 INFO L225 Difference]: With dead ends: 1738 [2020-10-16 12:05:22,101 INFO L226 Difference]: Without dead ends: 1738 [2020-10-16 12:05:22,101 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-16 12:05:22,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2020-10-16 12:05:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1738. [2020-10-16 12:05:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2020-10-16 12:05:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 6496 transitions. [2020-10-16 12:05:22,176 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 6496 transitions. Word has length 12 [2020-10-16 12:05:22,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:22,176 INFO L481 AbstractCegarLoop]: Abstraction has 1738 states and 6496 transitions. [2020-10-16 12:05:22,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:05:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 6496 transitions. [2020-10-16 12:05:22,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:05:22,181 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:22,184 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:22,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:05:22,184 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:22,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:22,191 INFO L82 PathProgramCache]: Analyzing trace with hash -842070361, now seen corresponding path program 1 times [2020-10-16 12:05:22,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:22,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417277186] [2020-10-16 12:05:22,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:22,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417277186] [2020-10-16 12:05:22,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:22,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:05:22,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634406052] [2020-10-16 12:05:22,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:22,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:22,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:22,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:22,370 INFO L87 Difference]: Start difference. First operand 1738 states and 6496 transitions. Second operand 3 states. [2020-10-16 12:05:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:22,433 INFO L93 Difference]: Finished difference Result 1732 states and 6468 transitions. [2020-10-16 12:05:22,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:22,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 12:05:22,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:22,450 INFO L225 Difference]: With dead ends: 1732 [2020-10-16 12:05:22,450 INFO L226 Difference]: Without dead ends: 1732 [2020-10-16 12:05:22,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2020-10-16 12:05:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1732. [2020-10-16 12:05:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2020-10-16 12:05:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 6468 transitions. [2020-10-16 12:05:22,524 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 6468 transitions. Word has length 13 [2020-10-16 12:05:22,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:22,524 INFO L481 AbstractCegarLoop]: Abstraction has 1732 states and 6468 transitions. [2020-10-16 12:05:22,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 6468 transitions. [2020-10-16 12:05:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:05:22,526 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:22,526 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:22,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:05:22,527 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:22,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:22,527 INFO L82 PathProgramCache]: Analyzing trace with hash -840461647, now seen corresponding path program 1 times [2020-10-16 12:05:22,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:22,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191453607] [2020-10-16 12:05:22,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:22,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191453607] [2020-10-16 12:05:22,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:22,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:05:22,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203478397] [2020-10-16 12:05:22,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:22,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:22,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:22,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:22,600 INFO L87 Difference]: Start difference. First operand 1732 states and 6468 transitions. Second operand 3 states. [2020-10-16 12:05:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:22,627 INFO L93 Difference]: Finished difference Result 1700 states and 6324 transitions. [2020-10-16 12:05:22,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:22,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 12:05:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:22,644 INFO L225 Difference]: With dead ends: 1700 [2020-10-16 12:05:22,644 INFO L226 Difference]: Without dead ends: 1700 [2020-10-16 12:05:22,644 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2020-10-16 12:05:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1700. [2020-10-16 12:05:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2020-10-16 12:05:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 6324 transitions. [2020-10-16 12:05:22,733 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 6324 transitions. Word has length 13 [2020-10-16 12:05:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:22,734 INFO L481 AbstractCegarLoop]: Abstraction has 1700 states and 6324 transitions. [2020-10-16 12:05:22,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 6324 transitions. [2020-10-16 12:05:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:05:22,736 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:22,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:22,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:05:22,737 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:22,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:22,737 INFO L82 PathProgramCache]: Analyzing trace with hash -333997007, now seen corresponding path program 1 times [2020-10-16 12:05:22,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:22,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451470018] [2020-10-16 12:05:22,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:22,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451470018] [2020-10-16 12:05:22,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:22,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:22,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929166341] [2020-10-16 12:05:22,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:05:22,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:22,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:05:22,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:22,913 INFO L87 Difference]: Start difference. First operand 1700 states and 6324 transitions. Second operand 5 states. [2020-10-16 12:05:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:23,031 INFO L93 Difference]: Finished difference Result 1702 states and 6318 transitions. [2020-10-16 12:05:23,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:23,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:05:23,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:23,048 INFO L225 Difference]: With dead ends: 1702 [2020-10-16 12:05:23,048 INFO L226 Difference]: Without dead ends: 1702 [2020-10-16 12:05:23,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2020-10-16 12:05:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1686. [2020-10-16 12:05:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2020-10-16 12:05:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 6262 transitions. [2020-10-16 12:05:23,109 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 6262 transitions. Word has length 14 [2020-10-16 12:05:23,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:23,110 INFO L481 AbstractCegarLoop]: Abstraction has 1686 states and 6262 transitions. [2020-10-16 12:05:23,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 6262 transitions. [2020-10-16 12:05:23,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:05:23,113 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:23,113 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:23,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:05:23,113 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:23,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:23,114 INFO L82 PathProgramCache]: Analyzing trace with hash -298426553, now seen corresponding path program 1 times [2020-10-16 12:05:23,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:23,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606433510] [2020-10-16 12:05:23,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:23,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:23,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606433510] [2020-10-16 12:05:23,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:23,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:23,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322821494] [2020-10-16 12:05:23,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:05:23,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:23,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:05:23,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:23,206 INFO L87 Difference]: Start difference. First operand 1686 states and 6262 transitions. Second operand 5 states. [2020-10-16 12:05:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:23,287 INFO L93 Difference]: Finished difference Result 1642 states and 6070 transitions. [2020-10-16 12:05:23,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:23,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:05:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:23,301 INFO L225 Difference]: With dead ends: 1642 [2020-10-16 12:05:23,302 INFO L226 Difference]: Without dead ends: 1642 [2020-10-16 12:05:23,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2020-10-16 12:05:23,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1642. [2020-10-16 12:05:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1642 states. [2020-10-16 12:05:23,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 6070 transitions. [2020-10-16 12:05:23,349 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 6070 transitions. Word has length 14 [2020-10-16 12:05:23,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:23,350 INFO L481 AbstractCegarLoop]: Abstraction has 1642 states and 6070 transitions. [2020-10-16 12:05:23,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 6070 transitions. [2020-10-16 12:05:23,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:05:23,352 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:23,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:23,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:05:23,353 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:23,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:23,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1797762494, now seen corresponding path program 1 times [2020-10-16 12:05:23,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:23,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275866235] [2020-10-16 12:05:23,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:23,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275866235] [2020-10-16 12:05:23,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:23,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:05:23,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318450652] [2020-10-16 12:05:23,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:23,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:23,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:23,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:23,542 INFO L87 Difference]: Start difference. First operand 1642 states and 6070 transitions. Second operand 6 states. [2020-10-16 12:05:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:23,724 INFO L93 Difference]: Finished difference Result 1662 states and 6112 transitions. [2020-10-16 12:05:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:23,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 12:05:23,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:23,739 INFO L225 Difference]: With dead ends: 1662 [2020-10-16 12:05:23,739 INFO L226 Difference]: Without dead ends: 1662 [2020-10-16 12:05:23,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:05:23,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2020-10-16 12:05:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1614. [2020-10-16 12:05:23,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2020-10-16 12:05:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 5960 transitions. [2020-10-16 12:05:23,790 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 5960 transitions. Word has length 15 [2020-10-16 12:05:23,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:23,790 INFO L481 AbstractCegarLoop]: Abstraction has 1614 states and 5960 transitions. [2020-10-16 12:05:23,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 5960 transitions. [2020-10-16 12:05:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:05:23,793 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:23,793 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:23,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:05:23,794 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:23,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:23,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1763115561, now seen corresponding path program 1 times [2020-10-16 12:05:23,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:23,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439813854] [2020-10-16 12:05:23,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:23,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439813854] [2020-10-16 12:05:23,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:23,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:05:23,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941037634] [2020-10-16 12:05:23,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:23,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:23,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:23,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:23,883 INFO L87 Difference]: Start difference. First operand 1614 states and 5960 transitions. Second operand 6 states. [2020-10-16 12:05:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:23,951 INFO L93 Difference]: Finished difference Result 1882 states and 7018 transitions. [2020-10-16 12:05:23,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:23,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 12:05:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:23,971 INFO L225 Difference]: With dead ends: 1882 [2020-10-16 12:05:23,971 INFO L226 Difference]: Without dead ends: 1882 [2020-10-16 12:05:23,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:23,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2020-10-16 12:05:24,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1726. [2020-10-16 12:05:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2020-10-16 12:05:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 6416 transitions. [2020-10-16 12:05:24,035 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 6416 transitions. Word has length 15 [2020-10-16 12:05:24,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:24,037 INFO L481 AbstractCegarLoop]: Abstraction has 1726 states and 6416 transitions. [2020-10-16 12:05:24,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 6416 transitions. [2020-10-16 12:05:24,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:05:24,042 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:24,042 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:24,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:05:24,042 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:24,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:24,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1763973021, now seen corresponding path program 2 times [2020-10-16 12:05:24,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:24,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835450976] [2020-10-16 12:05:24,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:24,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835450976] [2020-10-16 12:05:24,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:24,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:05:24,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479378502] [2020-10-16 12:05:24,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:24,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:24,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:24,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:24,222 INFO L87 Difference]: Start difference. First operand 1726 states and 6416 transitions. Second operand 6 states. [2020-10-16 12:05:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:24,313 INFO L93 Difference]: Finished difference Result 1854 states and 6838 transitions. [2020-10-16 12:05:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:24,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 12:05:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:24,322 INFO L225 Difference]: With dead ends: 1854 [2020-10-16 12:05:24,323 INFO L226 Difference]: Without dead ends: 1854 [2020-10-16 12:05:24,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:24,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2020-10-16 12:05:24,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1682. [2020-10-16 12:05:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2020-10-16 12:05:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 6188 transitions. [2020-10-16 12:05:24,392 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 6188 transitions. Word has length 15 [2020-10-16 12:05:24,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:24,394 INFO L481 AbstractCegarLoop]: Abstraction has 1682 states and 6188 transitions. [2020-10-16 12:05:24,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 6188 transitions. [2020-10-16 12:05:24,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:05:24,398 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:24,398 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:24,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:05:24,398 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:24,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:24,399 INFO L82 PathProgramCache]: Analyzing trace with hash 104794598, now seen corresponding path program 1 times [2020-10-16 12:05:24,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:24,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776160010] [2020-10-16 12:05:24,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:24,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776160010] [2020-10-16 12:05:24,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:24,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:24,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507586707] [2020-10-16 12:05:24,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:05:24,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:24,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:05:24,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:24,634 INFO L87 Difference]: Start difference. First operand 1682 states and 6188 transitions. Second operand 7 states. [2020-10-16 12:05:24,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:24,850 INFO L93 Difference]: Finished difference Result 1874 states and 6892 transitions. [2020-10-16 12:05:24,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:24,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-16 12:05:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:24,861 INFO L225 Difference]: With dead ends: 1874 [2020-10-16 12:05:24,861 INFO L226 Difference]: Without dead ends: 1874 [2020-10-16 12:05:24,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:05:24,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2020-10-16 12:05:24,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1874. [2020-10-16 12:05:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2020-10-16 12:05:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 6892 transitions. [2020-10-16 12:05:24,938 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 6892 transitions. Word has length 16 [2020-10-16 12:05:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:24,939 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 6892 transitions. [2020-10-16 12:05:24,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:05:24,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 6892 transitions. [2020-10-16 12:05:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:05:24,943 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:24,943 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:24,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:05:24,943 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1177270598, now seen corresponding path program 2 times [2020-10-16 12:05:24,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:24,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401046803] [2020-10-16 12:05:24,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:25,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401046803] [2020-10-16 12:05:25,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:25,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:25,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597575326] [2020-10-16 12:05:25,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:05:25,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:25,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:05:25,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:25,171 INFO L87 Difference]: Start difference. First operand 1874 states and 6892 transitions. Second operand 7 states. [2020-10-16 12:05:25,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:25,404 INFO L93 Difference]: Finished difference Result 1834 states and 6728 transitions. [2020-10-16 12:05:25,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:25,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-16 12:05:25,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:25,413 INFO L225 Difference]: With dead ends: 1834 [2020-10-16 12:05:25,413 INFO L226 Difference]: Without dead ends: 1834 [2020-10-16 12:05:25,418 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:05:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2020-10-16 12:05:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1626. [2020-10-16 12:05:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2020-10-16 12:05:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 5968 transitions. [2020-10-16 12:05:25,471 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 5968 transitions. Word has length 16 [2020-10-16 12:05:25,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:25,471 INFO L481 AbstractCegarLoop]: Abstraction has 1626 states and 5968 transitions. [2020-10-16 12:05:25,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:05:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 5968 transitions. [2020-10-16 12:05:25,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:05:25,475 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:25,476 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:25,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:05:25,476 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:25,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:25,476 INFO L82 PathProgramCache]: Analyzing trace with hash 974833126, now seen corresponding path program 1 times [2020-10-16 12:05:25,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:25,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738733655] [2020-10-16 12:05:25,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:25,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:25,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738733655] [2020-10-16 12:05:25,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:25,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:25,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491330728] [2020-10-16 12:05:25,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:05:25,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:25,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:05:25,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:05:25,563 INFO L87 Difference]: Start difference. First operand 1626 states and 5968 transitions. Second operand 4 states. [2020-10-16 12:05:25,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:25,610 INFO L93 Difference]: Finished difference Result 1728 states and 5807 transitions. [2020-10-16 12:05:25,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:25,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 12:05:25,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:25,625 INFO L225 Difference]: With dead ends: 1728 [2020-10-16 12:05:25,626 INFO L226 Difference]: Without dead ends: 1296 [2020-10-16 12:05:25,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2020-10-16 12:05:25,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2020-10-16 12:05:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1296 states. [2020-10-16 12:05:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 4318 transitions. [2020-10-16 12:05:25,678 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 4318 transitions. Word has length 16 [2020-10-16 12:05:25,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:25,678 INFO L481 AbstractCegarLoop]: Abstraction has 1296 states and 4318 transitions. [2020-10-16 12:05:25,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:05:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 4318 transitions. [2020-10-16 12:05:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:05:25,682 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:25,682 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:25,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:05:25,683 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash -350364005, now seen corresponding path program 1 times [2020-10-16 12:05:25,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:25,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389881] [2020-10-16 12:05:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:25,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389881] [2020-10-16 12:05:25,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:25,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:05:25,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059974536] [2020-10-16 12:05:25,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:05:25,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:25,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:05:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:25,769 INFO L87 Difference]: Start difference. First operand 1296 states and 4318 transitions. Second operand 5 states. [2020-10-16 12:05:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:25,823 INFO L93 Difference]: Finished difference Result 1156 states and 3549 transitions. [2020-10-16 12:05:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:25,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 12:05:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:25,828 INFO L225 Difference]: With dead ends: 1156 [2020-10-16 12:05:25,828 INFO L226 Difference]: Without dead ends: 877 [2020-10-16 12:05:25,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2020-10-16 12:05:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2020-10-16 12:05:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2020-10-16 12:05:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 2642 transitions. [2020-10-16 12:05:25,856 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 2642 transitions. Word has length 17 [2020-10-16 12:05:25,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:25,857 INFO L481 AbstractCegarLoop]: Abstraction has 877 states and 2642 transitions. [2020-10-16 12:05:25,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 2642 transitions. [2020-10-16 12:05:25,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 12:05:25,860 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:25,860 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:25,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:05:25,860 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:25,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:25,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1278143232, now seen corresponding path program 1 times [2020-10-16 12:05:25,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:25,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312372314] [2020-10-16 12:05:25,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:25,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312372314] [2020-10-16 12:05:25,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:25,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:05:25,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400715960] [2020-10-16 12:05:25,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:25,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:25,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:25,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:25,917 INFO L87 Difference]: Start difference. First operand 877 states and 2642 transitions. Second operand 3 states. [2020-10-16 12:05:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:25,932 INFO L93 Difference]: Finished difference Result 1249 states and 3669 transitions. [2020-10-16 12:05:25,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:25,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-10-16 12:05:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:25,938 INFO L225 Difference]: With dead ends: 1249 [2020-10-16 12:05:25,938 INFO L226 Difference]: Without dead ends: 887 [2020-10-16 12:05:25,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-10-16 12:05:25,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 871. [2020-10-16 12:05:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2020-10-16 12:05:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2481 transitions. [2020-10-16 12:05:25,964 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2481 transitions. Word has length 18 [2020-10-16 12:05:25,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:25,965 INFO L481 AbstractCegarLoop]: Abstraction has 871 states and 2481 transitions. [2020-10-16 12:05:25,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2481 transitions. [2020-10-16 12:05:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:05:25,968 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:25,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:25,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:05:25,968 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:25,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:25,969 INFO L82 PathProgramCache]: Analyzing trace with hash 125424893, now seen corresponding path program 1 times [2020-10-16 12:05:25,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:25,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956510415] [2020-10-16 12:05:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:26,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:26,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956510415] [2020-10-16 12:05:26,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:26,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:26,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181928314] [2020-10-16 12:05:26,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:05:26,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:26,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:05:26,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:05:26,029 INFO L87 Difference]: Start difference. First operand 871 states and 2481 transitions. Second operand 4 states. [2020-10-16 12:05:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:26,050 INFO L93 Difference]: Finished difference Result 1201 states and 3360 transitions. [2020-10-16 12:05:26,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:26,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-16 12:05:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:26,053 INFO L225 Difference]: With dead ends: 1201 [2020-10-16 12:05:26,054 INFO L226 Difference]: Without dead ends: 561 [2020-10-16 12:05:26,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:26,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-10-16 12:05:26,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2020-10-16 12:05:26,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2020-10-16 12:05:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1483 transitions. [2020-10-16 12:05:26,069 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1483 transitions. Word has length 19 [2020-10-16 12:05:26,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:26,070 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 1483 transitions. [2020-10-16 12:05:26,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:05:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1483 transitions. [2020-10-16 12:05:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:05:26,073 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:26,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:26,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:05:26,073 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:26,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:26,074 INFO L82 PathProgramCache]: Analyzing trace with hash -900066335, now seen corresponding path program 2 times [2020-10-16 12:05:26,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:26,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013976769] [2020-10-16 12:05:26,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:26,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013976769] [2020-10-16 12:05:26,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:26,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:26,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255516650] [2020-10-16 12:05:26,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:05:26,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:26,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:05:26,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:26,142 INFO L87 Difference]: Start difference. First operand 561 states and 1483 transitions. Second operand 5 states. [2020-10-16 12:05:26,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:26,229 INFO L93 Difference]: Finished difference Result 757 states and 1944 transitions. [2020-10-16 12:05:26,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:26,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-16 12:05:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:26,235 INFO L225 Difference]: With dead ends: 757 [2020-10-16 12:05:26,235 INFO L226 Difference]: Without dead ends: 569 [2020-10-16 12:05:26,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:26,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-10-16 12:05:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 551. [2020-10-16 12:05:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2020-10-16 12:05:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 1387 transitions. [2020-10-16 12:05:26,257 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 1387 transitions. Word has length 19 [2020-10-16 12:05:26,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:26,257 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 1387 transitions. [2020-10-16 12:05:26,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 1387 transitions. [2020-10-16 12:05:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:05:26,262 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:26,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:26,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:05:26,263 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:26,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2026188855, now seen corresponding path program 1 times [2020-10-16 12:05:26,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:26,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190608233] [2020-10-16 12:05:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:26,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190608233] [2020-10-16 12:05:26,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:26,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:26,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835332605] [2020-10-16 12:05:26,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:26,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:26,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:26,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:26,367 INFO L87 Difference]: Start difference. First operand 551 states and 1387 transitions. Second operand 6 states. [2020-10-16 12:05:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:26,438 INFO L93 Difference]: Finished difference Result 474 states and 1145 transitions. [2020-10-16 12:05:26,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:05:26,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-16 12:05:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:26,440 INFO L225 Difference]: With dead ends: 474 [2020-10-16 12:05:26,441 INFO L226 Difference]: Without dead ends: 358 [2020-10-16 12:05:26,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:05:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2020-10-16 12:05:26,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 338. [2020-10-16 12:05:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-10-16 12:05:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 790 transitions. [2020-10-16 12:05:26,450 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 790 transitions. Word has length 19 [2020-10-16 12:05:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:26,450 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 790 transitions. [2020-10-16 12:05:26,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:26,451 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 790 transitions. [2020-10-16 12:05:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 12:05:26,452 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:26,452 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:26,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 12:05:26,453 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:26,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:26,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1225847851, now seen corresponding path program 1 times [2020-10-16 12:05:26,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:26,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872286543] [2020-10-16 12:05:26,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:05:26,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872286543] [2020-10-16 12:05:26,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:26,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:05:26,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012155941] [2020-10-16 12:05:26,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:05:26,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:26,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:05:26,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:26,547 INFO L87 Difference]: Start difference. First operand 338 states and 790 transitions. Second operand 7 states. [2020-10-16 12:05:26,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:26,644 INFO L93 Difference]: Finished difference Result 317 states and 748 transitions. [2020-10-16 12:05:26,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:05:26,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-16 12:05:26,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:26,647 INFO L225 Difference]: With dead ends: 317 [2020-10-16 12:05:26,647 INFO L226 Difference]: Without dead ends: 99 [2020-10-16 12:05:26,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:05:26,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-16 12:05:26,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2020-10-16 12:05:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-16 12:05:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 197 transitions. [2020-10-16 12:05:26,652 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 197 transitions. Word has length 22 [2020-10-16 12:05:26,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:26,654 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 197 transitions. [2020-10-16 12:05:26,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:05:26,654 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 197 transitions. [2020-10-16 12:05:26,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-16 12:05:26,655 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:26,655 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:26,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 12:05:26,656 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:05:26,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:26,656 INFO L82 PathProgramCache]: Analyzing trace with hash 358783119, now seen corresponding path program 1 times [2020-10-16 12:05:26,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:26,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380209749] [2020-10-16 12:05:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:05:26,724 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:05:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:05:26,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:05:26,839 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:05:26,839 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:05:26,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 12:05:26,841 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:05:26,862 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L3-->L841: Formula: (let ((.cse7 (= (mod ~z$r_buff1_thd0~0_In1044465942 256) 0)) (.cse6 (= (mod ~z$w_buff1_used~0_In1044465942 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In1044465942 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In1044465942 256) 0))) (let ((.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse3 (or .cse8 .cse9)) (.cse0 (not .cse6)) (.cse1 (not .cse7)) (.cse2 (or .cse6 .cse7))) (and (= ~z$r_buff1_thd0~0_Out1044465942 ~z$r_buff1_thd0~0_In1044465942) (or (and .cse0 (= ~z$w_buff1_used~0_Out1044465942 0) .cse1) (and .cse2 (= ~z$w_buff1_used~0_Out1044465942 ~z$w_buff1_used~0_In1044465942))) (or (and (= ~z$w_buff0_used~0_In1044465942 ~z$w_buff0_used~0_Out1044465942) .cse3) (and (= ~z$w_buff0_used~0_Out1044465942 0) .cse4 .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1044465942 0)) (or (and (= ~z~0_Out1044465942 ~z$w_buff0~0_In1044465942) .cse4 .cse5) (and .cse3 (or (and (= ~z$w_buff1~0_In1044465942 ~z~0_Out1044465942) .cse0 .cse1) (and .cse2 (= ~z~0_In1044465942 ~z~0_Out1044465942))))) (= ~z$r_buff0_thd0~0_In1044465942 ~z$r_buff0_thd0~0_Out1044465942)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1044465942, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1044465942, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1044465942, ~z$w_buff0~0=~z$w_buff0~0_In1044465942, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1044465942, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1044465942, ~z$w_buff1~0=~z$w_buff1~0_In1044465942, ~z~0=~z~0_In1044465942} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1044465942, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1044465942|, ~z$w_buff0~0=~z$w_buff0~0_In1044465942, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1044465942|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1044465942, ~z$w_buff1~0=~z$w_buff1~0_In1044465942, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1044465942|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1044465942|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1044465942|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1044465942|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1044465942, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1044465942, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1044465942, ~z~0=~z~0_Out1044465942} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 12:05:26,875 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,875 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,877 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,878 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,878 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,878 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,879 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,879 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,879 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,881 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,881 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,881 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,881 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,882 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,882 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,882 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,883 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,883 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,884 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,884 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,918 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,918 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,918 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,918 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,918 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,918 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,919 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,919 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,919 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,919 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,919 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,920 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,920 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,920 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,920 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,920 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,920 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,920 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,921 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:05:26,921 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:26,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:05:26 BasicIcfg [2020-10-16 12:05:26,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:05:26,997 INFO L168 Benchmark]: Toolchain (without parser) took 18592.05 ms. Allocated memory was 140.5 MB in the beginning and 455.1 MB in the end (delta: 314.6 MB). Free memory was 102.2 MB in the beginning and 394.3 MB in the end (delta: -292.1 MB). Peak memory consumption was 291.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:26,997 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:05:26,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.64 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 101.7 MB in the beginning and 158.1 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:26,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.89 ms. Allocated memory is still 204.5 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:26,999 INFO L168 Benchmark]: Boogie Preprocessor took 43.16 ms. Allocated memory is still 204.5 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:27,000 INFO L168 Benchmark]: RCFGBuilder took 2123.24 ms. Allocated memory was 204.5 MB in the beginning and 246.9 MB in the end (delta: 42.5 MB). Free memory was 152.2 MB in the beginning and 186.1 MB in the end (delta: -33.9 MB). Peak memory consumption was 101.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:27,000 INFO L168 Benchmark]: TraceAbstraction took 15542.18 ms. Allocated memory was 246.9 MB in the beginning and 455.1 MB in the end (delta: 208.1 MB). Free memory was 186.1 MB in the beginning and 394.3 MB in the end (delta: -208.2 MB). Peak memory consumption was 268.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:27,003 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 808.64 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 101.7 MB in the beginning and 158.1 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.89 ms. Allocated memory is still 204.5 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.16 ms. Allocated memory is still 204.5 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2123.24 ms. Allocated memory was 204.5 MB in the beginning and 246.9 MB in the end (delta: 42.5 MB). Free memory was 152.2 MB in the beginning and 186.1 MB in the end (delta: -33.9 MB). Peak memory consumption was 101.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15542.18 ms. Allocated memory was 246.9 MB in the beginning and 455.1 MB in the end (delta: 208.1 MB). Free memory was 186.1 MB in the beginning and 394.3 MB in the end (delta: -208.2 MB). Peak memory consumption was 268.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1236 VarBasedMoverChecksPositive, 49 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 107 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.9s, 118 PlacesBefore, 44 PlacesAfterwards, 107 TransitionsBefore, 31 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, 5641 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int a = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L709] 0 int y = 0; [L711] 0 int z = 0; [L712] 0 _Bool z$flush_delayed; [L713] 0 int z$mem_tmp; [L714] 0 _Bool z$r_buff0_thd0; [L715] 0 _Bool z$r_buff0_thd1; [L716] 0 _Bool z$r_buff0_thd2; [L717] 0 _Bool z$r_buff0_thd3; [L718] 0 _Bool z$r_buff0_thd4; [L719] 0 _Bool z$r_buff1_thd0; [L720] 0 _Bool z$r_buff1_thd1; [L721] 0 _Bool z$r_buff1_thd2; [L722] 0 _Bool z$r_buff1_thd3; [L723] 0 _Bool z$r_buff1_thd4; [L724] 0 _Bool z$read_delayed; [L725] 0 int *z$read_delayed_var; [L726] 0 int z$w_buff0; [L727] 0 _Bool z$w_buff0_used; [L728] 0 int z$w_buff1; [L729] 0 _Bool z$w_buff1_used; [L730] 0 _Bool weak$$choice0; [L731] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1541; [L824] FCALL, FORK 0 pthread_create(&t1541, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 pthread_t t1542; [L826] FCALL, FORK 0 pthread_create(&t1542, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 pthread_t t1543; [L828] FCALL, FORK 0 pthread_create(&t1543, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t1544; [L830] FCALL, FORK 0 pthread_create(&t1544, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 4 z$w_buff1 = z$w_buff0 [L786] 4 z$w_buff0 = 2 [L787] 4 z$w_buff1_used = z$w_buff0_used [L788] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L790] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L791] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L792] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L793] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L794] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L795] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L750] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L771] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L772] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L774] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L775] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L778] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 3 return 0; [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 2 return 0; [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L802] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L803] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L805] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L808] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 4 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 z$flush_delayed = weak$$choice2 [L846] 0 z$mem_tmp = z [L847] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L847] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L848] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L848] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L849] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L849] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L850] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L852] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L852] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L852] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L853] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L855] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L855] 0 z = z$flush_delayed ? z$mem_tmp : z [L856] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 548 SDtfs, 782 SDslu, 759 SDs, 0 SdLazy, 347 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 662 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 31886 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...