/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_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:04:58,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:04:58,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:04:58,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:04:58,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:04:58,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:04:58,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:04:58,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:04:58,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:04:58,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:04:58,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:04:58,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:04:58,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:04:58,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:04:58,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:04:58,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:04:58,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:04:58,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:04:58,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:04:58,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:04:58,291 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:04:58,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:04:58,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:04:58,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:04:58,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:04:58,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:04:58,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:04:58,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:04:58,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:04:58,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:04:58,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:04:58,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:04:58,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:04:58,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:04:58,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:04:58,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:04:58,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:04:58,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:04:58,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:04:58,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:04:58,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:04:58,307 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:04:58,329 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:04:58,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:04:58,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:04:58,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:04:58,331 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:04:58,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:04:58,331 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:04:58,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:04:58,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:04:58,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:04:58,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:04:58,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:04:58,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:04:58,332 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:04:58,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:04:58,333 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:04:58,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:04:58,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:04:58,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:04:58,333 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:04:58,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:04:58,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:04:58,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:04:58,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:04:58,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:04:58,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:04:58,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:04:58,335 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:04:58,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:04:58,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:04:58,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:04:58,628 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:04:58,630 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:04:58,630 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:04:58,631 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt.i [2020-10-16 12:04:58,705 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b851dfc70/957c02b1a8dc40a08f822d8179298b91/FLAG068e4b30c [2020-10-16 12:04:59,345 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:04:59,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix057_power.opt.i [2020-10-16 12:04:59,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b851dfc70/957c02b1a8dc40a08f822d8179298b91/FLAG068e4b30c [2020-10-16 12:04:59,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b851dfc70/957c02b1a8dc40a08f822d8179298b91 [2020-10-16 12:04:59,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:04:59,576 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:04:59,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:04:59,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:04:59,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:04:59,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:59" (1/1) ... [2020-10-16 12:04:59,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633362c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:59, skipping insertion in model container [2020-10-16 12:04:59,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:59" (1/1) ... [2020-10-16 12:04:59,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:04:59,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:05:00,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:05:00,143 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:05:00,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:05:00,321 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:05:00,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:00 WrapperNode [2020-10-16 12:05:00,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:05:00,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:05:00,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:05:00,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:05:00,331 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:00" (1/1) ... [2020-10-16 12:05:00,351 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:00" (1/1) ... [2020-10-16 12:05:00,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:05:00,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:05:00,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:05:00,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:05:00,404 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:00" (1/1) ... [2020-10-16 12:05:00,405 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:00" (1/1) ... [2020-10-16 12:05:00,410 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:00" (1/1) ... [2020-10-16 12:05:00,410 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:00" (1/1) ... [2020-10-16 12:05:00,421 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:00" (1/1) ... [2020-10-16 12:05:00,426 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:00" (1/1) ... [2020-10-16 12:05:00,429 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:00" (1/1) ... [2020-10-16 12:05:00,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:05:00,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:05:00,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:05:00,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:05:00,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:00" (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:00,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:05:00,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:05:00,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:05:00,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:05:00,514 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:05:00,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:05:00,515 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:05:00,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:05:00,515 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:05:00,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:05:00,515 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 12:05:00,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 12:05:00,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:05:00,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:05:00,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:05:00,518 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:02,474 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:05:02,474 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:05:02,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:05:02 BoogieIcfgContainer [2020-10-16 12:05:02,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:05:02,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:05:02,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:05:02,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:05:02,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:04:59" (1/3) ... [2020-10-16 12:05:02,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebb51ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:05:02, skipping insertion in model container [2020-10-16 12:05:02,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:05:00" (2/3) ... [2020-10-16 12:05:02,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebb51ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:05:02, skipping insertion in model container [2020-10-16 12:05:02,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:05:02" (3/3) ... [2020-10-16 12:05:02,486 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_power.opt.i [2020-10-16 12:05:02,498 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:05:02,499 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:05:02,507 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:05:02,508 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:05:02,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,541 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,543 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,544 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,544 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,547 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,547 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,548 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,548 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,548 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,548 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:02,549 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,549 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:02,549 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,549 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,556 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,557 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,559 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,560 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,560 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,560 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:02,560 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,561 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,561 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,561 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,561 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,561 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,562 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,564 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,564 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,564 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,565 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,567 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,568 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:05:02,571 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:05:02,587 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 12:05:02,612 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:05:02,613 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:05:02,613 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:05:02,613 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:05:02,613 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:05:02,613 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:05:02,613 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:05:02,614 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:05:02,630 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:05:02,631 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-16 12:05:02,634 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-16 12:05:02,636 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-16 12:05:02,692 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-16 12:05:02,693 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:05:02,699 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:02,703 INFO L117 LiptonReduction]: Number of co-enabled transitions 2352 [2020-10-16 12:05:04,279 WARN L193 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-16 12:05:04,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 12:05:04,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:05:04,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 12:05:04,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:05:05,712 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-16 12:05:06,326 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:05:07,347 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-16 12:05:07,673 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-16 12:05:07,834 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 12:05:07,941 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 12:05:08,749 WARN L193 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 128 [2020-10-16 12:05:09,069 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 12:05:09,671 WARN L193 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 108 [2020-10-16 12:05:09,954 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-16 12:05:10,754 WARN L193 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-16 12:05:11,080 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-16 12:05:11,351 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-16 12:05:11,490 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 12:05:11,514 INFO L132 LiptonReduction]: Checked pairs total: 5641 [2020-10-16 12:05:11,515 INFO L134 LiptonReduction]: Total number of compositions: 86 [2020-10-16 12:05:11,522 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-16 12:05:11,698 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-10-16 12:05:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-10-16 12:05:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:05:11,710 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:11,711 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:11,712 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:11,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:11,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1680903237, now seen corresponding path program 1 times [2020-10-16 12:05:11,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:11,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576759513] [2020-10-16 12:05:11,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:12,070 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:12,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576759513] [2020-10-16 12:05:12,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:12,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:05:12,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513303561] [2020-10-16 12:05:12,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:12,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:12,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:12,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:12,095 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-10-16 12:05:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:12,229 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-10-16 12:05:12,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:12,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:05:12,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:12,269 INFO L225 Difference]: With dead ends: 2202 [2020-10-16 12:05:12,270 INFO L226 Difference]: Without dead ends: 1802 [2020-10-16 12:05:12,271 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:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-16 12:05:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-10-16 12:05:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-10-16 12:05:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-10-16 12:05:12,465 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-10-16 12:05:12,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:12,466 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-10-16 12:05:12,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-10-16 12:05:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:05:12,471 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:12,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:12,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:05:12,472 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:12,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:12,473 INFO L82 PathProgramCache]: Analyzing trace with hash 440307530, now seen corresponding path program 1 times [2020-10-16 12:05:12,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:12,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873278285] [2020-10-16 12:05:12,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:12,616 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:12,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873278285] [2020-10-16 12:05:12,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:12,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:05:12,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597297949] [2020-10-16 12:05:12,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:12,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:12,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:12,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:12,620 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-10-16 12:05:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:12,648 INFO L93 Difference]: Finished difference Result 1762 states and 6602 transitions. [2020-10-16 12:05:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:12,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:05:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:12,665 INFO L225 Difference]: With dead ends: 1762 [2020-10-16 12:05:12,666 INFO L226 Difference]: Without dead ends: 1762 [2020-10-16 12:05:12,667 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:12,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2020-10-16 12:05:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2020-10-16 12:05:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2020-10-16 12:05:12,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 6602 transitions. [2020-10-16 12:05:12,737 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 6602 transitions. Word has length 11 [2020-10-16 12:05:12,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:12,738 INFO L481 AbstractCegarLoop]: Abstraction has 1762 states and 6602 transitions. [2020-10-16 12:05:12,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:12,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 6602 transitions. [2020-10-16 12:05:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:05:12,740 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:12,740 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:12,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:05:12,741 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:12,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:12,741 INFO L82 PathProgramCache]: Analyzing trace with hash 249955351, now seen corresponding path program 1 times [2020-10-16 12:05:12,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:12,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891676741] [2020-10-16 12:05:12,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:12,817 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:12,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891676741] [2020-10-16 12:05:12,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:12,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:05:12,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492902726] [2020-10-16 12:05:12,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:12,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:12,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:12,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:12,820 INFO L87 Difference]: Start difference. First operand 1762 states and 6602 transitions. Second operand 3 states. [2020-10-16 12:05:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:12,916 INFO L93 Difference]: Finished difference Result 1754 states and 6564 transitions. [2020-10-16 12:05:12,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:12,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-16 12:05:12,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:12,937 INFO L225 Difference]: With dead ends: 1754 [2020-10-16 12:05:12,937 INFO L226 Difference]: Without dead ends: 1754 [2020-10-16 12:05:12,938 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:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2020-10-16 12:05:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1754. [2020-10-16 12:05:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2020-10-16 12:05:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 6564 transitions. [2020-10-16 12:05:13,011 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 6564 transitions. Word has length 12 [2020-10-16 12:05:13,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:13,011 INFO L481 AbstractCegarLoop]: Abstraction has 1754 states and 6564 transitions. [2020-10-16 12:05:13,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 6564 transitions. [2020-10-16 12:05:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:05:13,017 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:13,020 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:13,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:05:13,021 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:13,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:13,027 INFO L82 PathProgramCache]: Analyzing trace with hash -840938303, now seen corresponding path program 1 times [2020-10-16 12:05:13,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:13,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557926354] [2020-10-16 12:05:13,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:13,151 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:13,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557926354] [2020-10-16 12:05:13,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:13,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:05:13,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382372354] [2020-10-16 12:05:13,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:13,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:13,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:13,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:13,155 INFO L87 Difference]: Start difference. First operand 1754 states and 6564 transitions. Second operand 3 states. [2020-10-16 12:05:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:13,193 INFO L93 Difference]: Finished difference Result 1732 states and 6468 transitions. [2020-10-16 12:05:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:13,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 12:05:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:13,209 INFO L225 Difference]: With dead ends: 1732 [2020-10-16 12:05:13,210 INFO L226 Difference]: Without dead ends: 1732 [2020-10-16 12:05:13,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2020-10-16 12:05:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1732. [2020-10-16 12:05:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2020-10-16 12:05:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 6468 transitions. [2020-10-16 12:05:13,271 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 6468 transitions. Word has length 13 [2020-10-16 12:05:13,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:13,272 INFO L481 AbstractCegarLoop]: Abstraction has 1732 states and 6468 transitions. [2020-10-16 12:05:13,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 6468 transitions. [2020-10-16 12:05:13,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:05:13,273 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:13,273 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:13,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:05:13,274 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:13,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:13,274 INFO L82 PathProgramCache]: Analyzing trace with hash -840461647, now seen corresponding path program 1 times [2020-10-16 12:05:13,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:13,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454003778] [2020-10-16 12:05:13,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:13,322 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:13,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454003778] [2020-10-16 12:05:13,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:13,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:05:13,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841898181] [2020-10-16 12:05:13,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:13,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:13,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:13,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:13,325 INFO L87 Difference]: Start difference. First operand 1732 states and 6468 transitions. Second operand 3 states. [2020-10-16 12:05:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:13,348 INFO L93 Difference]: Finished difference Result 1700 states and 6324 transitions. [2020-10-16 12:05:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:13,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 12:05:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:13,363 INFO L225 Difference]: With dead ends: 1700 [2020-10-16 12:05:13,363 INFO L226 Difference]: Without dead ends: 1700 [2020-10-16 12:05:13,364 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:13,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2020-10-16 12:05:13,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1700. [2020-10-16 12:05:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2020-10-16 12:05:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 6324 transitions. [2020-10-16 12:05:13,430 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 6324 transitions. Word has length 13 [2020-10-16 12:05:13,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:13,430 INFO L481 AbstractCegarLoop]: Abstraction has 1700 states and 6324 transitions. [2020-10-16 12:05:13,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 6324 transitions. [2020-10-16 12:05:13,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:05:13,432 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:13,432 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:13,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:05:13,433 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:13,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:13,433 INFO L82 PathProgramCache]: Analyzing trace with hash -333997007, now seen corresponding path program 1 times [2020-10-16 12:05:13,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:13,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430342121] [2020-10-16 12:05:13,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:13,590 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:13,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430342121] [2020-10-16 12:05:13,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:13,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:13,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988741864] [2020-10-16 12:05:13,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:05:13,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:13,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:05:13,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:13,592 INFO L87 Difference]: Start difference. First operand 1700 states and 6324 transitions. Second operand 5 states. [2020-10-16 12:05:13,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:13,673 INFO L93 Difference]: Finished difference Result 1686 states and 6262 transitions. [2020-10-16 12:05:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:13,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:05:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:13,688 INFO L225 Difference]: With dead ends: 1686 [2020-10-16 12:05:13,688 INFO L226 Difference]: Without dead ends: 1686 [2020-10-16 12:05:13,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2020-10-16 12:05:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1686. [2020-10-16 12:05:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2020-10-16 12:05:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 6262 transitions. [2020-10-16 12:05:13,757 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 6262 transitions. Word has length 14 [2020-10-16 12:05:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:13,758 INFO L481 AbstractCegarLoop]: Abstraction has 1686 states and 6262 transitions. [2020-10-16 12:05:13,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:13,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 6262 transitions. [2020-10-16 12:05:13,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:05:13,761 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:13,761 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:05:13,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:05:13,761 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:13,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:13,762 INFO L82 PathProgramCache]: Analyzing trace with hash -298426553, now seen corresponding path program 1 times [2020-10-16 12:05:13,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:13,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525811468] [2020-10-16 12:05:13,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:13,929 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:13,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525811468] [2020-10-16 12:05:13,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:13,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:13,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717052686] [2020-10-16 12:05:13,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:05:13,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:13,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:05:13,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:13,934 INFO L87 Difference]: Start difference. First operand 1686 states and 6262 transitions. Second operand 5 states. [2020-10-16 12:05:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:14,027 INFO L93 Difference]: Finished difference Result 1642 states and 6070 transitions. [2020-10-16 12:05:14,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:14,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:05:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:14,041 INFO L225 Difference]: With dead ends: 1642 [2020-10-16 12:05:14,041 INFO L226 Difference]: Without dead ends: 1642 [2020-10-16 12:05:14,042 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:14,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2020-10-16 12:05:14,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1642. [2020-10-16 12:05:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1642 states. [2020-10-16 12:05:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 6070 transitions. [2020-10-16 12:05:14,093 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 6070 transitions. Word has length 14 [2020-10-16 12:05:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:14,093 INFO L481 AbstractCegarLoop]: Abstraction has 1642 states and 6070 transitions. [2020-10-16 12:05:14,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 6070 transitions. [2020-10-16 12:05:14,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:05:14,096 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:14,096 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:14,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:05:14,096 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:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:14,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1797762494, now seen corresponding path program 1 times [2020-10-16 12:05:14,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:14,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449593711] [2020-10-16 12:05:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:14,207 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:14,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449593711] [2020-10-16 12:05:14,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:14,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:14,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970193777] [2020-10-16 12:05:14,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:05:14,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:14,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:05:14,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:14,209 INFO L87 Difference]: Start difference. First operand 1642 states and 6070 transitions. Second operand 5 states. [2020-10-16 12:05:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:14,263 INFO L93 Difference]: Finished difference Result 1630 states and 6016 transitions. [2020-10-16 12:05:14,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:14,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:05:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:14,278 INFO L225 Difference]: With dead ends: 1630 [2020-10-16 12:05:14,278 INFO L226 Difference]: Without dead ends: 1630 [2020-10-16 12:05:14,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2020-10-16 12:05:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1614. [2020-10-16 12:05:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2020-10-16 12:05:14,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 5960 transitions. [2020-10-16 12:05:14,330 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 5960 transitions. Word has length 15 [2020-10-16 12:05:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:14,330 INFO L481 AbstractCegarLoop]: Abstraction has 1614 states and 5960 transitions. [2020-10-16 12:05:14,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 5960 transitions. [2020-10-16 12:05:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:05:14,333 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:14,333 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:14,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:05:14,333 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:14,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1763115561, now seen corresponding path program 1 times [2020-10-16 12:05:14,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:14,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373956061] [2020-10-16 12:05:14,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:14,416 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:14,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373956061] [2020-10-16 12:05:14,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:14,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:05:14,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742492192] [2020-10-16 12:05:14,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:14,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:14,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:14,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:14,419 INFO L87 Difference]: Start difference. First operand 1614 states and 5960 transitions. Second operand 6 states. [2020-10-16 12:05:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:14,509 INFO L93 Difference]: Finished difference Result 1726 states and 6416 transitions. [2020-10-16 12:05:14,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:14,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 12:05:14,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:14,529 INFO L225 Difference]: With dead ends: 1726 [2020-10-16 12:05:14,529 INFO L226 Difference]: Without dead ends: 1726 [2020-10-16 12:05:14,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2020-10-16 12:05:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1726. [2020-10-16 12:05:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2020-10-16 12:05:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 6416 transitions. [2020-10-16 12:05:14,597 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 6416 transitions. Word has length 15 [2020-10-16 12:05:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:14,600 INFO L481 AbstractCegarLoop]: Abstraction has 1726 states and 6416 transitions. [2020-10-16 12:05:14,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 6416 transitions. [2020-10-16 12:05:14,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:05:14,605 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:14,606 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:14,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:05:14,606 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:14,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:14,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1763973021, now seen corresponding path program 2 times [2020-10-16 12:05:14,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:14,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655532913] [2020-10-16 12:05:14,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:14,791 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:14,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655532913] [2020-10-16 12:05:14,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:14,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:05:14,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060592595] [2020-10-16 12:05:14,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:14,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:14,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:14,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:14,794 INFO L87 Difference]: Start difference. First operand 1726 states and 6416 transitions. Second operand 6 states. [2020-10-16 12:05:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:15,015 INFO L93 Difference]: Finished difference Result 1790 states and 6668 transitions. [2020-10-16 12:05:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:05:15,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 12:05:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:15,027 INFO L225 Difference]: With dead ends: 1790 [2020-10-16 12:05:15,027 INFO L226 Difference]: Without dead ends: 1790 [2020-10-16 12:05:15,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:05:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2020-10-16 12:05:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1710. [2020-10-16 12:05:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2020-10-16 12:05:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 6360 transitions. [2020-10-16 12:05:15,100 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 6360 transitions. Word has length 15 [2020-10-16 12:05:15,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:15,103 INFO L481 AbstractCegarLoop]: Abstraction has 1710 states and 6360 transitions. [2020-10-16 12:05:15,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 6360 transitions. [2020-10-16 12:05:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:05:15,106 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:15,106 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:15,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:05:15,107 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:15,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:15,107 INFO L82 PathProgramCache]: Analyzing trace with hash -662040201, now seen corresponding path program 3 times [2020-10-16 12:05:15,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:15,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457070026] [2020-10-16 12:05:15,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:15,247 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:15,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457070026] [2020-10-16 12:05:15,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:15,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:05:15,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156920866] [2020-10-16 12:05:15,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:15,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:15,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:15,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:15,249 INFO L87 Difference]: Start difference. First operand 1710 states and 6360 transitions. Second operand 6 states. [2020-10-16 12:05:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:15,421 INFO L93 Difference]: Finished difference Result 1806 states and 6670 transitions. [2020-10-16 12:05:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:05:15,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 12:05:15,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:15,429 INFO L225 Difference]: With dead ends: 1806 [2020-10-16 12:05:15,429 INFO L226 Difference]: Without dead ends: 1806 [2020-10-16 12:05:15,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:05:15,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2020-10-16 12:05:15,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1682. [2020-10-16 12:05:15,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2020-10-16 12:05:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 6188 transitions. [2020-10-16 12:05:15,486 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 6188 transitions. Word has length 15 [2020-10-16 12:05:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:15,487 INFO L481 AbstractCegarLoop]: Abstraction has 1682 states and 6188 transitions. [2020-10-16 12:05:15,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 6188 transitions. [2020-10-16 12:05:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:05:15,491 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:15,492 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:15,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:05:15,492 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:15,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:15,492 INFO L82 PathProgramCache]: Analyzing trace with hash 104794598, now seen corresponding path program 1 times [2020-10-16 12:05:15,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:15,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350274244] [2020-10-16 12:05:15,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:15,677 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:15,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350274244] [2020-10-16 12:05:15,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:15,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:15,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242909243] [2020-10-16 12:05:15,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:05:15,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:15,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:05:15,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:15,679 INFO L87 Difference]: Start difference. First operand 1682 states and 6188 transitions. Second operand 7 states. [2020-10-16 12:05:15,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:15,886 INFO L93 Difference]: Finished difference Result 1874 states and 6892 transitions. [2020-10-16 12:05:15,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:15,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-16 12:05:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:15,895 INFO L225 Difference]: With dead ends: 1874 [2020-10-16 12:05:15,895 INFO L226 Difference]: Without dead ends: 1874 [2020-10-16 12:05:15,896 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:15,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2020-10-16 12:05:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1874. [2020-10-16 12:05:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2020-10-16 12:05:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 6892 transitions. [2020-10-16 12:05:15,953 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 6892 transitions. Word has length 16 [2020-10-16 12:05:15,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:15,954 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 6892 transitions. [2020-10-16 12:05:15,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:05:15,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 6892 transitions. [2020-10-16 12:05:15,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:05:15,957 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:15,957 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:15,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:05:15,958 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:15,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:15,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1177270598, now seen corresponding path program 2 times [2020-10-16 12:05:15,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:15,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412901434] [2020-10-16 12:05:15,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:16,105 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:16,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412901434] [2020-10-16 12:05:16,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:16,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:16,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726938684] [2020-10-16 12:05:16,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:05:16,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:16,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:05:16,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:16,110 INFO L87 Difference]: Start difference. First operand 1874 states and 6892 transitions. Second operand 7 states. [2020-10-16 12:05:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:16,260 INFO L93 Difference]: Finished difference Result 2162 states and 7996 transitions. [2020-10-16 12:05:16,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:05:16,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-16 12:05:16,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:16,270 INFO L225 Difference]: With dead ends: 2162 [2020-10-16 12:05:16,270 INFO L226 Difference]: Without dead ends: 2162 [2020-10-16 12:05:16,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:05:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2020-10-16 12:05:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1970. [2020-10-16 12:05:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2020-10-16 12:05:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 7292 transitions. [2020-10-16 12:05:16,337 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 7292 transitions. Word has length 16 [2020-10-16 12:05:16,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:16,337 INFO L481 AbstractCegarLoop]: Abstraction has 1970 states and 7292 transitions. [2020-10-16 12:05:16,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:05:16,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 7292 transitions. [2020-10-16 12:05:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:05:16,342 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:16,342 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:16,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:05:16,342 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:16,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:16,347 INFO L82 PathProgramCache]: Analyzing trace with hash 950868390, now seen corresponding path program 3 times [2020-10-16 12:05:16,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:16,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956239314] [2020-10-16 12:05:16,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:16,577 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:16,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956239314] [2020-10-16 12:05:16,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:16,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:16,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427861422] [2020-10-16 12:05:16,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:05:16,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:16,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:05:16,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:16,580 INFO L87 Difference]: Start difference. First operand 1970 states and 7292 transitions. Second operand 7 states. [2020-10-16 12:05:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:16,739 INFO L93 Difference]: Finished difference Result 2190 states and 7898 transitions. [2020-10-16 12:05:16,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:05:16,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-16 12:05:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:16,750 INFO L225 Difference]: With dead ends: 2190 [2020-10-16 12:05:16,750 INFO L226 Difference]: Without dead ends: 1902 [2020-10-16 12:05:16,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:05:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2020-10-16 12:05:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1530. [2020-10-16 12:05:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1530 states. [2020-10-16 12:05:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 5520 transitions. [2020-10-16 12:05:16,798 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 5520 transitions. Word has length 16 [2020-10-16 12:05:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:16,799 INFO L481 AbstractCegarLoop]: Abstraction has 1530 states and 5520 transitions. [2020-10-16 12:05:16,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:05:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 5520 transitions. [2020-10-16 12:05:16,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:05:16,802 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:16,803 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:16,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:05:16,803 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:16,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:16,803 INFO L82 PathProgramCache]: Analyzing trace with hash 974833126, now seen corresponding path program 1 times [2020-10-16 12:05:16,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:16,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568537503] [2020-10-16 12:05:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:16,852 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:16,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568537503] [2020-10-16 12:05:16,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:16,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:16,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429337853] [2020-10-16 12:05:16,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:05:16,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:16,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:05:16,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:05:16,854 INFO L87 Difference]: Start difference. First operand 1530 states and 5520 transitions. Second operand 4 states. [2020-10-16 12:05:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:16,892 INFO L93 Difference]: Finished difference Result 1618 states and 5330 transitions. [2020-10-16 12:05:16,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:16,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 12:05:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:16,898 INFO L225 Difference]: With dead ends: 1618 [2020-10-16 12:05:16,899 INFO L226 Difference]: Without dead ends: 1218 [2020-10-16 12:05:16,899 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:16,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-10-16 12:05:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1218. [2020-10-16 12:05:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2020-10-16 12:05:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 3978 transitions. [2020-10-16 12:05:17,010 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 3978 transitions. Word has length 16 [2020-10-16 12:05:17,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:17,010 INFO L481 AbstractCegarLoop]: Abstraction has 1218 states and 3978 transitions. [2020-10-16 12:05:17,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:05:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 3978 transitions. [2020-10-16 12:05:17,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:05:17,013 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:17,013 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:17,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:05:17,014 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:17,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:17,014 INFO L82 PathProgramCache]: Analyzing trace with hash -350364005, now seen corresponding path program 1 times [2020-10-16 12:05:17,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:17,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422481277] [2020-10-16 12:05:17,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:17,077 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:17,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422481277] [2020-10-16 12:05:17,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:17,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:05:17,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565773704] [2020-10-16 12:05:17,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:05:17,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:17,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:05:17,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:05:17,081 INFO L87 Difference]: Start difference. First operand 1218 states and 3978 transitions. Second operand 5 states. [2020-10-16 12:05:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:17,131 INFO L93 Difference]: Finished difference Result 1085 states and 3261 transitions. [2020-10-16 12:05:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:05:17,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 12:05:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:17,134 INFO L225 Difference]: With dead ends: 1085 [2020-10-16 12:05:17,134 INFO L226 Difference]: Without dead ends: 829 [2020-10-16 12:05:17,135 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:17,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2020-10-16 12:05:17,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2020-10-16 12:05:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2020-10-16 12:05:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 2452 transitions. [2020-10-16 12:05:17,155 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 2452 transitions. Word has length 17 [2020-10-16 12:05:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:17,156 INFO L481 AbstractCegarLoop]: Abstraction has 829 states and 2452 transitions. [2020-10-16 12:05:17,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:05:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 2452 transitions. [2020-10-16 12:05:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 12:05:17,158 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:17,158 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:17,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:05:17,158 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:17,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:17,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1278143232, now seen corresponding path program 1 times [2020-10-16 12:05:17,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:17,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989564354] [2020-10-16 12:05:17,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:17,201 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:17,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989564354] [2020-10-16 12:05:17,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:17,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:05:17,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091141295] [2020-10-16 12:05:17,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:05:17,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:17,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:05:17,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:17,203 INFO L87 Difference]: Start difference. First operand 829 states and 2452 transitions. Second operand 3 states. [2020-10-16 12:05:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:17,221 INFO L93 Difference]: Finished difference Result 1173 states and 3373 transitions. [2020-10-16 12:05:17,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:05:17,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-10-16 12:05:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:17,224 INFO L225 Difference]: With dead ends: 1173 [2020-10-16 12:05:17,224 INFO L226 Difference]: Without dead ends: 839 [2020-10-16 12:05:17,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:05:17,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2020-10-16 12:05:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 823. [2020-10-16 12:05:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2020-10-16 12:05:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 2301 transitions. [2020-10-16 12:05:17,244 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 2301 transitions. Word has length 18 [2020-10-16 12:05:17,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:17,245 INFO L481 AbstractCegarLoop]: Abstraction has 823 states and 2301 transitions. [2020-10-16 12:05:17,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:05:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 2301 transitions. [2020-10-16 12:05:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:05:17,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:17,247 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:17,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:05:17,247 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:17,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:17,248 INFO L82 PathProgramCache]: Analyzing trace with hash 125424893, now seen corresponding path program 1 times [2020-10-16 12:05:17,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:17,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794852900] [2020-10-16 12:05:17,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:17,285 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:17,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794852900] [2020-10-16 12:05:17,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:17,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:05:17,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479534921] [2020-10-16 12:05:17,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:05:17,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:17,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:05:17,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:05:17,287 INFO L87 Difference]: Start difference. First operand 823 states and 2301 transitions. Second operand 4 states. [2020-10-16 12:05:17,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:17,306 INFO L93 Difference]: Finished difference Result 1115 states and 3040 transitions. [2020-10-16 12:05:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:17,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-16 12:05:17,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:17,309 INFO L225 Difference]: With dead ends: 1115 [2020-10-16 12:05:17,309 INFO L226 Difference]: Without dead ends: 513 [2020-10-16 12:05:17,309 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:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2020-10-16 12:05:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2020-10-16 12:05:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2020-10-16 12:05:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1303 transitions. [2020-10-16 12:05:17,320 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1303 transitions. Word has length 19 [2020-10-16 12:05:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:17,321 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 1303 transitions. [2020-10-16 12:05:17,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:05:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1303 transitions. [2020-10-16 12:05:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:05:17,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:17,322 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:17,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 12:05:17,323 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:17,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:17,323 INFO L82 PathProgramCache]: Analyzing trace with hash -900066335, now seen corresponding path program 2 times [2020-10-16 12:05:17,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:17,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852784508] [2020-10-16 12:05:17,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:17,368 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:17,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852784508] [2020-10-16 12:05:17,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:17,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:05:17,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914681965] [2020-10-16 12:05:17,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:05:17,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:17,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:05:17,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:05:17,371 INFO L87 Difference]: Start difference. First operand 513 states and 1303 transitions. Second operand 4 states. [2020-10-16 12:05:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:17,394 INFO L93 Difference]: Finished difference Result 687 states and 1688 transitions. [2020-10-16 12:05:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:05:17,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-16 12:05:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:17,396 INFO L225 Difference]: With dead ends: 687 [2020-10-16 12:05:17,396 INFO L226 Difference]: Without dead ends: 517 [2020-10-16 12:05:17,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-10-16 12:05:17,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 503. [2020-10-16 12:05:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2020-10-16 12:05:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 1209 transitions. [2020-10-16 12:05:17,407 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 1209 transitions. Word has length 19 [2020-10-16 12:05:17,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:17,407 INFO L481 AbstractCegarLoop]: Abstraction has 503 states and 1209 transitions. [2020-10-16 12:05:17,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:05:17,408 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 1209 transitions. [2020-10-16 12:05:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:05:17,409 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:17,409 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:17,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 12:05:17,409 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:17,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:17,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2026188855, now seen corresponding path program 1 times [2020-10-16 12:05:17,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:17,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111658229] [2020-10-16 12:05:17,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:17,470 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:17,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111658229] [2020-10-16 12:05:17,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:17,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:05:17,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755422170] [2020-10-16 12:05:17,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:05:17,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:17,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:05:17,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:05:17,472 INFO L87 Difference]: Start difference. First operand 503 states and 1209 transitions. Second operand 6 states. [2020-10-16 12:05:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:17,541 INFO L93 Difference]: Finished difference Result 432 states and 991 transitions. [2020-10-16 12:05:17,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:05:17,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-16 12:05:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:17,543 INFO L225 Difference]: With dead ends: 432 [2020-10-16 12:05:17,543 INFO L226 Difference]: Without dead ends: 296 [2020-10-16 12:05:17,544 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:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-10-16 12:05:17,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2020-10-16 12:05:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-10-16 12:05:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 646 transitions. [2020-10-16 12:05:17,549 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 646 transitions. Word has length 19 [2020-10-16 12:05:17,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:17,550 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 646 transitions. [2020-10-16 12:05:17,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:05:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 646 transitions. [2020-10-16 12:05:17,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 12:05:17,551 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:17,551 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:17,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 12:05:17,551 INFO L429 AbstractCegarLoop]: === Iteration 21 === [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:17,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:17,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1225847851, now seen corresponding path program 1 times [2020-10-16 12:05:17,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:17,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315186323] [2020-10-16 12:05:17,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:05:17,634 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:17,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315186323] [2020-10-16 12:05:17,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:05:17,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:05:17,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235240127] [2020-10-16 12:05:17,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:05:17,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:05:17,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:05:17,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:05:17,636 INFO L87 Difference]: Start difference. First operand 296 states and 646 transitions. Second operand 7 states. [2020-10-16 12:05:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:05:17,740 INFO L93 Difference]: Finished difference Result 276 states and 607 transitions. [2020-10-16 12:05:17,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:05:17,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-16 12:05:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:05:17,742 INFO L225 Difference]: With dead ends: 276 [2020-10-16 12:05:17,742 INFO L226 Difference]: Without dead ends: 63 [2020-10-16 12:05:17,742 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:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-16 12:05:17,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-16 12:05:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-16 12:05:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 121 transitions. [2020-10-16 12:05:17,744 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 121 transitions. Word has length 22 [2020-10-16 12:05:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:05:17,745 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 121 transitions. [2020-10-16 12:05:17,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:05:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 121 transitions. [2020-10-16 12:05:17,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-16 12:05:17,745 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:05:17,746 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:17,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 12:05:17,746 INFO L429 AbstractCegarLoop]: === Iteration 22 === [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:17,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:05:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash 358783119, now seen corresponding path program 1 times [2020-10-16 12:05:17,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:05:17,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733670125] [2020-10-16 12:05:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:05:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:05:17,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:05:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:05:17,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:05:17,855 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:05:17,856 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:05:17,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 12:05:17,857 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:05:17,871 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L3-->L841: Formula: (let ((.cse7 (= (mod ~z$w_buff0_used~0_In-1661822591 256) 0)) (.cse6 (= 0 (mod ~z$r_buff0_thd0~0_In-1661822591 256))) (.cse8 (= (mod ~z$r_buff1_thd0~0_In-1661822591 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In-1661822591 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and .cse0 (= ~z$w_buff1_used~0_Out-1661822591 ~z$w_buff1_used~0_In-1661822591)) (and (= ~z$w_buff1_used~0_Out-1661822591 0) .cse1 .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-1661822591 0)) (= ~z$r_buff0_thd0~0_Out-1661822591 ~z$r_buff0_thd0~0_In-1661822591) (or (and (= ~z$w_buff0_used~0_In-1661822591 ~z$w_buff0_used~0_Out-1661822591) .cse3) (and .cse4 .cse5 (= ~z$w_buff0_used~0_Out-1661822591 0))) (or (and (or (and .cse0 (= ~z~0_In-1661822591 ~z~0_Out-1661822591)) (and (= ~z$w_buff1~0_In-1661822591 ~z~0_Out-1661822591) .cse1 .cse2)) .cse3) (and .cse4 .cse5 (= ~z~0_Out-1661822591 ~z$w_buff0~0_In-1661822591))) (= ~z$r_buff1_thd0~0_In-1661822591 ~z$r_buff1_thd0~0_Out-1661822591)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1661822591, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1661822591, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1661822591, ~z$w_buff0~0=~z$w_buff0~0_In-1661822591, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1661822591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1661822591, ~z$w_buff1~0=~z$w_buff1~0_In-1661822591, ~z~0=~z~0_In-1661822591} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1661822591, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1661822591|, ~z$w_buff0~0=~z$w_buff0~0_In-1661822591, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1661822591|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1661822591, ~z$w_buff1~0=~z$w_buff1~0_In-1661822591, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1661822591|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1661822591|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1661822591|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1661822591|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-1661822591, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1661822591, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1661822591, ~z~0=~z~0_Out-1661822591} 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:17,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:17,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,880 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:17,880 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,880 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:17,881 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,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:17,881 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,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:17,881 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,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:17,881 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,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:17,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,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:17,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,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:17,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,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:17,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,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:17,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,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:17,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,885 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:17,885 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,886 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:17,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,886 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:17,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,886 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:17,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,887 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:17,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,887 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:17,887 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,887 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:17,888 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,888 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:17,888 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,888 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:17,888 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,889 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:17,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,889 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:17,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,889 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:17,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,889 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:17,890 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:05:17,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:05:17 BasicIcfg [2020-10-16 12:05:17,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:05:17,965 INFO L168 Benchmark]: Toolchain (without parser) took 18390.10 ms. Allocated memory was 137.9 MB in the beginning and 423.1 MB in the end (delta: 285.2 MB). Free memory was 99.6 MB in the beginning and 158.3 MB in the end (delta: -58.7 MB). Peak memory consumption was 226.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:17,966 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-16 12:05:17,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.18 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 99.2 MB in the beginning and 155.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:17,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.98 ms. Allocated memory is still 201.3 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:17,968 INFO L168 Benchmark]: Boogie Preprocessor took 40.75 ms. Allocated memory is still 201.3 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:17,968 INFO L168 Benchmark]: RCFGBuilder took 2041.67 ms. Allocated memory was 201.3 MB in the beginning and 252.2 MB in the end (delta: 50.9 MB). Free memory was 149.9 MB in the beginning and 200.1 MB in the end (delta: -50.2 MB). Peak memory consumption was 104.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:17,969 INFO L168 Benchmark]: TraceAbstraction took 15485.73 ms. Allocated memory was 252.2 MB in the beginning and 423.1 MB in the end (delta: 170.9 MB). Free memory was 200.1 MB in the beginning and 158.3 MB in the end (delta: 41.8 MB). Peak memory consumption was 212.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:05:17,972 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 746.18 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 99.2 MB in the beginning and 155.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.98 ms. Allocated memory is still 201.3 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.75 ms. Allocated memory is still 201.3 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2041.67 ms. Allocated memory was 201.3 MB in the beginning and 252.2 MB in the end (delta: 50.9 MB). Free memory was 149.9 MB in the beginning and 200.1 MB in the end (delta: -50.2 MB). Peak memory consumption was 104.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15485.73 ms. Allocated memory was 252.2 MB in the beginning and 423.1 MB in the end (delta: 170.9 MB). Free memory was 200.1 MB in the beginning and 158.3 MB in the end (delta: 41.8 MB). Peak memory consumption was 212.7 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.8s, 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 t1517; [L824] FCALL, FORK 0 pthread_create(&t1517, ((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 t1518; [L826] FCALL, FORK 0 pthread_create(&t1518, ((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 t1519; [L828] FCALL, FORK 0 pthread_create(&t1519, ((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 t1520; [L830] FCALL, FORK 0 pthread_create(&t1520, ((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=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.2s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 605 SDtfs, 889 SDslu, 872 SDs, 0 SdLazy, 403 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 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.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 814 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 349 NumberOfCodeBlocks, 349 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 35580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...