/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 13:17:53,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 13:17:53,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 13:17:53,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 13:17:53,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 13:17:53,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 13:17:53,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 13:17:53,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 13:17:53,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 13:17:53,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 13:17:53,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 13:17:53,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 13:17:53,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 13:17:53,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 13:17:53,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 13:17:53,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 13:17:53,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 13:17:53,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 13:17:53,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 13:17:53,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 13:17:53,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 13:17:53,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 13:17:53,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 13:17:53,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 13:17:53,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 13:17:53,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 13:17:53,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 13:17:53,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 13:17:53,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 13:17:53,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 13:17:53,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 13:17:53,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 13:17:53,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 13:17:53,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 13:17:53,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 13:17:53,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 13:17:53,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 13:17:53,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 13:17:53,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 13:17:53,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 13:17:53,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 13:17:53,351 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-02 13:17:53,387 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 13:17:53,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 13:17:53,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 13:17:53,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 13:17:53,390 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 13:17:53,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 13:17:53,390 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 13:17:53,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 13:17:53,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 13:17:53,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 13:17:53,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 13:17:53,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 13:17:53,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 13:17:53,392 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 13:17:53,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 13:17:53,392 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 13:17:53,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 13:17:53,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 13:17:53,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 13:17:53,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 13:17:53,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 13:17:53,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 13:17:53,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 13:17:53,393 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 13:17:53,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 13:17:53,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 13:17:53,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 13:17:53,393 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 13:17:53,393 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 13:17:53,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 13:17:53,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 13:17:53,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 13:17:53,678 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 13:17:53,679 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 13:17:53,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2021-05-02 13:17:53,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e3cd956/6838d183d10e43e3a155ae619a6e1481/FLAG265ad7e60 [2021-05-02 13:17:54,061 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 13:17:54,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2021-05-02 13:17:54,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e3cd956/6838d183d10e43e3a155ae619a6e1481/FLAG265ad7e60 [2021-05-02 13:17:54,462 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e3cd956/6838d183d10e43e3a155ae619a6e1481 [2021-05-02 13:17:54,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 13:17:54,465 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 13:17:54,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 13:17:54,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 13:17:54,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 13:17:54,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 01:17:54" (1/1) ... [2021-05-02 13:17:54,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1915ab42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:17:54, skipping insertion in model container [2021-05-02 13:17:54,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 01:17:54" (1/1) ... [2021-05-02 13:17:54,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 13:17:54,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 13:17:54,578 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2021-05-02 13:17:54,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 13:17:54,598 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 13:17:54,612 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2021-05-02 13:17:54,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 13:17:54,639 INFO L208 MainTranslator]: Completed translation [2021-05-02 13:17:54,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:17:54 WrapperNode [2021-05-02 13:17:54,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 13:17:54,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 13:17:54,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 13:17:54,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 13:17:54,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:17:54" (1/1) ... [2021-05-02 13:17:54,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:17:54" (1/1) ... [2021-05-02 13:17:54,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:17:54" (1/1) ... [2021-05-02 13:17:54,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:17:54" (1/1) ... [2021-05-02 13:17:54,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:17:54" (1/1) ... [2021-05-02 13:17:54,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:17:54" (1/1) ... [2021-05-02 13:17:54,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:17:54" (1/1) ... [2021-05-02 13:17:54,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 13:17:54,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 13:17:54,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 13:17:54,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 13:17:54,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:17:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 13:17:54,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 13:17:54,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 13:17:54,751 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 13:17:54,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 13:17:54,751 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 13:17:54,751 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 13:17:54,751 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 13:17:54,751 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 13:17:54,752 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 13:17:54,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 13:17:54,752 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 13:17:54,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 13:17:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 13:17:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 13:17:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 13:17:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 13:17:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 13:17:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 13:17:54,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 13:17:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 13:17:55,017 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 13:17:55,017 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-02 13:17:55,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 01:17:55 BoogieIcfgContainer [2021-05-02 13:17:55,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 13:17:55,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 13:17:55,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 13:17:55,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 13:17:55,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 01:17:54" (1/3) ... [2021-05-02 13:17:55,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e429d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 01:17:55, skipping insertion in model container [2021-05-02 13:17:55,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:17:54" (2/3) ... [2021-05-02 13:17:55,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e429d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 01:17:55, skipping insertion in model container [2021-05-02 13:17:55,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 01:17:55" (3/3) ... [2021-05-02 13:17:55,023 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2021-05-02 13:17:55,027 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 13:17:55,029 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 13:17:55,041 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 13:17:55,056 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 13:17:55,056 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 13:17:55,057 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 13:17:55,057 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 13:17:55,057 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 13:17:55,057 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 13:17:55,057 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 13:17:55,057 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 13:17:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 13:17:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 13:17:55,073 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:17:55,074 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:17:55,074 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:17:55,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:17:55,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1039138334, now seen corresponding path program 1 times [2021-05-02 13:17:55,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:17:55,084 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831036944] [2021-05-02 13:17:55,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:17:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:55,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:17:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:55,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:17:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:17:55,257 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:17:55,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831036944] [2021-05-02 13:17:55,258 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831036944] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:17:55,258 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:17:55,258 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 13:17:55,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631890881] [2021-05-02 13:17:55,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 13:17:55,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:17:55,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 13:17:55,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 13:17:55,271 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 13:17:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:17:55,348 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2021-05-02 13:17:55,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 13:17:55,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2021-05-02 13:17:55,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:17:55,358 INFO L225 Difference]: With dead ends: 50 [2021-05-02 13:17:55,358 INFO L226 Difference]: Without dead ends: 27 [2021-05-02 13:17:55,360 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 13:17:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-02 13:17:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-05-02 13:17:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 13:17:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-05-02 13:17:55,382 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2021-05-02 13:17:55,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:17:55,383 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-05-02 13:17:55,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 13:17:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2021-05-02 13:17:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 13:17:55,384 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:17:55,384 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:17:55,384 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 13:17:55,384 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:17:55,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:17:55,385 INFO L82 PathProgramCache]: Analyzing trace with hash 677978447, now seen corresponding path program 1 times [2021-05-02 13:17:55,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:17:55,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57587321] [2021-05-02 13:17:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:17:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:55,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:17:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:55,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:17:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:17:55,514 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:17:55,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57587321] [2021-05-02 13:17:55,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57587321] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:17:55,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:17:55,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 13:17:55,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477527819] [2021-05-02 13:17:55,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 13:17:55,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:17:55,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 13:17:55,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-02 13:17:55,517 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 13:17:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:17:55,663 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2021-05-02 13:17:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 13:17:55,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2021-05-02 13:17:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:17:55,664 INFO L225 Difference]: With dead ends: 46 [2021-05-02 13:17:55,664 INFO L226 Difference]: Without dead ends: 31 [2021-05-02 13:17:55,665 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 83.4ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-02 13:17:55,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-02 13:17:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-05-02 13:17:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 13:17:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-05-02 13:17:55,671 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 21 [2021-05-02 13:17:55,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:17:55,671 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-05-02 13:17:55,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 13:17:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-05-02 13:17:55,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-02 13:17:55,672 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:17:55,672 INFO L523 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] [2021-05-02 13:17:55,672 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 13:17:55,672 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:17:55,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:17:55,673 INFO L82 PathProgramCache]: Analyzing trace with hash -673447056, now seen corresponding path program 1 times [2021-05-02 13:17:55,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:17:55,673 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9229817] [2021-05-02 13:17:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:17:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:55,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:17:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:55,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:17:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-02 13:17:55,769 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:17:55,769 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9229817] [2021-05-02 13:17:55,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9229817] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:17:55,769 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:17:55,769 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 13:17:55,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265978117] [2021-05-02 13:17:55,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 13:17:55,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:17:55,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 13:17:55,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 13:17:55,771 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 13:17:55,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:17:55,865 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2021-05-02 13:17:55,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 13:17:55,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-05-02 13:17:55,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:17:55,868 INFO L225 Difference]: With dead ends: 49 [2021-05-02 13:17:55,868 INFO L226 Difference]: Without dead ends: 33 [2021-05-02 13:17:55,868 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 13:17:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-02 13:17:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-05-02 13:17:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 13:17:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2021-05-02 13:17:55,875 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2021-05-02 13:17:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:17:55,876 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-05-02 13:17:55,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 13:17:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2021-05-02 13:17:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-02 13:17:55,876 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:17:55,876 INFO L523 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] [2021-05-02 13:17:55,876 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 13:17:55,877 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:17:55,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:17:55,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1101560306, now seen corresponding path program 1 times [2021-05-02 13:17:55,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:17:55,877 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604916540] [2021-05-02 13:17:55,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:17:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:55,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:17:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:56,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:17:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-02 13:17:56,022 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:17:56,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604916540] [2021-05-02 13:17:56,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604916540] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:17:56,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:17:56,022 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 13:17:56,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044503284] [2021-05-02 13:17:56,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 13:17:56,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:17:56,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 13:17:56,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 13:17:56,024 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 13:17:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:17:56,155 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2021-05-02 13:17:56,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 13:17:56,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2021-05-02 13:17:56,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:17:56,158 INFO L225 Difference]: With dead ends: 57 [2021-05-02 13:17:56,158 INFO L226 Difference]: Without dead ends: 40 [2021-05-02 13:17:56,160 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 70.7ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-05-02 13:17:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-02 13:17:56,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-05-02 13:17:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 13:17:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2021-05-02 13:17:56,181 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 24 [2021-05-02 13:17:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:17:56,181 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2021-05-02 13:17:56,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 13:17:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2021-05-02 13:17:56,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-02 13:17:56,182 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:17:56,183 INFO L523 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] [2021-05-02 13:17:56,183 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 13:17:56,183 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:17:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:17:56,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1103407348, now seen corresponding path program 1 times [2021-05-02 13:17:56,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:17:56,186 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879949362] [2021-05-02 13:17:56,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:17:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:56,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:17:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:56,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:17:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:17:56,282 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:17:56,282 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879949362] [2021-05-02 13:17:56,283 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879949362] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:17:56,283 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346055992] [2021-05-02 13:17:56,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:17:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:56,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-02 13:17:56,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:17:56,483 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:56,488 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:56,522 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:17:56,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346055992] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:17:56,539 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:17:56,539 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2021-05-02 13:17:56,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831991916] [2021-05-02 13:17:56,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 13:17:56,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:17:56,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 13:17:56,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 13:17:56,541 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:17:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:17:56,688 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2021-05-02 13:17:56,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 13:17:56,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2021-05-02 13:17:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:17:56,691 INFO L225 Difference]: With dead ends: 79 [2021-05-02 13:17:56,692 INFO L226 Difference]: Without dead ends: 51 [2021-05-02 13:17:56,693 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 98.1ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-05-02 13:17:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-02 13:17:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2021-05-02 13:17:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 13:17:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2021-05-02 13:17:56,710 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 24 [2021-05-02 13:17:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:17:56,710 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2021-05-02 13:17:56,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:17:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2021-05-02 13:17:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 13:17:56,711 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:17:56,711 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:17:56,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:17:56,912 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:17:56,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:17:56,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1809680179, now seen corresponding path program 2 times [2021-05-02 13:17:56,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:17:56,913 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612487798] [2021-05-02 13:17:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:17:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:56,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:17:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:56,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:17:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:17:56,990 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:17:56,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612487798] [2021-05-02 13:17:56,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612487798] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:17:56,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070142277] [2021-05-02 13:17:56,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:17:57,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 13:17:57,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:17:57,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2021-05-02 13:17:57,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:17:57,120 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:57,132 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-02 13:17:57,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070142277] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:17:57,146 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-02 13:17:57,147 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2021-05-02 13:17:57,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185737516] [2021-05-02 13:17:57,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 13:17:57,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:17:57,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 13:17:57,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-02 13:17:57,148 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 13:17:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:17:57,246 INFO L93 Difference]: Finished difference Result 122 states and 169 transitions. [2021-05-02 13:17:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 13:17:57,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2021-05-02 13:17:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:17:57,248 INFO L225 Difference]: With dead ends: 122 [2021-05-02 13:17:57,248 INFO L226 Difference]: Without dead ends: 88 [2021-05-02 13:17:57,248 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 68.6ms TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-05-02 13:17:57,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-05-02 13:17:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2021-05-02 13:17:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.375) internal successors, (88), 65 states have internal predecessors, (88), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-02 13:17:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2021-05-02 13:17:57,255 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 27 [2021-05-02 13:17:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:17:57,255 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2021-05-02 13:17:57,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 13:17:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2021-05-02 13:17:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 13:17:57,256 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:17:57,256 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:17:57,472 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:17:57,473 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:17:57,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:17:57,473 INFO L82 PathProgramCache]: Analyzing trace with hash 829847155, now seen corresponding path program 1 times [2021-05-02 13:17:57,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:17:57,473 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881833914] [2021-05-02 13:17:57,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:17:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:57,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:17:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:57,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:17:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:57,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-05-02 13:17:57,540 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:17:57,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881833914] [2021-05-02 13:17:57,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881833914] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:17:57,541 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:17:57,541 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 13:17:57,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558482167] [2021-05-02 13:17:57,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 13:17:57,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:17:57,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 13:17:57,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 13:17:57,542 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 13:17:57,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:17:57,606 INFO L93 Difference]: Finished difference Result 161 states and 220 transitions. [2021-05-02 13:17:57,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 13:17:57,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2021-05-02 13:17:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:17:57,607 INFO L225 Difference]: With dead ends: 161 [2021-05-02 13:17:57,608 INFO L226 Difference]: Without dead ends: 97 [2021-05-02 13:17:57,608 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 13:17:57,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-02 13:17:57,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2021-05-02 13:17:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-02 13:17:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2021-05-02 13:17:57,618 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 27 [2021-05-02 13:17:57,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:17:57,618 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2021-05-02 13:17:57,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 13:17:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2021-05-02 13:17:57,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-02 13:17:57,619 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:17:57,619 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:17:57,619 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 13:17:57,620 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:17:57,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:17:57,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1640504642, now seen corresponding path program 1 times [2021-05-02 13:17:57,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:17:57,636 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534658869] [2021-05-02 13:17:57,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:17:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:57,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:17:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:57,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:17:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:17:57,727 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:17:57,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534658869] [2021-05-02 13:17:57,727 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534658869] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:17:57,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570501461] [2021-05-02 13:17:57,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:17:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:57,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core [2021-05-02 13:17:57,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:17:57,804 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:57,807 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:57,831 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:57,834 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:57,848 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:17:57,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570501461] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:17:57,859 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:17:57,859 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-05-02 13:17:57,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381863374] [2021-05-02 13:17:57,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 13:17:57,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:17:57,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 13:17:57,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-02 13:17:57,861 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:17:57,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:17:57,985 INFO L93 Difference]: Finished difference Result 191 states and 259 transitions. [2021-05-02 13:17:57,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 13:17:57,986 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2021-05-02 13:17:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:17:57,987 INFO L225 Difference]: With dead ends: 191 [2021-05-02 13:17:57,987 INFO L226 Difference]: Without dead ends: 117 [2021-05-02 13:17:57,990 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 76.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-05-02 13:17:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-05-02 13:17:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2021-05-02 13:17:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 92 states have (on average 1.326086956521739) internal successors, (122), 93 states have internal predecessors, (122), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-02 13:17:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2021-05-02 13:17:58,009 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 28 [2021-05-02 13:17:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:17:58,009 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2021-05-02 13:17:58,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:17:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2021-05-02 13:17:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-02 13:17:58,010 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:17:58,010 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:17:58,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:17:58,217 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:17:58,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:17:58,217 INFO L82 PathProgramCache]: Analyzing trace with hash 942246269, now seen corresponding path program 2 times [2021-05-02 13:17:58,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:17:58,218 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853785474] [2021-05-02 13:17:58,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:17:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:58,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:17:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:58,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:17:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:17:58,292 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:17:58,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853785474] [2021-05-02 13:17:58,293 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853785474] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:17:58,293 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799129982] [2021-05-02 13:17:58,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:17:58,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 13:17:58,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:17:58,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2021-05-02 13:17:58,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:17:58,375 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:58,377 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:58,386 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:58,399 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-05-02 13:17:58,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799129982] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:17:58,418 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:17:58,418 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2021-05-02 13:17:58,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277146464] [2021-05-02 13:17:58,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 13:17:58,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:17:58,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 13:17:58,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-05-02 13:17:58,419 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-02 13:17:58,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:17:58,901 INFO L93 Difference]: Finished difference Result 317 states and 430 transitions. [2021-05-02 13:17:58,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-02 13:17:58,901 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-05-02 13:17:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:17:58,902 INFO L225 Difference]: With dead ends: 317 [2021-05-02 13:17:58,902 INFO L226 Difference]: Without dead ends: 225 [2021-05-02 13:17:58,903 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 353.8ms TimeCoverageRelationStatistics Valid=320, Invalid=940, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 13:17:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-05-02 13:17:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 172. [2021-05-02 13:17:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 157 states have (on average 1.305732484076433) internal successors, (205), 158 states have internal predecessors, (205), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-02 13:17:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 222 transitions. [2021-05-02 13:17:58,912 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 222 transitions. Word has length 31 [2021-05-02 13:17:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:17:58,913 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 222 transitions. [2021-05-02 13:17:58,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-02 13:17:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 222 transitions. [2021-05-02 13:17:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-02 13:17:58,913 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:17:58,913 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:17:59,129 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:17:59,129 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:17:59,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:17:59,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1473818596, now seen corresponding path program 1 times [2021-05-02 13:17:59,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:17:59,130 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081121025] [2021-05-02 13:17:59,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:17:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:59,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:17:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:59,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:17:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:17:59,197 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:17:59,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081121025] [2021-05-02 13:17:59,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081121025] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:17:59,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127525592] [2021-05-02 13:17:59,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:17:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:59,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-02 13:17:59,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:17:59,275 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,278 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,292 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,293 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,309 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,311 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,324 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,326 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:17:59,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127525592] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:17:59,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:17:59,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-05-02 13:17:59,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506973993] [2021-05-02 13:17:59,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 13:17:59,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:17:59,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 13:17:59,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2021-05-02 13:17:59,348 INFO L87 Difference]: Start difference. First operand 172 states and 222 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:17:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:17:59,487 INFO L93 Difference]: Finished difference Result 371 states and 487 transitions. [2021-05-02 13:17:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 13:17:59,488 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2021-05-02 13:17:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:17:59,489 INFO L225 Difference]: With dead ends: 371 [2021-05-02 13:17:59,489 INFO L226 Difference]: Without dead ends: 211 [2021-05-02 13:17:59,490 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 96.0ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-05-02 13:17:59,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-05-02 13:17:59,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 192. [2021-05-02 13:17:59,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 177 states have (on average 1.2824858757062148) internal successors, (227), 178 states have internal predecessors, (227), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-02 13:17:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 244 transitions. [2021-05-02 13:17:59,499 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 244 transitions. Word has length 34 [2021-05-02 13:17:59,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:17:59,499 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 244 transitions. [2021-05-02 13:17:59,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:17:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 244 transitions. [2021-05-02 13:17:59,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-02 13:17:59,500 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:17:59,500 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:17:59,712 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-05-02 13:17:59,713 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:17:59,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:17:59,713 INFO L82 PathProgramCache]: Analyzing trace with hash 193637275, now seen corresponding path program 2 times [2021-05-02 13:17:59,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:17:59,713 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878422757] [2021-05-02 13:17:59,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:17:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:59,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:17:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:59,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:17:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:17:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:17:59,786 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:17:59,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878422757] [2021-05-02 13:17:59,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878422757] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:17:59,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673036183] [2021-05-02 13:17:59,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:17:59,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 13:17:59,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:17:59,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2021-05-02 13:17:59,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:17:59,861 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,862 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,880 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,886 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,900 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,903 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,917 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,920 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,934 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,935 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,948 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:17:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:17:59,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673036183] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:17:59,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:17:59,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-05-02 13:17:59,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984015030] [2021-05-02 13:17:59,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 13:17:59,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:17:59,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 13:17:59,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2021-05-02 13:17:59,959 INFO L87 Difference]: Start difference. First operand 192 states and 244 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:18:00,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:00,119 INFO L93 Difference]: Finished difference Result 419 states and 545 transitions. [2021-05-02 13:18:00,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 13:18:00,119 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2021-05-02 13:18:00,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:00,120 INFO L225 Difference]: With dead ends: 419 [2021-05-02 13:18:00,120 INFO L226 Difference]: Without dead ends: 239 [2021-05-02 13:18:00,121 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 109.4ms TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2021-05-02 13:18:00,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-05-02 13:18:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 216. [2021-05-02 13:18:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 201 states have (on average 1.2786069651741294) internal successors, (257), 202 states have internal predecessors, (257), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-02 13:18:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 274 transitions. [2021-05-02 13:18:00,129 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 274 transitions. Word has length 37 [2021-05-02 13:18:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:00,130 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 274 transitions. [2021-05-02 13:18:00,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:18:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 274 transitions. [2021-05-02 13:18:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-02 13:18:00,131 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:00,131 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:00,346 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:00,347 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:00,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:00,347 INFO L82 PathProgramCache]: Analyzing trace with hash -220255300, now seen corresponding path program 3 times [2021-05-02 13:18:00,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:00,347 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704813869] [2021-05-02 13:18:00,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:00,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:00,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:18:00,444 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:00,444 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704813869] [2021-05-02 13:18:00,445 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704813869] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:00,445 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336971672] [2021-05-02 13:18:00,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:00,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-02 13:18:00,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:00,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-02 13:18:00,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:00,554 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-05-02 13:18:00,577 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336971672] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:18:00,577 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-02 13:18:00,577 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2021-05-02 13:18:00,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640527147] [2021-05-02 13:18:00,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 13:18:00,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:00,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 13:18:00,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-05-02 13:18:00,579 INFO L87 Difference]: Start difference. First operand 216 states and 274 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 13:18:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:00,625 INFO L93 Difference]: Finished difference Result 301 states and 377 transitions. [2021-05-02 13:18:00,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 13:18:00,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2021-05-02 13:18:00,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:00,626 INFO L225 Difference]: With dead ends: 301 [2021-05-02 13:18:00,626 INFO L226 Difference]: Without dead ends: 211 [2021-05-02 13:18:00,626 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 102.1ms TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-05-02 13:18:00,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-05-02 13:18:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2021-05-02 13:18:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 195 states have (on average 1.2564102564102564) internal successors, (245), 196 states have internal predecessors, (245), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-02 13:18:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 262 transitions. [2021-05-02 13:18:00,634 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 262 transitions. Word has length 40 [2021-05-02 13:18:00,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:00,635 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 262 transitions. [2021-05-02 13:18:00,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 13:18:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 262 transitions. [2021-05-02 13:18:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-02 13:18:00,635 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:00,635 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:00,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:00,853 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:00,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:00,854 INFO L82 PathProgramCache]: Analyzing trace with hash -158215686, now seen corresponding path program 1 times [2021-05-02 13:18:00,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:00,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708911423] [2021-05-02 13:18:00,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:00,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:00,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:18:00,930 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:00,930 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708911423] [2021-05-02 13:18:00,930 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708911423] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:00,930 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300454404] [2021-05-02 13:18:00,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:00,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjunts are in the unsatisfiable core [2021-05-02 13:18:00,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:01,006 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,021 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,023 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,035 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,051 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,053 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,068 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,071 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,086 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,088 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:18:01,109 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300454404] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:01,109 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:01,109 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-05-02 13:18:01,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192792117] [2021-05-02 13:18:01,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-02 13:18:01,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:01,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-02 13:18:01,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2021-05-02 13:18:01,110 INFO L87 Difference]: Start difference. First operand 210 states and 262 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:18:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:01,324 INFO L93 Difference]: Finished difference Result 455 states and 581 transitions. [2021-05-02 13:18:01,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 13:18:01,325 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2021-05-02 13:18:01,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:01,326 INFO L225 Difference]: With dead ends: 455 [2021-05-02 13:18:01,326 INFO L226 Difference]: Without dead ends: 257 [2021-05-02 13:18:01,327 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 125.4ms TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2021-05-02 13:18:01,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-05-02 13:18:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 234. [2021-05-02 13:18:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 219 states have (on average 1.2557077625570776) internal successors, (275), 220 states have internal predecessors, (275), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-02 13:18:01,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 292 transitions. [2021-05-02 13:18:01,338 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 292 transitions. Word has length 40 [2021-05-02 13:18:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:01,338 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 292 transitions. [2021-05-02 13:18:01,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:18:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 292 transitions. [2021-05-02 13:18:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-02 13:18:01,339 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:01,339 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:01,549 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-05-02 13:18:01,549 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:01,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:01,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1743353085, now seen corresponding path program 2 times [2021-05-02 13:18:01,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:01,550 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836006688] [2021-05-02 13:18:01,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:01,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:01,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:18:01,662 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:01,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836006688] [2021-05-02 13:18:01,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836006688] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:01,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606686713] [2021-05-02 13:18:01,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:01,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 13:18:01,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:01,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2021-05-02 13:18:01,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:01,740 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,741 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,754 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,755 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,769 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,770 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,784 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,787 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,802 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,804 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,822 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,838 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,839 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,871 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:18:01,882 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606686713] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:01,882 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:01,883 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-05-02 13:18:01,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243935618] [2021-05-02 13:18:01,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-02 13:18:01,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:01,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-02 13:18:01,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2021-05-02 13:18:01,884 INFO L87 Difference]: Start difference. First operand 234 states and 292 transitions. Second operand has 20 states, 20 states have (on average 3.2) internal successors, (64), 19 states have internal predecessors, (64), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:18:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:02,054 INFO L93 Difference]: Finished difference Result 503 states and 641 transitions. [2021-05-02 13:18:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 13:18:02,054 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 19 states have internal predecessors, (64), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2021-05-02 13:18:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:02,056 INFO L225 Difference]: With dead ends: 503 [2021-05-02 13:18:02,056 INFO L226 Difference]: Without dead ends: 281 [2021-05-02 13:18:02,057 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 155.8ms TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2021-05-02 13:18:02,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-05-02 13:18:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 258. [2021-05-02 13:18:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 243 states have (on average 1.2551440329218106) internal successors, (305), 244 states have internal predecessors, (305), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-02 13:18:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 322 transitions. [2021-05-02 13:18:02,068 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 322 transitions. Word has length 43 [2021-05-02 13:18:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:02,068 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 322 transitions. [2021-05-02 13:18:02,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 19 states have internal predecessors, (64), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:18:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 322 transitions. [2021-05-02 13:18:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-02 13:18:02,069 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:02,069 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:02,285 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:02,285 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:02,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:02,285 INFO L82 PathProgramCache]: Analyzing trace with hash 759975706, now seen corresponding path program 3 times [2021-05-02 13:18:02,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:02,286 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261391796] [2021-05-02 13:18:02,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:02,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:02,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:18:02,401 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:02,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261391796] [2021-05-02 13:18:02,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261391796] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:02,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713537546] [2021-05-02 13:18:02,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:02,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-02 13:18:02,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:02,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2021-05-02 13:18:02,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:02,523 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:02,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:02,574 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:02,576 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:02,583 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-05-02 13:18:02,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713537546] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:18:02,609 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-02 13:18:02,609 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2021-05-02 13:18:02,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689579412] [2021-05-02 13:18:02,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 13:18:02,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:02,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 13:18:02,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2021-05-02 13:18:02,610 INFO L87 Difference]: Start difference. First operand 258 states and 322 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 13:18:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:02,689 INFO L93 Difference]: Finished difference Result 341 states and 421 transitions. [2021-05-02 13:18:02,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 13:18:02,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2021-05-02 13:18:02,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:02,690 INFO L225 Difference]: With dead ends: 341 [2021-05-02 13:18:02,690 INFO L226 Difference]: Without dead ends: 339 [2021-05-02 13:18:02,692 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 153.3ms TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2021-05-02 13:18:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-05-02 13:18:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2021-05-02 13:18:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 313 states have (on average 1.2396166134185302) internal successors, (388), 317 states have internal predecessors, (388), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-02 13:18:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 413 transitions. [2021-05-02 13:18:02,704 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 413 transitions. Word has length 46 [2021-05-02 13:18:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:02,705 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 413 transitions. [2021-05-02 13:18:02,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 13:18:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 413 transitions. [2021-05-02 13:18:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-02 13:18:02,705 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:02,705 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:02,923 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-05-02 13:18:02,923 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:02,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:02,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2089980700, now seen corresponding path program 1 times [2021-05-02 13:18:02,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:02,923 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263896778] [2021-05-02 13:18:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:03,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:03,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:18:03,022 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:03,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263896778] [2021-05-02 13:18:03,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263896778] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:03,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020500818] [2021-05-02 13:18:03,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:03,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjunts are in the unsatisfiable core [2021-05-02 13:18:03,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:03,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,115 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,117 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,135 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,153 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,169 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,171 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,187 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,188 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,205 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,206 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,224 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,225 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:18:03,286 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020500818] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:03,286 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:03,286 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2021-05-02 13:18:03,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343469844] [2021-05-02 13:18:03,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-02 13:18:03,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:03,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-02 13:18:03,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2021-05-02 13:18:03,288 INFO L87 Difference]: Start difference. First operand 335 states and 413 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:18:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:03,832 INFO L93 Difference]: Finished difference Result 771 states and 971 transitions. [2021-05-02 13:18:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-02 13:18:03,833 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2021-05-02 13:18:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:03,836 INFO L225 Difference]: With dead ends: 771 [2021-05-02 13:18:03,836 INFO L226 Difference]: Without dead ends: 496 [2021-05-02 13:18:03,838 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 426.2ms TimeCoverageRelationStatistics Valid=431, Invalid=1209, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 13:18:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-05-02 13:18:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 451. [2021-05-02 13:18:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 424 states have (on average 1.2429245283018868) internal successors, (527), 429 states have internal predecessors, (527), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2021-05-02 13:18:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 558 transitions. [2021-05-02 13:18:03,859 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 558 transitions. Word has length 46 [2021-05-02 13:18:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:03,859 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 558 transitions. [2021-05-02 13:18:03,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:18:03,859 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 558 transitions. [2021-05-02 13:18:03,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-02 13:18:03,859 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:03,859 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:04,073 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-05-02 13:18:04,073 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:04,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:04,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1753798755, now seen corresponding path program 2 times [2021-05-02 13:18:04,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:04,074 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117856284] [2021-05-02 13:18:04,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:04,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:04,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:18:04,200 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:04,200 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117856284] [2021-05-02 13:18:04,200 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117856284] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:04,200 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986283262] [2021-05-02 13:18:04,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:04,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 13:18:04,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:04,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2021-05-02 13:18:04,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:04,304 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,319 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,320 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,335 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,351 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,353 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,370 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,371 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,389 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,390 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,420 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,421 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,447 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,449 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,470 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,488 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,505 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:18:04,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986283262] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:04,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:04,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-05-02 13:18:04,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138060806] [2021-05-02 13:18:04,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 13:18:04,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:04,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 13:18:04,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2021-05-02 13:18:04,516 INFO L87 Difference]: Start difference. First operand 451 states and 558 transitions. Second operand has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 states have internal predecessors, (77), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:18:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:04,930 INFO L93 Difference]: Finished difference Result 924 states and 1156 transitions. [2021-05-02 13:18:04,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-02 13:18:04,931 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 states have internal predecessors, (77), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2021-05-02 13:18:04,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:04,938 INFO L225 Difference]: With dead ends: 924 [2021-05-02 13:18:04,938 INFO L226 Difference]: Without dead ends: 652 [2021-05-02 13:18:04,940 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 345.5ms TimeCoverageRelationStatistics Valid=376, Invalid=1030, Unknown=0, NotChecked=0, Total=1406 [2021-05-02 13:18:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2021-05-02 13:18:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 458. [2021-05-02 13:18:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 431 states have (on average 1.2552204176334107) internal successors, (541), 436 states have internal predecessors, (541), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2021-05-02 13:18:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 572 transitions. [2021-05-02 13:18:04,975 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 572 transitions. Word has length 49 [2021-05-02 13:18:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:04,975 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 572 transitions. [2021-05-02 13:18:04,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 states have internal predecessors, (77), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 13:18:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 572 transitions. [2021-05-02 13:18:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-02 13:18:04,976 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:04,976 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:05,189 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-05-02 13:18:05,189 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:05,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:05,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1921186147, now seen corresponding path program 1 times [2021-05-02 13:18:05,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:05,190 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97804938] [2021-05-02 13:18:05,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:05,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:05,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-05-02 13:18:05,257 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:05,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97804938] [2021-05-02 13:18:05,257 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97804938] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:18:05,257 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:18:05,258 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 13:18:05,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400695234] [2021-05-02 13:18:05,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 13:18:05,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:05,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 13:18:05,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 13:18:05,259 INFO L87 Difference]: Start difference. First operand 458 states and 572 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 13:18:05,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:05,374 INFO L93 Difference]: Finished difference Result 808 states and 1023 transitions. [2021-05-02 13:18:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 13:18:05,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-02 13:18:05,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:05,378 INFO L225 Difference]: With dead ends: 808 [2021-05-02 13:18:05,378 INFO L226 Difference]: Without dead ends: 624 [2021-05-02 13:18:05,379 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 55.5ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-05-02 13:18:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2021-05-02 13:18:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 493. [2021-05-02 13:18:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 465 states have (on average 1.2580645161290323) internal successors, (585), 470 states have internal predecessors, (585), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-02 13:18:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 618 transitions. [2021-05-02 13:18:05,401 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 618 transitions. Word has length 49 [2021-05-02 13:18:05,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:05,401 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 618 transitions. [2021-05-02 13:18:05,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 13:18:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 618 transitions. [2021-05-02 13:18:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-02 13:18:05,402 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:05,402 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:05,402 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 13:18:05,402 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:05,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:05,402 INFO L82 PathProgramCache]: Analyzing trace with hash 630503292, now seen corresponding path program 3 times [2021-05-02 13:18:05,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:05,402 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578214517] [2021-05-02 13:18:05,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:05,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:05,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:18:05,537 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:05,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578214517] [2021-05-02 13:18:05,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578214517] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:05,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293613532] [2021-05-02 13:18:05,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:05,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-02 13:18:05,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:05,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2021-05-02 13:18:05,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:05,690 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:05,729 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:05,753 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:05,754 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:05,757 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:05,788 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-05-02 13:18:05,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293613532] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:18:05,788 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-02 13:18:05,788 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2021-05-02 13:18:05,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551555310] [2021-05-02 13:18:05,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 13:18:05,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:05,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 13:18:05,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2021-05-02 13:18:05,789 INFO L87 Difference]: Start difference. First operand 493 states and 618 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 13:18:05,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:05,880 INFO L93 Difference]: Finished difference Result 504 states and 629 transitions. [2021-05-02 13:18:05,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 13:18:05,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2021-05-02 13:18:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:05,882 INFO L225 Difference]: With dead ends: 504 [2021-05-02 13:18:05,883 INFO L226 Difference]: Without dead ends: 502 [2021-05-02 13:18:05,883 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 211.5ms TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2021-05-02 13:18:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-05-02 13:18:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 493. [2021-05-02 13:18:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 465 states have (on average 1.2580645161290323) internal successors, (585), 470 states have internal predecessors, (585), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-02 13:18:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 618 transitions. [2021-05-02 13:18:05,906 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 618 transitions. Word has length 52 [2021-05-02 13:18:05,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:05,906 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 618 transitions. [2021-05-02 13:18:05,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 13:18:05,906 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 618 transitions. [2021-05-02 13:18:05,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-02 13:18:05,907 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:05,907 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:06,121 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-05-02 13:18:06,121 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:06,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:06,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1644049929, now seen corresponding path program 1 times [2021-05-02 13:18:06,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:06,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442104771] [2021-05-02 13:18:06,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:06,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:06,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:06,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-05-02 13:18:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 265 proven. 117 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-05-02 13:18:06,257 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:06,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442104771] [2021-05-02 13:18:06,257 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442104771] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:06,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223172019] [2021-05-02 13:18:06,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:06,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2021-05-02 13:18:06,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:06,338 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,339 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,351 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,352 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,366 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,381 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,395 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,396 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,411 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,421 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,440 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,441 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,459 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,479 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,494 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 263 proven. 117 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-05-02 13:18:06,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223172019] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:06,541 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:06,541 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2021-05-02 13:18:06,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835622892] [2021-05-02 13:18:06,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 13:18:06,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:06,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 13:18:06,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2021-05-02 13:18:06,542 INFO L87 Difference]: Start difference. First operand 493 states and 618 transitions. Second operand has 24 states, 24 states have (on average 3.625) internal successors, (87), 23 states have internal predecessors, (87), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-02 13:18:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:06,790 INFO L93 Difference]: Finished difference Result 964 states and 1223 transitions. [2021-05-02 13:18:06,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 13:18:06,790 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 23 states have internal predecessors, (87), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 87 [2021-05-02 13:18:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:06,793 INFO L225 Difference]: With dead ends: 964 [2021-05-02 13:18:06,793 INFO L226 Difference]: Without dead ends: 559 [2021-05-02 13:18:06,794 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 215.1ms TimeCoverageRelationStatistics Valid=214, Invalid=386, Unknown=0, NotChecked=0, Total=600 [2021-05-02 13:18:06,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-05-02 13:18:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 524. [2021-05-02 13:18:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 496 states have (on average 1.2459677419354838) internal successors, (618), 501 states have internal predecessors, (618), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-02 13:18:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 651 transitions. [2021-05-02 13:18:06,820 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 651 transitions. Word has length 87 [2021-05-02 13:18:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:06,820 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 651 transitions. [2021-05-02 13:18:06,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 23 states have internal predecessors, (87), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-02 13:18:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 651 transitions. [2021-05-02 13:18:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-02 13:18:06,821 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:06,821 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:07,037 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:07,037 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:07,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:07,037 INFO L82 PathProgramCache]: Analyzing trace with hash -218145757, now seen corresponding path program 2 times [2021-05-02 13:18:07,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:07,038 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357447182] [2021-05-02 13:18:07,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:07,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:07,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:07,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-02 13:18:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 324 proven. 145 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-05-02 13:18:07,185 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:07,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357447182] [2021-05-02 13:18:07,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357447182] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:07,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625982048] [2021-05-02 13:18:07,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:07,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 13:18:07,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:07,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjunts are in the unsatisfiable core [2021-05-02 13:18:07,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:07,381 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,383 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,399 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,400 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,416 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,434 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,436 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,455 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,456 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,475 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,495 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,497 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,516 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,518 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,540 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,586 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 322 proven. 145 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-05-02 13:18:07,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625982048] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:07,668 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:07,668 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-05-02 13:18:07,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764824899] [2021-05-02 13:18:07,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 13:18:07,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:07,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 13:18:07,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2021-05-02 13:18:07,671 INFO L87 Difference]: Start difference. First operand 524 states and 651 transitions. Second operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-02 13:18:07,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:07,836 INFO L93 Difference]: Finished difference Result 1052 states and 1329 transitions. [2021-05-02 13:18:07,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 13:18:07,836 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 93 [2021-05-02 13:18:07,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:07,839 INFO L225 Difference]: With dead ends: 1052 [2021-05-02 13:18:07,839 INFO L226 Difference]: Without dead ends: 612 [2021-05-02 13:18:07,840 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 261.0ms TimeCoverageRelationStatistics Valid=251, Invalid=451, Unknown=0, NotChecked=0, Total=702 [2021-05-02 13:18:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-05-02 13:18:07,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 569. [2021-05-02 13:18:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 541 states have (on average 1.243992606284658) internal successors, (673), 546 states have internal predecessors, (673), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-02 13:18:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 706 transitions. [2021-05-02 13:18:07,861 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 706 transitions. Word has length 93 [2021-05-02 13:18:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:07,861 INFO L480 AbstractCegarLoop]: Abstraction has 569 states and 706 transitions. [2021-05-02 13:18:07,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-02 13:18:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 706 transitions. [2021-05-02 13:18:07,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-05-02 13:18:07,862 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:07,862 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:08,072 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-05-02 13:18:08,073 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash -369554377, now seen corresponding path program 3 times [2021-05-02 13:18:08,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:08,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752774694] [2021-05-02 13:18:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:08,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:08,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:08,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-05-02 13:18:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 389 proven. 176 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-05-02 13:18:08,199 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:08,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752774694] [2021-05-02 13:18:08,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752774694] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:08,200 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101659043] [2021-05-02 13:18:08,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:08,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-02 13:18:08,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:08,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 18 conjunts are in the unsatisfiable core [2021-05-02 13:18:08,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:08,412 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:08,413 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:08,478 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:08,480 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:08,487 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:08,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 33 proven. 392 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2021-05-02 13:18:08,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101659043] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:08,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:08,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 24 [2021-05-02 13:18:08,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078292790] [2021-05-02 13:18:08,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 13:18:08,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:08,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 13:18:08,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-05-02 13:18:08,515 INFO L87 Difference]: Start difference. First operand 569 states and 706 transitions. Second operand has 24 states, 24 states have (on average 3.625) internal successors, (87), 22 states have internal predecessors, (87), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-02 13:18:09,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:09,744 INFO L93 Difference]: Finished difference Result 1459 states and 1848 transitions. [2021-05-02 13:18:09,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-02 13:18:09,745 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 22 states have internal predecessors, (87), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 99 [2021-05-02 13:18:09,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:09,748 INFO L225 Difference]: With dead ends: 1459 [2021-05-02 13:18:09,748 INFO L226 Difference]: Without dead ends: 973 [2021-05-02 13:18:09,750 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 936.9ms TimeCoverageRelationStatistics Valid=944, Invalid=3612, Unknown=0, NotChecked=0, Total=4556 [2021-05-02 13:18:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-05-02 13:18:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 916. [2021-05-02 13:18:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 877 states have (on average 1.242873432155074) internal successors, (1090), 884 states have internal predecessors, (1090), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (23), 16 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-02 13:18:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1137 transitions. [2021-05-02 13:18:09,779 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1137 transitions. Word has length 99 [2021-05-02 13:18:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:09,779 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1137 transitions. [2021-05-02 13:18:09,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 3.625) internal successors, (87), 22 states have internal predecessors, (87), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-02 13:18:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1137 transitions. [2021-05-02 13:18:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-02 13:18:09,780 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:09,780 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 12, 12, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:09,996 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:09,996 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:09,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:09,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1533593249, now seen corresponding path program 1 times [2021-05-02 13:18:09,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:09,997 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556863577] [2021-05-02 13:18:09,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:10,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:10,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:10,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-05-02 13:18:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 44 proven. 630 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2021-05-02 13:18:10,159 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:10,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556863577] [2021-05-02 13:18:10,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556863577] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:10,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502471727] [2021-05-02 13:18:10,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:10,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 15 conjunts are in the unsatisfiable core [2021-05-02 13:18:10,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:10,246 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,247 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,259 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,259 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,271 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,272 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,285 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,285 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,298 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,299 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,314 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,315 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,329 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,330 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,345 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,346 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,363 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,364 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,397 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,398 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,416 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,436 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,437 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 458 proven. 210 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2021-05-02 13:18:10,498 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502471727] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:10,498 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:10,498 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2021-05-02 13:18:10,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567935888] [2021-05-02 13:18:10,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-02 13:18:10,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:10,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-02 13:18:10,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=540, Unknown=0, NotChecked=0, Total=870 [2021-05-02 13:18:10,499 INFO L87 Difference]: Start difference. First operand 916 states and 1137 transitions. Second operand has 30 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 29 states have internal predecessors, (116), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-02 13:18:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:10,668 INFO L93 Difference]: Finished difference Result 1850 states and 2319 transitions. [2021-05-02 13:18:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-02 13:18:10,669 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 29 states have internal predecessors, (116), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 105 [2021-05-02 13:18:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:10,671 INFO L225 Difference]: With dead ends: 1850 [2021-05-02 13:18:10,671 INFO L226 Difference]: Without dead ends: 1026 [2021-05-02 13:18:10,673 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 280.5ms TimeCoverageRelationStatistics Valid=334, Invalid=596, Unknown=0, NotChecked=0, Total=930 [2021-05-02 13:18:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2021-05-02 13:18:10,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 964. [2021-05-02 13:18:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 925 states have (on average 1.241081081081081) internal successors, (1148), 932 states have internal predecessors, (1148), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (23), 16 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-02 13:18:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1195 transitions. [2021-05-02 13:18:10,702 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1195 transitions. Word has length 105 [2021-05-02 13:18:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:10,703 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1195 transitions. [2021-05-02 13:18:10,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 29 states have internal predecessors, (116), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-02 13:18:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1195 transitions. [2021-05-02 13:18:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-02 13:18:10,704 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:10,704 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 13, 13, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:10,908 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-05-02 13:18:10,909 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:10,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1379214263, now seen corresponding path program 2 times [2021-05-02 13:18:10,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:10,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571873054] [2021-05-02 13:18:10,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:11,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:11,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:11,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-05-02 13:18:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 47 proven. 741 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2021-05-02 13:18:11,065 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:11,065 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571873054] [2021-05-02 13:18:11,065 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571873054] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:11,065 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543566154] [2021-05-02 13:18:11,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:11,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 13:18:11,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:11,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjunts are in the unsatisfiable core [2021-05-02 13:18:11,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:11,152 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,153 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,165 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,191 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,192 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,205 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,206 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,220 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,221 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,236 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,252 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,253 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,270 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,271 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,291 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,292 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,311 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,312 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,332 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,333 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,355 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,357 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,379 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 535 proven. 247 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2021-05-02 13:18:11,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543566154] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:11,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:11,453 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2021-05-02 13:18:11,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320000268] [2021-05-02 13:18:11,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 13:18:11,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:11,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 13:18:11,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=616, Unknown=0, NotChecked=0, Total=992 [2021-05-02 13:18:11,454 INFO L87 Difference]: Start difference. First operand 964 states and 1195 transitions. Second operand has 32 states, 32 states have (on average 3.8125) internal successors, (122), 31 states have internal predecessors, (122), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-02 13:18:11,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:11,759 INFO L93 Difference]: Finished difference Result 1960 states and 2460 transitions. [2021-05-02 13:18:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-02 13:18:11,765 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.8125) internal successors, (122), 31 states have internal predecessors, (122), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 111 [2021-05-02 13:18:11,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:11,767 INFO L225 Difference]: With dead ends: 1960 [2021-05-02 13:18:11,768 INFO L226 Difference]: Without dead ends: 1097 [2021-05-02 13:18:11,769 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 300.4ms TimeCoverageRelationStatistics Valid=380, Invalid=676, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 13:18:11,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2021-05-02 13:18:11,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1033. [2021-05-02 13:18:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 994 states have (on average 1.2394366197183098) internal successors, (1232), 1001 states have internal predecessors, (1232), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (23), 16 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-02 13:18:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1279 transitions. [2021-05-02 13:18:11,798 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1279 transitions. Word has length 111 [2021-05-02 13:18:11,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:11,798 INFO L480 AbstractCegarLoop]: Abstraction has 1033 states and 1279 transitions. [2021-05-02 13:18:11,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 3.8125) internal successors, (122), 31 states have internal predecessors, (122), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-02 13:18:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1279 transitions. [2021-05-02 13:18:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-05-02 13:18:11,799 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:11,799 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 14, 14, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:12,016 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-05-02 13:18:12,016 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash 344085025, now seen corresponding path program 3 times [2021-05-02 13:18:12,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:12,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403839466] [2021-05-02 13:18:12,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:12,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:12,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:12,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-05-02 13:18:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 50 proven. 861 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2021-05-02 13:18:12,193 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:12,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403839466] [2021-05-02 13:18:12,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403839466] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:12,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427612586] [2021-05-02 13:18:12,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:12,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-02 13:18:12,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:12,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-02 13:18:12,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:12,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:12,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:12,529 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:12,531 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:12,533 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 42 proven. 623 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2021-05-02 13:18:12,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427612586] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:12,572 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:12,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 27 [2021-05-02 13:18:12,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838157147] [2021-05-02 13:18:12,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-02 13:18:12,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:12,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-02 13:18:12,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-05-02 13:18:12,573 INFO L87 Difference]: Start difference. First operand 1033 states and 1279 transitions. Second operand has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 25 states have internal predecessors, (100), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 13:18:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:14,060 INFO L93 Difference]: Finished difference Result 2240 states and 2800 transitions. [2021-05-02 13:18:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-02 13:18:14,061 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 25 states have internal predecessors, (100), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 117 [2021-05-02 13:18:14,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:14,064 INFO L225 Difference]: With dead ends: 2240 [2021-05-02 13:18:14,064 INFO L226 Difference]: Without dead ends: 1317 [2021-05-02 13:18:14,067 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1726 ImplicationChecksByTransitivity, 1201.9ms TimeCoverageRelationStatistics Valid=1364, Invalid=4956, Unknown=0, NotChecked=0, Total=6320 [2021-05-02 13:18:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2021-05-02 13:18:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1138. [2021-05-02 13:18:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1099 states have (on average 1.2383985441310281) internal successors, (1361), 1105 states have internal predecessors, (1361), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-02 13:18:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1408 transitions. [2021-05-02 13:18:14,099 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1408 transitions. Word has length 117 [2021-05-02 13:18:14,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:14,099 INFO L480 AbstractCegarLoop]: Abstraction has 1138 states and 1408 transitions. [2021-05-02 13:18:14,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 25 states have internal predecessors, (100), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 13:18:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1408 transitions. [2021-05-02 13:18:14,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-02 13:18:14,101 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:14,101 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 28, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:14,306 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-05-02 13:18:14,306 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:14,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:14,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1102713973, now seen corresponding path program 4 times [2021-05-02 13:18:14,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:14,307 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365635709] [2021-05-02 13:18:14,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:14,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:14,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:14,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-05-02 13:18:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 709 proven. 330 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2021-05-02 13:18:14,492 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:14,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365635709] [2021-05-02 13:18:14,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365635709] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:14,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544140139] [2021-05-02 13:18:14,492 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:14,560 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 13:18:14,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:14,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 53 conjunts are in the unsatisfiable core [2021-05-02 13:18:14,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:14,614 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,615 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,633 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,634 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,653 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,654 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,673 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,674 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,728 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,729 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,751 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,752 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,775 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,776 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,799 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,800 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,825 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,826 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,851 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,852 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,877 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,878 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,905 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,906 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,934 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:14,964 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,068 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,077 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,124 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,125 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,149 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,150 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,174 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,175 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,200 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,201 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,227 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,228 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,256 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,257 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,283 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,284 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,312 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,314 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,344 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,345 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,375 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,376 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,406 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,406 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,437 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,438 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,470 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,559 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,561 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,561 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,564 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,568 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,582 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 287 proven. 1087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:18:15,631 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544140139] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:15,631 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:15,631 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 41] total 59 [2021-05-02 13:18:15,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596601205] [2021-05-02 13:18:15,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-05-02 13:18:15,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:15,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-05-02 13:18:15,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=2839, Unknown=0, NotChecked=0, Total=3422 [2021-05-02 13:18:15,633 INFO L87 Difference]: Start difference. First operand 1138 states and 1408 transitions. Second operand has 59 states, 59 states have (on average 3.0847457627118646) internal successors, (182), 57 states have internal predecessors, (182), 5 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-02 13:18:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:17,534 INFO L93 Difference]: Finished difference Result 2381 states and 2969 transitions. [2021-05-02 13:18:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-02 13:18:17,536 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 3.0847457627118646) internal successors, (182), 57 states have internal predecessors, (182), 5 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 123 [2021-05-02 13:18:17,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:17,540 INFO L225 Difference]: With dead ends: 2381 [2021-05-02 13:18:17,540 INFO L226 Difference]: Without dead ends: 1362 [2021-05-02 13:18:17,545 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3833 ImplicationChecksByTransitivity, 1901.6ms TimeCoverageRelationStatistics Valid=2042, Invalid=9730, Unknown=0, NotChecked=0, Total=11772 [2021-05-02 13:18:17,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2021-05-02 13:18:17,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1167. [2021-05-02 13:18:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1129 states have (on average 1.237378210806023) internal successors, (1397), 1135 states have internal predecessors, (1397), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (22), 16 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-02 13:18:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1442 transitions. [2021-05-02 13:18:17,608 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1442 transitions. Word has length 123 [2021-05-02 13:18:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:17,609 INFO L480 AbstractCegarLoop]: Abstraction has 1167 states and 1442 transitions. [2021-05-02 13:18:17,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 59 states, 59 states have (on average 3.0847457627118646) internal successors, (182), 57 states have internal predecessors, (182), 5 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-05-02 13:18:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1442 transitions. [2021-05-02 13:18:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-05-02 13:18:17,611 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:17,611 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:17,824 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:17,825 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:17,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:17,825 INFO L82 PathProgramCache]: Analyzing trace with hash -436572509, now seen corresponding path program 1 times [2021-05-02 13:18:17,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:17,825 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518632046] [2021-05-02 13:18:17,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:18,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:18,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:18,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-05-02 13:18:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 805 proven. 376 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-05-02 13:18:18,032 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:18,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518632046] [2021-05-02 13:18:18,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518632046] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:18,033 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595634396] [2021-05-02 13:18:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:18,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjunts are in the unsatisfiable core [2021-05-02 13:18:18,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:18,118 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,120 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,147 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,148 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,162 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,163 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,195 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,196 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,211 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,212 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,229 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,230 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,248 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,249 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,268 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,289 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,290 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,312 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,313 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,334 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,340 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,362 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,363 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,386 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,387 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,414 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,415 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,438 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 802 proven. 376 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2021-05-02 13:18:18,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595634396] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:18,496 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:18,496 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2021-05-02 13:18:18,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398907527] [2021-05-02 13:18:18,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-02 13:18:18,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:18,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-02 13:18:18,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=981, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 13:18:18,497 INFO L87 Difference]: Start difference. First operand 1167 states and 1442 transitions. Second operand has 39 states, 39 states have (on average 3.3333333333333335) internal successors, (130), 38 states have internal predecessors, (130), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-02 13:18:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:19,219 INFO L93 Difference]: Finished difference Result 2565 states and 3213 transitions. [2021-05-02 13:18:19,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-02 13:18:19,219 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.3333333333333335) internal successors, (130), 38 states have internal predecessors, (130), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 129 [2021-05-02 13:18:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:19,222 INFO L225 Difference]: With dead ends: 2565 [2021-05-02 13:18:19,222 INFO L226 Difference]: Without dead ends: 1526 [2021-05-02 13:18:19,225 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 773.4ms TimeCoverageRelationStatistics Valid=1159, Invalid=3001, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 13:18:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2021-05-02 13:18:19,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1156. [2021-05-02 13:18:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1118 states have (on average 1.2531305903398926) internal successors, (1401), 1124 states have internal predecessors, (1401), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (22), 16 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-02 13:18:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1446 transitions. [2021-05-02 13:18:19,259 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1446 transitions. Word has length 129 [2021-05-02 13:18:19,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:19,260 INFO L480 AbstractCegarLoop]: Abstraction has 1156 states and 1446 transitions. [2021-05-02 13:18:19,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 3.3333333333333335) internal successors, (130), 38 states have internal predecessors, (130), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-02 13:18:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1446 transitions. [2021-05-02 13:18:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-05-02 13:18:19,261 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:19,261 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:19,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-05-02 13:18:19,476 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash -2073554825, now seen corresponding path program 2 times [2021-05-02 13:18:19,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:19,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179042379] [2021-05-02 13:18:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:19,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:19,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:19,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-05-02 13:18:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 906 proven. 425 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2021-05-02 13:18:19,716 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:19,716 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179042379] [2021-05-02 13:18:19,716 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179042379] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:19,716 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42680723] [2021-05-02 13:18:19,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:19,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 13:18:19,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:19,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-02 13:18:19,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:19,804 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,805 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,819 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,832 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,833 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,847 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,848 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,863 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,864 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,879 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,880 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,896 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,897 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,913 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,914 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,932 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,933 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,951 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,952 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,980 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:19,981 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:20,002 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:20,003 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:20,026 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:20,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:20,050 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:20,052 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:20,079 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:20,080 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:20,107 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:20,108 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:20,130 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:20,224 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:20,240 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:20,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 7 proven. 1293 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2021-05-02 13:18:20,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42680723] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:20,248 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:20,248 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2021-05-02 13:18:20,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246016126] [2021-05-02 13:18:20,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-02 13:18:20,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:20,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-02 13:18:20,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=1179, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 13:18:20,249 INFO L87 Difference]: Start difference. First operand 1156 states and 1446 transitions. Second operand has 42 states, 42 states have (on average 3.5) internal successors, (147), 41 states have internal predecessors, (147), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-02 13:18:20,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:20,954 INFO L93 Difference]: Finished difference Result 2200 states and 2758 transitions. [2021-05-02 13:18:20,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-02 13:18:20,954 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.5) internal successors, (147), 41 states have internal predecessors, (147), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 135 [2021-05-02 13:18:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:20,958 INFO L225 Difference]: With dead ends: 2200 [2021-05-02 13:18:20,958 INFO L226 Difference]: Without dead ends: 1595 [2021-05-02 13:18:20,959 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 748.9ms TimeCoverageRelationStatistics Valid=1088, Invalid=2694, Unknown=0, NotChecked=0, Total=3782 [2021-05-02 13:18:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2021-05-02 13:18:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1168. [2021-05-02 13:18:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1130 states have (on average 1.261061946902655) internal successors, (1425), 1136 states have internal predecessors, (1425), 23 states have call successors, (23), 15 states have call predecessors, (23), 14 states have return successors, (22), 16 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-02 13:18:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1470 transitions. [2021-05-02 13:18:20,994 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1470 transitions. Word has length 135 [2021-05-02 13:18:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:20,994 INFO L480 AbstractCegarLoop]: Abstraction has 1168 states and 1470 transitions. [2021-05-02 13:18:20,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 3.5) internal successors, (147), 41 states have internal predecessors, (147), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-02 13:18:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1470 transitions. [2021-05-02 13:18:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-05-02 13:18:20,995 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:20,995 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:21,210 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:21,211 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:21,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:21,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1097500153, now seen corresponding path program 1 times [2021-05-02 13:18:21,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:21,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675825010] [2021-05-02 13:18:21,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:21,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:21,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:21,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-05-02 13:18:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 3 proven. 907 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2021-05-02 13:18:21,280 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:21,280 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675825010] [2021-05-02 13:18:21,280 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675825010] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:21,280 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285289320] [2021-05-02 13:18:21,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:21,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 20 conjunts are in the unsatisfiable core [2021-05-02 13:18:21,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:21,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,381 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,395 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,396 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,414 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,435 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,437 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,455 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,475 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,492 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,510 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,511 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,530 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,531 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,550 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,551 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,570 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,571 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,591 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,592 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,612 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,615 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,646 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,669 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,670 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,694 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,717 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 903 proven. 425 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2021-05-02 13:18:21,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285289320] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:21,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:21,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 21] total 25 [2021-05-02 13:18:21,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671608610] [2021-05-02 13:18:21,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-02 13:18:21,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:21,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-02 13:18:21,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=378, Unknown=0, NotChecked=0, Total=600 [2021-05-02 13:18:21,778 INFO L87 Difference]: Start difference. First operand 1168 states and 1470 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 24 states have internal predecessors, (101), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-02 13:18:23,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:23,073 INFO L93 Difference]: Finished difference Result 2822 states and 3568 transitions. [2021-05-02 13:18:23,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-05-02 13:18:23,074 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 24 states have internal predecessors, (101), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 135 [2021-05-02 13:18:23,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:23,078 INFO L225 Difference]: With dead ends: 2822 [2021-05-02 13:18:23,078 INFO L226 Difference]: Without dead ends: 1898 [2021-05-02 13:18:23,080 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1655 ImplicationChecksByTransitivity, 1265.3ms TimeCoverageRelationStatistics Valid=2083, Invalid=4559, Unknown=0, NotChecked=0, Total=6642 [2021-05-02 13:18:23,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2021-05-02 13:18:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1274. [2021-05-02 13:18:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1235 states have (on average 1.2558704453441296) internal successors, (1551), 1241 states have internal predecessors, (1551), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-02 13:18:23,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1598 transitions. [2021-05-02 13:18:23,119 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1598 transitions. Word has length 135 [2021-05-02 13:18:23,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:23,119 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 1598 transitions. [2021-05-02 13:18:23,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 24 states have internal predecessors, (101), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-02 13:18:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1598 transitions. [2021-05-02 13:18:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-05-02 13:18:23,121 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:23,121 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:23,337 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-05-02 13:18:23,337 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:23,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2043274909, now seen corresponding path program 3 times [2021-05-02 13:18:23,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:23,338 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814150833] [2021-05-02 13:18:23,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:23,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:23,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:23,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-05-02 13:18:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 1013 proven. 477 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2021-05-02 13:18:23,576 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:23,576 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814150833] [2021-05-02 13:18:23,576 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814150833] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:23,576 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169708741] [2021-05-02 13:18:23,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:23,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-05-02 13:18:23,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:23,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 31 conjunts are in the unsatisfiable core [2021-05-02 13:18:23,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 0 proven. 1017 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2021-05-02 13:18:24,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169708741] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:24,009 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:24,009 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11] total 33 [2021-05-02 13:18:24,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013805163] [2021-05-02 13:18:24,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-02 13:18:24,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:24,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-02 13:18:24,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=826, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 13:18:24,010 INFO L87 Difference]: Start difference. First operand 1274 states and 1598 transitions. Second operand has 33 states, 33 states have (on average 3.393939393939394) internal successors, (112), 31 states have internal predecessors, (112), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-05-02 13:18:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:27,077 INFO L93 Difference]: Finished difference Result 2447 states and 3077 transitions. [2021-05-02 13:18:27,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2021-05-02 13:18:27,082 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.393939393939394) internal successors, (112), 31 states have internal predecessors, (112), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 141 [2021-05-02 13:18:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:27,087 INFO L225 Difference]: With dead ends: 2447 [2021-05-02 13:18:27,087 INFO L226 Difference]: Without dead ends: 1812 [2021-05-02 13:18:27,091 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5488 ImplicationChecksByTransitivity, 2771.6ms TimeCoverageRelationStatistics Valid=3393, Invalid=14697, Unknown=0, NotChecked=0, Total=18090 [2021-05-02 13:18:27,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2021-05-02 13:18:27,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1351. [2021-05-02 13:18:27,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1311 states have (on average 1.2540045766590389) internal successors, (1644), 1317 states have internal predecessors, (1644), 25 states have call successors, (25), 15 states have call predecessors, (25), 14 states have return successors, (24), 18 states have call predecessors, (24), 24 states have call successors, (24) [2021-05-02 13:18:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1693 transitions. [2021-05-02 13:18:27,137 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1693 transitions. Word has length 141 [2021-05-02 13:18:27,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:27,138 INFO L480 AbstractCegarLoop]: Abstraction has 1351 states and 1693 transitions. [2021-05-02 13:18:27,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 3.393939393939394) internal successors, (112), 31 states have internal predecessors, (112), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-05-02 13:18:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1693 transitions. [2021-05-02 13:18:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-05-02 13:18:27,139 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:27,139 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 36, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:27,352 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:27,353 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:27,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:27,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1583590152, now seen corresponding path program 1 times [2021-05-02 13:18:27,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:27,353 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237234852] [2021-05-02 13:18:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:27,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:27,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:27,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-05-02 13:18:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 1067 proven. 477 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2021-05-02 13:18:27,612 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:27,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237234852] [2021-05-02 13:18:27,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237234852] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:27,613 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686599640] [2021-05-02 13:18:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:27,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-02 13:18:27,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:27,713 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,714 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,744 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,745 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,757 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,758 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,770 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,786 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,787 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,804 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,805 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,823 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,824 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,840 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,841 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,857 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,858 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,877 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,878 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,897 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,898 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,916 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,917 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,937 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,963 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,964 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:27,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:28,011 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:28,013 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:28,039 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:28,040 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:28,068 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:28,069 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:28,093 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 1065 proven. 477 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2021-05-02 13:18:28,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686599640] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:28,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:28,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2021-05-02 13:18:28,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826111251] [2021-05-02 13:18:28,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-02 13:18:28,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:28,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-02 13:18:28,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=1071, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 13:18:28,162 INFO L87 Difference]: Start difference. First operand 1351 states and 1693 transitions. Second operand has 42 states, 42 states have (on average 3.4047619047619047) internal successors, (143), 41 states have internal predecessors, (143), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-02 13:18:28,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:28,525 INFO L93 Difference]: Finished difference Result 2487 states and 3143 transitions. [2021-05-02 13:18:28,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-02 13:18:28,526 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.4047619047619047) internal successors, (143), 41 states have internal predecessors, (143), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 144 [2021-05-02 13:18:28,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:28,529 INFO L225 Difference]: With dead ends: 2487 [2021-05-02 13:18:28,529 INFO L226 Difference]: Without dead ends: 1456 [2021-05-02 13:18:28,531 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 521.9ms TimeCoverageRelationStatistics Valid=655, Invalid=1151, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 13:18:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2021-05-02 13:18:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1400. [2021-05-02 13:18:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1360 states have (on average 1.2470588235294118) internal successors, (1696), 1366 states have internal predecessors, (1696), 25 states have call successors, (25), 15 states have call predecessors, (25), 14 states have return successors, (24), 18 states have call predecessors, (24), 24 states have call successors, (24) [2021-05-02 13:18:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1745 transitions. [2021-05-02 13:18:28,583 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1745 transitions. Word has length 144 [2021-05-02 13:18:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:28,583 INFO L480 AbstractCegarLoop]: Abstraction has 1400 states and 1745 transitions. [2021-05-02 13:18:28,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 3.4047619047619047) internal successors, (143), 41 states have internal predecessors, (143), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-05-02 13:18:28,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1745 transitions. [2021-05-02 13:18:28,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-05-02 13:18:28,584 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:28,584 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 36, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:28,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-05-02 13:18:28,789 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:28,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:28,789 INFO L82 PathProgramCache]: Analyzing trace with hash 773992181, now seen corresponding path program 5 times [2021-05-02 13:18:28,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:28,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976816468] [2021-05-02 13:18:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:29,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:29,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:29,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-05-02 13:18:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2194 backedges. 1125 proven. 532 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2021-05-02 13:18:29,058 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:29,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976816468] [2021-05-02 13:18:29,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976816468] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:29,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722723426] [2021-05-02 13:18:29,058 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:29,108 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2021-05-02 13:18:29,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:29,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 9 conjunts are in the unsatisfiable core [2021-05-02 13:18:29,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:29,192 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:29,193 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2194 backedges. 1212 proven. 2 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2021-05-02 13:18:29,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722723426] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:29,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:29,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 6] total 28 [2021-05-02 13:18:29,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122930362] [2021-05-02 13:18:29,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-02 13:18:29,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:29,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-02 13:18:29,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=510, Unknown=0, NotChecked=0, Total=756 [2021-05-02 13:18:29,314 INFO L87 Difference]: Start difference. First operand 1400 states and 1745 transitions. Second operand has 28 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 27 states have internal predecessors, (100), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 13:18:31,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:31,445 INFO L93 Difference]: Finished difference Result 2947 states and 3634 transitions. [2021-05-02 13:18:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2021-05-02 13:18:31,445 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 27 states have internal predecessors, (100), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 147 [2021-05-02 13:18:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:31,450 INFO L225 Difference]: With dead ends: 2947 [2021-05-02 13:18:31,450 INFO L226 Difference]: Without dead ends: 1738 [2021-05-02 13:18:31,453 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5622 ImplicationChecksByTransitivity, 1900.0ms TimeCoverageRelationStatistics Valid=3627, Invalid=11625, Unknown=0, NotChecked=0, Total=15252 [2021-05-02 13:18:31,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2021-05-02 13:18:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1395. [2021-05-02 13:18:31,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1356 states have (on average 1.2396755162241888) internal successors, (1681), 1362 states have internal predecessors, (1681), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-02 13:18:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1728 transitions. [2021-05-02 13:18:31,512 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1728 transitions. Word has length 147 [2021-05-02 13:18:31,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:31,512 INFO L480 AbstractCegarLoop]: Abstraction has 1395 states and 1728 transitions. [2021-05-02 13:18:31,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 27 states have internal predecessors, (100), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 13:18:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1728 transitions. [2021-05-02 13:18:31,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-05-02 13:18:31,514 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:31,514 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 39, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:31,732 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-05-02 13:18:31,733 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:31,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:31,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1654644705, now seen corresponding path program 2 times [2021-05-02 13:18:31,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:31,733 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148578277] [2021-05-02 13:18:31,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:32,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:32,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:32,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:18:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 588 proven. 1841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:18:32,471 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:32,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148578277] [2021-05-02 13:18:32,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148578277] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:32,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060974115] [2021-05-02 13:18:32,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:32,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 13:18:32,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:32,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 23 conjunts are in the unsatisfiable core [2021-05-02 13:18:32,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:32,646 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,677 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,701 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,723 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,724 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,746 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,747 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,770 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,795 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,796 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,833 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,871 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,872 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,897 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,899 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,925 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,926 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,954 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,956 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,984 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:32,985 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,015 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,016 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,046 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,047 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,078 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,080 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,112 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,113 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,147 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,148 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,180 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,181 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,217 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,252 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 87 proven. 1752 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2021-05-02 13:18:33,265 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060974115] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:33,265 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:33,265 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 24] total 65 [2021-05-02 13:18:33,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622472735] [2021-05-02 13:18:33,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-05-02 13:18:33,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:33,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-05-02 13:18:33,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=3231, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 13:18:33,267 INFO L87 Difference]: Start difference. First operand 1395 states and 1728 transitions. Second operand has 65 states, 65 states have (on average 3.4307692307692306) internal successors, (223), 64 states have internal predecessors, (223), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 13:18:35,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:35,876 INFO L93 Difference]: Finished difference Result 2348 states and 2899 transitions. [2021-05-02 13:18:35,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-05-02 13:18:35,877 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.4307692307692306) internal successors, (223), 64 states have internal predecessors, (223), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 153 [2021-05-02 13:18:35,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:35,881 INFO L225 Difference]: With dead ends: 2348 [2021-05-02 13:18:35,881 INFO L226 Difference]: Without dead ends: 1722 [2021-05-02 13:18:35,884 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4268 ImplicationChecksByTransitivity, 2379.7ms TimeCoverageRelationStatistics Valid=3112, Invalid=13144, Unknown=0, NotChecked=0, Total=16256 [2021-05-02 13:18:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2021-05-02 13:18:35,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1703. [2021-05-02 13:18:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1649 states have (on average 1.1097634930260765) internal successors, (1830), 1658 states have internal predecessors, (1830), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2021-05-02 13:18:35,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 1891 transitions. [2021-05-02 13:18:35,970 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 1891 transitions. Word has length 153 [2021-05-02 13:18:35,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:35,971 INFO L480 AbstractCegarLoop]: Abstraction has 1703 states and 1891 transitions. [2021-05-02 13:18:35,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 65 states, 65 states have (on average 3.4307692307692306) internal successors, (223), 64 states have internal predecessors, (223), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 13:18:35,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 1891 transitions. [2021-05-02 13:18:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-05-02 13:18:35,973 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:35,973 INFO L523 BasicCegarLoop]: trace histogram [41, 41, 40, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:36,186 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-05-02 13:18:36,187 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:36,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:36,187 INFO L82 PathProgramCache]: Analyzing trace with hash -47191880, now seen corresponding path program 3 times [2021-05-02 13:18:36,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:36,187 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998426540] [2021-05-02 13:18:36,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:36,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:36,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:36,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:18:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 722 proven. 1238 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2021-05-02 13:18:36,456 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:36,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998426540] [2021-05-02 13:18:36,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998426540] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:36,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085403981] [2021-05-02 13:18:36,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:36,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-05-02 13:18:36,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:36,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2021-05-02 13:18:36,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:36,656 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 1351 proven. 20 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2021-05-02 13:18:36,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085403981] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:36,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:36,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 4] total 27 [2021-05-02 13:18:36,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390150854] [2021-05-02 13:18:36,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-02 13:18:36,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:36,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-02 13:18:36,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=460, Unknown=0, NotChecked=0, Total=702 [2021-05-02 13:18:36,686 INFO L87 Difference]: Start difference. First operand 1703 states and 1891 transitions. Second operand has 27 states, 27 states have (on average 4.185185185185185) internal successors, (113), 26 states have internal predecessors, (113), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 13:18:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:38,500 INFO L93 Difference]: Finished difference Result 2730 states and 3028 transitions. [2021-05-02 13:18:38,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-05-02 13:18:38,501 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.185185185185185) internal successors, (113), 26 states have internal predecessors, (113), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 156 [2021-05-02 13:18:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:38,504 INFO L225 Difference]: With dead ends: 2730 [2021-05-02 13:18:38,504 INFO L226 Difference]: Without dead ends: 1289 [2021-05-02 13:18:38,506 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2579 ImplicationChecksByTransitivity, 1533.7ms TimeCoverageRelationStatistics Valid=3012, Invalid=8760, Unknown=0, NotChecked=0, Total=11772 [2021-05-02 13:18:38,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2021-05-02 13:18:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1196. [2021-05-02 13:18:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1156 states have (on average 1.106401384083045) internal successors, (1279), 1163 states have internal predecessors, (1279), 23 states have call successors, (23), 17 states have call predecessors, (23), 16 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-02 13:18:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1324 transitions. [2021-05-02 13:18:38,551 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1324 transitions. Word has length 156 [2021-05-02 13:18:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:38,551 INFO L480 AbstractCegarLoop]: Abstraction has 1196 states and 1324 transitions. [2021-05-02 13:18:38,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 4.185185185185185) internal successors, (113), 26 states have internal predecessors, (113), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 13:18:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1324 transitions. [2021-05-02 13:18:38,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-05-02 13:18:38,554 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:38,554 INFO L523 BasicCegarLoop]: trace histogram [60, 60, 57, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:38,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-05-02 13:18:38,770 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:38,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:38,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1797369414, now seen corresponding path program 4 times [2021-05-02 13:18:38,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:38,771 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808604916] [2021-05-02 13:18:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:39,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:39,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:39,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:18:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:39,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:18:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5519 backedges. 65 proven. 4265 refuted. 0 times theorem prover too weak. 1189 trivial. 0 not checked. [2021-05-02 13:18:39,327 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:39,327 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808604916] [2021-05-02 13:18:39,327 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808604916] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:39,327 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300679456] [2021-05-02 13:18:39,328 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:39,402 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 13:18:39,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:39,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 67 conjunts are in the unsatisfiable core [2021-05-02 13:18:39,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:39,473 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,475 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,501 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,502 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,534 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,535 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,560 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,561 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,591 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,621 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,622 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,650 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,679 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,681 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,712 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,745 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,751 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,783 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,784 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,815 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,850 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,851 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,885 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,886 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,921 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,922 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,958 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,959 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,995 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:39,996 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,035 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,082 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,083 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,118 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,323 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,324 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,351 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,352 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,381 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,410 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,411 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,440 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,441 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,477 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,510 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,511 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,544 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,577 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,578 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,612 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,647 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,681 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,682 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,717 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,718 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,755 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,756 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,793 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,794 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,833 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,834 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,874 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,914 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,915 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,965 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:40,966 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:41,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:41,009 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:41,126 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:41,128 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:41,128 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:41,130 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:41,131 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:41,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5519 backedges. 532 proven. 4393 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2021-05-02 13:18:41,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300679456] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:41,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:41,191 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 52] total 78 [2021-05-02 13:18:41,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850548370] [2021-05-02 13:18:41,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2021-05-02 13:18:41,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:41,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-05-02 13:18:41,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1099, Invalid=4907, Unknown=0, NotChecked=0, Total=6006 [2021-05-02 13:18:41,192 INFO L87 Difference]: Start difference. First operand 1196 states and 1324 transitions. Second operand has 78 states, 78 states have (on average 3.128205128205128) internal successors, (244), 75 states have internal predecessors, (244), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-05-02 13:18:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:44,595 INFO L93 Difference]: Finished difference Result 1745 states and 1923 transitions. [2021-05-02 13:18:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2021-05-02 13:18:44,595 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 3.128205128205128) internal successors, (244), 75 states have internal predecessors, (244), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 224 [2021-05-02 13:18:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:44,598 INFO L225 Difference]: With dead ends: 1745 [2021-05-02 13:18:44,598 INFO L226 Difference]: Without dead ends: 777 [2021-05-02 13:18:44,600 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7898 ImplicationChecksByTransitivity, 3722.2ms TimeCoverageRelationStatistics Valid=3580, Invalid=18472, Unknown=0, NotChecked=0, Total=22052 [2021-05-02 13:18:44,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2021-05-02 13:18:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 570. [2021-05-02 13:18:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 550 states have (on average 1.02) internal successors, (561), 553 states have internal predecessors, (561), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-02 13:18:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 586 transitions. [2021-05-02 13:18:44,615 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 586 transitions. Word has length 224 [2021-05-02 13:18:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:44,615 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 586 transitions. [2021-05-02 13:18:44,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 78 states, 78 states have (on average 3.128205128205128) internal successors, (244), 75 states have internal predecessors, (244), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-05-02 13:18:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 586 transitions. [2021-05-02 13:18:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-05-02 13:18:44,616 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:44,617 INFO L523 BasicCegarLoop]: trace histogram [60, 60, 60, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:44,832 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-05-02 13:18:44,833 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:44,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:44,833 INFO L82 PathProgramCache]: Analyzing trace with hash -278770500, now seen corresponding path program 2 times [2021-05-02 13:18:44,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:44,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621877041] [2021-05-02 13:18:44,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:44,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:44,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:44,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:18:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:44,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:18:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5519 backedges. 6 proven. 3739 refuted. 0 times theorem prover too weak. 1774 trivial. 0 not checked. [2021-05-02 13:18:44,919 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:44,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621877041] [2021-05-02 13:18:44,919 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621877041] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:44,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438495990] [2021-05-02 13:18:44,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:44,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 13:18:44,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:44,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-02 13:18:44,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:45,102 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:45,103 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:45,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:45,117 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:45,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:45,220 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:45,231 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:45,232 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:45,322 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:45,323 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:45,334 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5519 backedges. 6 proven. 3739 refuted. 0 times theorem prover too weak. 1774 trivial. 0 not checked. [2021-05-02 13:18:45,339 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438495990] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:45,339 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:45,339 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-05-02 13:18:45,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901351254] [2021-05-02 13:18:45,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 13:18:45,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:45,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 13:18:45,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-05-02 13:18:45,340 INFO L87 Difference]: Start difference. First operand 570 states and 586 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2021-05-02 13:18:45,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:45,463 INFO L93 Difference]: Finished difference Result 710 states and 731 transitions. [2021-05-02 13:18:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 13:18:45,464 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 224 [2021-05-02 13:18:45,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:45,465 INFO L225 Difference]: With dead ends: 710 [2021-05-02 13:18:45,466 INFO L226 Difference]: Without dead ends: 637 [2021-05-02 13:18:45,466 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 87.5ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-05-02 13:18:45,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2021-05-02 13:18:45,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2021-05-02 13:18:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 616 states have (on average 1.0194805194805194) internal successors, (628), 619 states have internal predecessors, (628), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2021-05-02 13:18:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 655 transitions. [2021-05-02 13:18:45,481 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 655 transitions. Word has length 224 [2021-05-02 13:18:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:45,482 INFO L480 AbstractCegarLoop]: Abstraction has 637 states and 655 transitions. [2021-05-02 13:18:45,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2021-05-02 13:18:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 655 transitions. [2021-05-02 13:18:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2021-05-02 13:18:45,483 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:45,483 INFO L523 BasicCegarLoop]: trace histogram [80, 80, 80, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:45,684 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:45,685 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:45,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:45,685 INFO L82 PathProgramCache]: Analyzing trace with hash 145611393, now seen corresponding path program 3 times [2021-05-02 13:18:45,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:45,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344861947] [2021-05-02 13:18:45,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:45,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:45,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:45,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:18:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:45,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:18:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:45,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:18:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9860 backedges. 9 proven. 7479 refuted. 0 times theorem prover too weak. 2372 trivial. 0 not checked. [2021-05-02 13:18:45,806 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:45,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344861947] [2021-05-02 13:18:45,807 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344861947] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:45,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628147471] [2021-05-02 13:18:45,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:45,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2021-05-02 13:18:45,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:45,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-02 13:18:45,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:46,084 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:46,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:46,096 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:46,097 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:46,200 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:46,201 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:46,213 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:46,214 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:46,314 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:46,315 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:46,328 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:46,329 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:46,430 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:46,431 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:46,444 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 9860 backedges. 9 proven. 7479 refuted. 0 times theorem prover too weak. 2372 trivial. 0 not checked. [2021-05-02 13:18:46,450 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628147471] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:46,450 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:46,450 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-05-02 13:18:46,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584890919] [2021-05-02 13:18:46,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 13:18:46,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:46,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 13:18:46,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2021-05-02 13:18:46,451 INFO L87 Difference]: Start difference. First operand 637 states and 655 transitions. Second operand has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 13 states have internal predecessors, (93), 9 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2021-05-02 13:18:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:46,599 INFO L93 Difference]: Finished difference Result 777 states and 800 transitions. [2021-05-02 13:18:46,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 13:18:46,599 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 13 states have internal predecessors, (93), 9 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 295 [2021-05-02 13:18:46,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:46,601 INFO L225 Difference]: With dead ends: 777 [2021-05-02 13:18:46,601 INFO L226 Difference]: Without dead ends: 704 [2021-05-02 13:18:46,601 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 112.2ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-05-02 13:18:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-05-02 13:18:46,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2021-05-02 13:18:46,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 682 states have (on average 1.0190615835777126) internal successors, (695), 685 states have internal predecessors, (695), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2021-05-02 13:18:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 724 transitions. [2021-05-02 13:18:46,618 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 724 transitions. Word has length 295 [2021-05-02 13:18:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:46,618 INFO L480 AbstractCegarLoop]: Abstraction has 704 states and 724 transitions. [2021-05-02 13:18:46,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 13 states have internal predecessors, (93), 9 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2021-05-02 13:18:46,619 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 724 transitions. [2021-05-02 13:18:46,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2021-05-02 13:18:46,620 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:46,620 INFO L523 BasicCegarLoop]: trace histogram [100, 100, 100, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:46,844 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-05-02 13:18:46,845 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:46,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:46,845 INFO L82 PathProgramCache]: Analyzing trace with hash 907992348, now seen corresponding path program 4 times [2021-05-02 13:18:46,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:46,846 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678421775] [2021-05-02 13:18:46,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:46,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:46,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:46,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:18:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:46,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:18:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:46,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:18:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:46,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 13:18:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15452 backedges. 12 proven. 12466 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2021-05-02 13:18:46,996 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:46,996 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678421775] [2021-05-02 13:18:46,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678421775] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:46,996 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138057566] [2021-05-02 13:18:46,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:47,090 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 13:18:47,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:47,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 28 conjunts are in the unsatisfiable core [2021-05-02 13:18:47,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:47,131 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,146 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,147 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,161 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,162 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,177 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,194 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,195 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,211 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,212 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,229 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,230 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,249 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,250 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,269 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,270 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,289 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,290 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,310 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,311 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,355 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,356 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,378 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,379 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,403 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,426 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,427 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,451 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,452 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,477 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,505 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,506 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,533 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,534 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,561 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,590 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,591 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,610 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,734 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,735 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,754 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,755 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,875 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,876 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,897 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:47,897 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:48,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:48,009 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:48,031 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:48,031 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:48,141 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:48,142 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:48,163 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 15452 backedges. 544 proven. 12524 refuted. 0 times theorem prover too weak. 2384 trivial. 0 not checked. [2021-05-02 13:18:48,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138057566] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:48,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:48,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 30] total 37 [2021-05-02 13:18:48,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324085294] [2021-05-02 13:18:48,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-02 13:18:48,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:48,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-02 13:18:48,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=986, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 13:18:48,170 INFO L87 Difference]: Start difference. First operand 704 states and 724 transitions. Second operand has 37 states, 37 states have (on average 4.513513513513513) internal successors, (167), 36 states have internal predecessors, (167), 11 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-05-02 13:18:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:48,784 INFO L93 Difference]: Finished difference Result 844 states and 869 transitions. [2021-05-02 13:18:48,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-02 13:18:48,784 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.513513513513513) internal successors, (167), 36 states have internal predecessors, (167), 11 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 366 [2021-05-02 13:18:48,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:48,786 INFO L225 Difference]: With dead ends: 844 [2021-05-02 13:18:48,786 INFO L226 Difference]: Without dead ends: 771 [2021-05-02 13:18:48,787 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 343 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 874.7ms TimeCoverageRelationStatistics Valid=1070, Invalid=2236, Unknown=0, NotChecked=0, Total=3306 [2021-05-02 13:18:48,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2021-05-02 13:18:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771. [2021-05-02 13:18:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 748 states have (on average 1.018716577540107) internal successors, (762), 751 states have internal predecessors, (762), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2021-05-02 13:18:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 793 transitions. [2021-05-02 13:18:48,805 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 793 transitions. Word has length 366 [2021-05-02 13:18:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:48,806 INFO L480 AbstractCegarLoop]: Abstraction has 771 states and 793 transitions. [2021-05-02 13:18:48,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 4.513513513513513) internal successors, (167), 36 states have internal predecessors, (167), 11 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-05-02 13:18:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 793 transitions. [2021-05-02 13:18:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2021-05-02 13:18:48,808 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:48,808 INFO L523 BasicCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:49,024 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-05-02 13:18:49,024 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:49,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:49,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1204609503, now seen corresponding path program 5 times [2021-05-02 13:18:49,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:49,025 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016519889] [2021-05-02 13:18:49,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:49,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:49,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:49,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:18:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:49,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:18:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:49,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:18:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:49,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 13:18:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:49,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 13:18:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 15 proven. 18700 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2021-05-02 13:18:49,160 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:49,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016519889] [2021-05-02 13:18:49,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016519889] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:49,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510134055] [2021-05-02 13:18:49,160 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:49,357 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 85 check-sat command(s) [2021-05-02 13:18:49,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:49,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 29 conjunts are in the unsatisfiable core [2021-05-02 13:18:49,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:49,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,458 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,468 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,489 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,490 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,505 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,506 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,522 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,523 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,540 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,542 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,570 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,571 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,589 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,590 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,608 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,608 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,627 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,628 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,647 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,648 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,668 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,668 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,689 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,690 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,733 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,734 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,772 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,797 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,798 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,824 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,851 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,852 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,878 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,879 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,905 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,906 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,930 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,954 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,955 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,974 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:49,975 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,099 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,120 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,121 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,228 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,229 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,250 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,251 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,378 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,379 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,403 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,404 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,530 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,531 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,555 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 22295 backedges. 563 proven. 18758 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2021-05-02 13:18:50,562 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510134055] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:50,562 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:50,562 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 31] total 39 [2021-05-02 13:18:50,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088366657] [2021-05-02 13:18:50,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-02 13:18:50,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:50,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-02 13:18:50,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1123, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 13:18:50,563 INFO L87 Difference]: Start difference. First operand 771 states and 793 transitions. Second operand has 39 states, 39 states have (on average 4.743589743589744) internal successors, (185), 38 states have internal predecessors, (185), 13 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2021-05-02 13:18:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:51,476 INFO L93 Difference]: Finished difference Result 911 states and 938 transitions. [2021-05-02 13:18:51,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-02 13:18:51,477 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.743589743589744) internal successors, (185), 38 states have internal predecessors, (185), 13 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 437 [2021-05-02 13:18:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:51,479 INFO L225 Difference]: With dead ends: 911 [2021-05-02 13:18:51,479 INFO L226 Difference]: Without dead ends: 838 [2021-05-02 13:18:51,480 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 415 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 1086.2ms TimeCoverageRelationStatistics Valid=2053, Invalid=4267, Unknown=0, NotChecked=0, Total=6320 [2021-05-02 13:18:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-05-02 13:18:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2021-05-02 13:18:51,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 814 states have (on average 1.0184275184275184) internal successors, (829), 817 states have internal predecessors, (829), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-02 13:18:51,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 862 transitions. [2021-05-02 13:18:51,510 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 862 transitions. Word has length 437 [2021-05-02 13:18:51,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:51,510 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 862 transitions. [2021-05-02 13:18:51,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 4.743589743589744) internal successors, (185), 38 states have internal predecessors, (185), 13 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2021-05-02 13:18:51,510 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 862 transitions. [2021-05-02 13:18:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2021-05-02 13:18:51,513 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:51,513 INFO L523 BasicCegarLoop]: trace histogram [140, 140, 140, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:51,713 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-05-02 13:18:51,713 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:51,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1694415492, now seen corresponding path program 6 times [2021-05-02 13:18:51,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:51,714 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101017036] [2021-05-02 13:18:51,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:51,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:51,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:51,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:18:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:51,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:18:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:51,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:18:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:51,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 13:18:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:51,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 13:18:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:51,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 13:18:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 30389 backedges. 18 proven. 26181 refuted. 0 times theorem prover too weak. 4190 trivial. 0 not checked. [2021-05-02 13:18:51,877 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:51,877 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101017036] [2021-05-02 13:18:51,877 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101017036] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:51,877 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606511903] [2021-05-02 13:18:51,877 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:52,114 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 65 check-sat command(s) [2021-05-02 13:18:52,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:52,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 10 conjunts are in the unsatisfiable core [2021-05-02 13:18:52,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:52,261 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,262 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,273 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,274 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,474 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,475 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,487 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,488 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,582 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,596 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,597 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,693 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,706 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,811 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,813 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,828 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,829 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,922 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,923 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 30389 backedges. 18 proven. 26181 refuted. 0 times theorem prover too weak. 4190 trivial. 0 not checked. [2021-05-02 13:18:52,947 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606511903] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:52,947 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:52,947 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-05-02 13:18:52,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436196246] [2021-05-02 13:18:52,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-02 13:18:52,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:52,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-02 13:18:52,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2021-05-02 13:18:52,948 INFO L87 Difference]: Start difference. First operand 838 states and 862 transitions. Second operand has 20 states, 20 states have (on average 7.35) internal successors, (147), 19 states have internal predecessors, (147), 15 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2021-05-02 13:18:53,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:53,176 INFO L93 Difference]: Finished difference Result 978 states and 1007 transitions. [2021-05-02 13:18:53,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 13:18:53,177 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.35) internal successors, (147), 19 states have internal predecessors, (147), 15 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 508 [2021-05-02 13:18:53,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:53,179 INFO L225 Difference]: With dead ends: 978 [2021-05-02 13:18:53,180 INFO L226 Difference]: Without dead ends: 905 [2021-05-02 13:18:53,180 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 163.7ms TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2021-05-02 13:18:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2021-05-02 13:18:53,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 905. [2021-05-02 13:18:53,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 880 states have (on average 1.018181818181818) internal successors, (896), 883 states have internal predecessors, (896), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2021-05-02 13:18:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 931 transitions. [2021-05-02 13:18:53,215 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 931 transitions. Word has length 508 [2021-05-02 13:18:53,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:53,215 INFO L480 AbstractCegarLoop]: Abstraction has 905 states and 931 transitions. [2021-05-02 13:18:53,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 7.35) internal successors, (147), 19 states have internal predecessors, (147), 15 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2021-05-02 13:18:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 931 transitions. [2021-05-02 13:18:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2021-05-02 13:18:53,218 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:53,218 INFO L523 BasicCegarLoop]: trace histogram [160, 160, 160, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:53,419 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-05-02 13:18:53,419 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:53,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1232107071, now seen corresponding path program 7 times [2021-05-02 13:18:53,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:53,420 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380753972] [2021-05-02 13:18:53,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:53,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:53,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:53,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:18:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:53,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:18:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:53,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:18:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:53,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 13:18:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:53,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 13:18:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:53,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 13:18:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:53,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 13:18:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 39734 backedges. 21 proven. 34909 refuted. 0 times theorem prover too weak. 4804 trivial. 0 not checked. [2021-05-02 13:18:53,592 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:53,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380753972] [2021-05-02 13:18:53,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380753972] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:53,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536037262] [2021-05-02 13:18:53,592 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:53,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 11 conjunts are in the unsatisfiable core [2021-05-02 13:18:53,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:53,846 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:53,847 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:53,858 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:53,859 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:53,954 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:53,955 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:53,972 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:53,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,086 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,098 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,099 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,190 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,191 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,203 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,204 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,307 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,322 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,324 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,419 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,433 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,434 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,524 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,541 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,542 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,634 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,635 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,651 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 39734 backedges. 21 proven. 34909 refuted. 0 times theorem prover too weak. 4804 trivial. 0 not checked. [2021-05-02 13:18:54,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536037262] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:54,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:54,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2021-05-02 13:18:54,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091058111] [2021-05-02 13:18:54,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 13:18:54,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:54,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 13:18:54,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2021-05-02 13:18:54,660 INFO L87 Difference]: Start difference. First operand 905 states and 931 transitions. Second operand has 22 states, 22 states have (on average 7.5) internal successors, (165), 21 states have internal predecessors, (165), 17 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2021-05-02 13:18:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:54,872 INFO L93 Difference]: Finished difference Result 1045 states and 1076 transitions. [2021-05-02 13:18:54,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 13:18:54,872 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.5) internal successors, (165), 21 states have internal predecessors, (165), 17 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 579 [2021-05-02 13:18:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:54,874 INFO L225 Difference]: With dead ends: 1045 [2021-05-02 13:18:54,875 INFO L226 Difference]: Without dead ends: 972 [2021-05-02 13:18:54,875 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 187.8ms TimeCoverageRelationStatistics Valid=180, Invalid=326, Unknown=0, NotChecked=0, Total=506 [2021-05-02 13:18:54,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2021-05-02 13:18:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2021-05-02 13:18:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 946 states have (on average 1.017970401691332) internal successors, (963), 949 states have internal predecessors, (963), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 13:18:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1000 transitions. [2021-05-02 13:18:54,899 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1000 transitions. Word has length 579 [2021-05-02 13:18:54,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:54,900 INFO L480 AbstractCegarLoop]: Abstraction has 972 states and 1000 transitions. [2021-05-02 13:18:54,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 7.5) internal successors, (165), 21 states have internal predecessors, (165), 17 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2021-05-02 13:18:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1000 transitions. [2021-05-02 13:18:54,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2021-05-02 13:18:54,903 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:54,903 INFO L523 BasicCegarLoop]: trace histogram [180, 180, 180, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:55,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-05-02 13:18:55,117 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:55,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:55,117 INFO L82 PathProgramCache]: Analyzing trace with hash -2056288804, now seen corresponding path program 8 times [2021-05-02 13:18:55,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:55,118 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064367129] [2021-05-02 13:18:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:55,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:55,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:55,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:18:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:55,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:18:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:55,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:18:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:55,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 13:18:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:55,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 13:18:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:55,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 13:18:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:55,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 13:18:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:55,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 13:18:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 50330 backedges. 24 proven. 44884 refuted. 0 times theorem prover too weak. 5422 trivial. 0 not checked. [2021-05-02 13:18:55,337 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:55,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064367129] [2021-05-02 13:18:55,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064367129] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:55,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118271866] [2021-05-02 13:18:55,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:55,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 13:18:55,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:55,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 12 conjunts are in the unsatisfiable core [2021-05-02 13:18:55,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:55,612 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:55,613 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:55,624 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:55,624 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:55,715 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:55,716 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:55,727 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:55,728 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:55,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:55,819 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:55,830 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:55,831 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:55,922 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:55,923 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:55,935 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:55,936 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,028 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,029 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,043 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,044 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,138 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,139 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,258 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,259 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,274 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,275 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,370 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,387 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,387 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,482 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,483 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,499 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 50330 backedges. 24 proven. 44884 refuted. 0 times theorem prover too weak. 5422 trivial. 0 not checked. [2021-05-02 13:18:56,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118271866] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:56,507 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:56,507 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2021-05-02 13:18:56,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951379154] [2021-05-02 13:18:56,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 13:18:56,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:56,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 13:18:56,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2021-05-02 13:18:56,509 INFO L87 Difference]: Start difference. First operand 972 states and 1000 transitions. Second operand has 24 states, 24 states have (on average 7.625) internal successors, (183), 23 states have internal predecessors, (183), 19 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2021-05-02 13:18:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:56,792 INFO L93 Difference]: Finished difference Result 1112 states and 1145 transitions. [2021-05-02 13:18:56,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 13:18:56,793 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.625) internal successors, (183), 23 states have internal predecessors, (183), 19 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 650 [2021-05-02 13:18:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:56,795 INFO L225 Difference]: With dead ends: 1112 [2021-05-02 13:18:56,795 INFO L226 Difference]: Without dead ends: 1039 [2021-05-02 13:18:56,796 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 660 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 227.1ms TimeCoverageRelationStatistics Valid=214, Invalid=386, Unknown=0, NotChecked=0, Total=600 [2021-05-02 13:18:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2021-05-02 13:18:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1039. [2021-05-02 13:18:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 1012 states have (on average 1.017786561264822) internal successors, (1030), 1015 states have internal predecessors, (1030), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-05-02 13:18:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1069 transitions. [2021-05-02 13:18:56,820 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1069 transitions. Word has length 650 [2021-05-02 13:18:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:56,821 INFO L480 AbstractCegarLoop]: Abstraction has 1039 states and 1069 transitions. [2021-05-02 13:18:56,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 7.625) internal successors, (183), 23 states have internal predecessors, (183), 19 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2021-05-02 13:18:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1069 transitions. [2021-05-02 13:18:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2021-05-02 13:18:56,824 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:56,824 INFO L523 BasicCegarLoop]: trace histogram [200, 200, 200, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:57,040 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-05-02 13:18:57,041 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:57,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:57,041 INFO L82 PathProgramCache]: Analyzing trace with hash -845341343, now seen corresponding path program 9 times [2021-05-02 13:18:57,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:57,041 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690270106] [2021-05-02 13:18:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:57,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:57,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:57,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:18:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:57,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:18:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:57,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:18:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:57,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 13:18:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:57,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 13:18:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:57,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 13:18:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:57,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 13:18:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:57,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 13:18:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:57,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 13:18:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:57,283 INFO L134 CoverageAnalysis]: Checked inductivity of 62177 backedges. 27 proven. 56106 refuted. 0 times theorem prover too weak. 6044 trivial. 0 not checked. [2021-05-02 13:18:57,283 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:57,283 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690270106] [2021-05-02 13:18:57,283 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690270106] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:57,283 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362446548] [2021-05-02 13:18:57,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:57,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2021-05-02 13:18:57,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:57,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 13 conjunts are in the unsatisfiable core [2021-05-02 13:18:57,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:57,655 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:57,656 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:57,668 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:57,669 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:57,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:57,772 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:57,785 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:57,786 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:57,880 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:57,881 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:57,893 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:57,894 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:57,984 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:57,985 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:57,998 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:57,999 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,098 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,099 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,114 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,115 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,210 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,211 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,225 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,226 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,316 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,317 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,332 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,333 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,449 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,451 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,468 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,570 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,572 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,589 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,590 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,693 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,710 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 62177 backedges. 27 proven. 56106 refuted. 0 times theorem prover too weak. 6044 trivial. 0 not checked. [2021-05-02 13:18:58,719 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362446548] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:58,719 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:18:58,719 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-05-02 13:18:58,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660909240] [2021-05-02 13:18:58,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 13:18:58,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:18:58,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 13:18:58,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2021-05-02 13:18:58,720 INFO L87 Difference]: Start difference. First operand 1039 states and 1069 transitions. Second operand has 26 states, 26 states have (on average 7.730769230769231) internal successors, (201), 25 states have internal predecessors, (201), 21 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2021-05-02 13:18:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:18:58,966 INFO L93 Difference]: Finished difference Result 1179 states and 1214 transitions. [2021-05-02 13:18:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 13:18:58,966 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.730769230769231) internal successors, (201), 25 states have internal predecessors, (201), 21 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 721 [2021-05-02 13:18:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:18:58,968 INFO L225 Difference]: With dead ends: 1179 [2021-05-02 13:18:58,968 INFO L226 Difference]: Without dead ends: 1106 [2021-05-02 13:18:58,969 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 732 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 240.6ms TimeCoverageRelationStatistics Valid=251, Invalid=451, Unknown=0, NotChecked=0, Total=702 [2021-05-02 13:18:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2021-05-02 13:18:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2021-05-02 13:18:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1078 states have (on average 1.0176252319109462) internal successors, (1097), 1081 states have internal predecessors, (1097), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2021-05-02 13:18:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1138 transitions. [2021-05-02 13:18:58,992 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1138 transitions. Word has length 721 [2021-05-02 13:18:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:18:58,993 INFO L480 AbstractCegarLoop]: Abstraction has 1106 states and 1138 transitions. [2021-05-02 13:18:58,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 7.730769230769231) internal successors, (201), 25 states have internal predecessors, (201), 21 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2021-05-02 13:18:58,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1138 transitions. [2021-05-02 13:18:58,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2021-05-02 13:18:58,997 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:18:58,997 INFO L523 BasicCegarLoop]: trace histogram [220, 220, 220, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:18:59,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2021-05-02 13:18:59,205 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:18:59,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:18:59,205 INFO L82 PathProgramCache]: Analyzing trace with hash 307207740, now seen corresponding path program 10 times [2021-05-02 13:18:59,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:18:59,205 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510227273] [2021-05-02 13:18:59,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:18:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:59,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:18:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:59,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:18:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:59,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:18:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:59,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:18:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:59,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:18:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:59,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 13:18:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:59,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 13:18:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:59,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 13:18:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:59,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 13:18:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:59,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 13:18:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:59,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 13:18:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:59,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 13:18:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:18:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 75275 backedges. 30 proven. 68575 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2021-05-02 13:18:59,443 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:18:59,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510227273] [2021-05-02 13:18:59,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510227273] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:18:59,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183903278] [2021-05-02 13:18:59,443 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:18:59,631 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 13:18:59,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:18:59,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 34 conjunts are in the unsatisfiable core [2021-05-02 13:18:59,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:18:59,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,677 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,692 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,708 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,723 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,724 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,741 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,741 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,759 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,760 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,777 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,778 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,797 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,798 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,817 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,838 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,839 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,859 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,860 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,881 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,882 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,903 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,904 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,926 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,927 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,950 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,951 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,974 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:18:59,975 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,000 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,001 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,028 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,054 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,055 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,079 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,102 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,119 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,120 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,217 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,338 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,339 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,358 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,359 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,458 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,459 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,478 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,479 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,580 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,601 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,602 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,703 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,704 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,725 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,726 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,847 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,848 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,874 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,875 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,986 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:00,987 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:01,011 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:01,012 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:01,122 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:01,123 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:01,147 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:01,148 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:01,272 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:01,273 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:01,310 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:01,311 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:01,425 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:01,426 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:01,452 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 75275 backedges. 562 proven. 68633 refuted. 0 times theorem prover too weak. 6080 trivial. 0 not checked. [2021-05-02 13:19:01,460 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183903278] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:01,460 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:19:01,460 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 36] total 49 [2021-05-02 13:19:01,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343939465] [2021-05-02 13:19:01,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-02 13:19:01,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:19:01,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-02 13:19:01,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=1811, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 13:19:01,462 INFO L87 Difference]: Start difference. First operand 1106 states and 1138 transitions. Second operand has 49 states, 49 states have (on average 5.612244897959184) internal successors, (275), 48 states have internal predecessors, (275), 23 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2021-05-02 13:19:02,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:19:02,135 INFO L93 Difference]: Finished difference Result 1246 states and 1283 transitions. [2021-05-02 13:19:02,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-02 13:19:02,135 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.612244897959184) internal successors, (275), 48 states have internal predecessors, (275), 23 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) Word has length 792 [2021-05-02 13:19:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:19:02,137 INFO L225 Difference]: With dead ends: 1246 [2021-05-02 13:19:02,137 INFO L226 Difference]: Without dead ends: 1173 [2021-05-02 13:19:02,138 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 763 SyntacticMatches, 20 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 1102.9ms TimeCoverageRelationStatistics Valid=1505, Invalid=3325, Unknown=0, NotChecked=0, Total=4830 [2021-05-02 13:19:02,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2021-05-02 13:19:02,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2021-05-02 13:19:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1144 states have (on average 1.0174825174825175) internal successors, (1164), 1147 states have internal predecessors, (1164), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2021-05-02 13:19:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1207 transitions. [2021-05-02 13:19:02,163 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1207 transitions. Word has length 792 [2021-05-02 13:19:02,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:19:02,164 INFO L480 AbstractCegarLoop]: Abstraction has 1173 states and 1207 transitions. [2021-05-02 13:19:02,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 49 states have (on average 5.612244897959184) internal successors, (275), 48 states have internal predecessors, (275), 23 states have call successors, (27), 4 states have call predecessors, (27), 2 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2021-05-02 13:19:02,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1207 transitions. [2021-05-02 13:19:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2021-05-02 13:19:02,169 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:19:02,169 INFO L523 BasicCegarLoop]: trace histogram [240, 240, 240, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:19:02,383 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:19:02,384 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:19:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:19:02,384 INFO L82 PathProgramCache]: Analyzing trace with hash -508176127, now seen corresponding path program 11 times [2021-05-02 13:19:02,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:19:02,384 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11913206] [2021-05-02 13:19:02,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:19:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:02,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:19:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:02,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:19:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:02,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:19:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:02,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:19:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:02,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:19:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:02,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 13:19:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:02,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 13:19:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:02,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 13:19:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:02,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 13:19:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:02,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 13:19:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:02,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 13:19:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:02,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 13:19:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:02,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 13:19:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 89624 backedges. 33 proven. 82291 refuted. 0 times theorem prover too weak. 7300 trivial. 0 not checked. [2021-05-02 13:19:02,665 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:19:02,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11913206] [2021-05-02 13:19:02,666 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11913206] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:02,666 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468878268] [2021-05-02 13:19:02,666 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:19:03,257 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 91 check-sat command(s) [2021-05-02 13:19:03,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:19:03,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 37 conjunts are in the unsatisfiable core [2021-05-02 13:19:03,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:19:03,384 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,385 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,399 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,400 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,424 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,425 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,443 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,444 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,463 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,465 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,486 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,487 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,506 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,507 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,526 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,527 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,548 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,549 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,570 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,571 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,593 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,594 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,616 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,641 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,642 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,680 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,681 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,708 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,709 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,735 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,736 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,763 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,790 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,791 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,819 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,849 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,850 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,880 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,881 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,964 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,965 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,985 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:03,986 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,093 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,094 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,115 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,115 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,238 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,259 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,260 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,373 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,374 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,399 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,403 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,517 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,518 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,656 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,657 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,682 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,683 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,795 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,796 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,822 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,943 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,944 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,970 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:04,971 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:05,089 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:05,090 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:05,118 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:05,119 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:05,233 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:05,234 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:05,261 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:05,262 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:05,381 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:05,390 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:05,422 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 89624 backedges. 643 proven. 82311 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2021-05-02 13:19:05,432 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468878268] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:05,432 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:19:05,432 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 38] total 52 [2021-05-02 13:19:05,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062007528] [2021-05-02 13:19:05,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-02 13:19:05,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:19:05,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-02 13:19:05,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=2044, Unknown=0, NotChecked=0, Total=2652 [2021-05-02 13:19:05,434 INFO L87 Difference]: Start difference. First operand 1173 states and 1207 transitions. Second operand has 52 states, 52 states have (on average 5.634615384615385) internal successors, (293), 51 states have internal predecessors, (293), 25 states have call successors, (29), 4 states have call predecessors, (29), 2 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2021-05-02 13:19:06,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:19:06,526 INFO L93 Difference]: Finished difference Result 1313 states and 1352 transitions. [2021-05-02 13:19:06,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-02 13:19:06,527 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 5.634615384615385) internal successors, (293), 51 states have internal predecessors, (293), 25 states have call successors, (29), 4 states have call predecessors, (29), 2 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) Word has length 863 [2021-05-02 13:19:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:19:06,529 INFO L225 Difference]: With dead ends: 1313 [2021-05-02 13:19:06,529 INFO L226 Difference]: Without dead ends: 1240 [2021-05-02 13:19:06,530 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 946 GetRequests, 834 SyntacticMatches, 20 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2529 ImplicationChecksByTransitivity, 1581.8ms TimeCoverageRelationStatistics Valid=2893, Invalid=5849, Unknown=0, NotChecked=0, Total=8742 [2021-05-02 13:19:06,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2021-05-02 13:19:06,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1240. [2021-05-02 13:19:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1210 states have (on average 1.0173553719008264) internal successors, (1231), 1213 states have internal predecessors, (1231), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2021-05-02 13:19:06,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1276 transitions. [2021-05-02 13:19:06,558 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1276 transitions. Word has length 863 [2021-05-02 13:19:06,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:19:06,559 INFO L480 AbstractCegarLoop]: Abstraction has 1240 states and 1276 transitions. [2021-05-02 13:19:06,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 5.634615384615385) internal successors, (293), 51 states have internal predecessors, (293), 25 states have call successors, (29), 4 states have call predecessors, (29), 2 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2021-05-02 13:19:06,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1276 transitions. [2021-05-02 13:19:06,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2021-05-02 13:19:06,565 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:19:06,565 INFO L523 BasicCegarLoop]: trace histogram [260, 260, 260, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:19:06,766 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:19:06,766 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:19:06,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:19:06,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1946652316, now seen corresponding path program 12 times [2021-05-02 13:19:06,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:19:06,766 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289584346] [2021-05-02 13:19:06,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:19:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:07,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:19:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:07,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:19:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:07,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:19:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:07,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:19:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:07,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:19:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:07,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 13:19:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:07,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 13:19:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:07,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 13:19:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:07,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 13:19:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:07,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 13:19:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:07,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 13:19:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:07,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 13:19:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:07,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 13:19:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:07,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-02 13:19:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 105224 backedges. 36 proven. 97254 refuted. 0 times theorem prover too weak. 7934 trivial. 0 not checked. [2021-05-02 13:19:07,073 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:19:07,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289584346] [2021-05-02 13:19:07,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289584346] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:07,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587147896] [2021-05-02 13:19:07,073 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:19:07,456 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 65 check-sat command(s) [2021-05-02 13:19:07,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:19:07,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 16 conjunts are in the unsatisfiable core [2021-05-02 13:19:07,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:19:07,573 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:07,574 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:07,586 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:07,586 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:07,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:07,700 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:07,712 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:07,714 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:07,808 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:07,809 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:07,823 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:07,824 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:07,925 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:07,926 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:07,939 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:07,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,038 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,051 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,052 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,151 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,152 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,168 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,169 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,260 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,261 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,276 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,277 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,384 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,384 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,474 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,475 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,492 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,582 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,583 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,599 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,600 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,693 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,712 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,804 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,805 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,824 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,825 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,932 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,933 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,951 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 105224 backedges. 36 proven. 97254 refuted. 0 times theorem prover too weak. 7934 trivial. 0 not checked. [2021-05-02 13:19:08,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587147896] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:08,962 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:19:08,962 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2021-05-02 13:19:08,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936007486] [2021-05-02 13:19:08,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 13:19:08,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:19:08,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 13:19:08,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=616, Unknown=0, NotChecked=0, Total=992 [2021-05-02 13:19:08,963 INFO L87 Difference]: Start difference. First operand 1240 states and 1276 transitions. Second operand has 32 states, 32 states have (on average 7.96875) internal successors, (255), 31 states have internal predecessors, (255), 27 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (27), 25 states have call predecessors, (27), 26 states have call successors, (27) [2021-05-02 13:19:09,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:19:09,274 INFO L93 Difference]: Finished difference Result 1380 states and 1421 transitions. [2021-05-02 13:19:09,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-02 13:19:09,274 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.96875) internal successors, (255), 31 states have internal predecessors, (255), 27 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (27), 25 states have call predecessors, (27), 26 states have call successors, (27) Word has length 934 [2021-05-02 13:19:09,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:19:09,277 INFO L225 Difference]: With dead ends: 1380 [2021-05-02 13:19:09,277 INFO L226 Difference]: Without dead ends: 1307 [2021-05-02 13:19:09,277 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 979 GetRequests, 948 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 329.3ms TimeCoverageRelationStatistics Valid=380, Invalid=676, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 13:19:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2021-05-02 13:19:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1307. [2021-05-02 13:19:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 1276 states have (on average 1.0172413793103448) internal successors, (1298), 1279 states have internal predecessors, (1298), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-02 13:19:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1345 transitions. [2021-05-02 13:19:09,305 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1345 transitions. Word has length 934 [2021-05-02 13:19:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:19:09,306 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 1345 transitions. [2021-05-02 13:19:09,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 7.96875) internal successors, (255), 31 states have internal predecessors, (255), 27 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (27), 25 states have call predecessors, (27), 26 states have call successors, (27) [2021-05-02 13:19:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1345 transitions. [2021-05-02 13:19:09,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2021-05-02 13:19:09,312 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:19:09,312 INFO L523 BasicCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:19:09,529 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:19:09,529 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:19:09,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:19:09,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1850491743, now seen corresponding path program 13 times [2021-05-02 13:19:09,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:19:09,530 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467550808] [2021-05-02 13:19:09,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:19:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:19:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:19:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:19:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:19:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:19:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 13:19:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 13:19:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 13:19:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 13:19:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 13:19:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 13:19:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 13:19:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 13:19:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-02 13:19:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-02 13:19:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 122075 backedges. 39 proven. 113464 refuted. 0 times theorem prover too weak. 8572 trivial. 0 not checked. [2021-05-02 13:19:09,910 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:19:09,910 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467550808] [2021-05-02 13:19:09,910 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467550808] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:09,910 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038025187] [2021-05-02 13:19:09,910 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:19:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:10,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 17 conjunts are in the unsatisfiable core [2021-05-02 13:19:10,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:19:10,252 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,253 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,265 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,265 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,357 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,358 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,371 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,463 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,464 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,477 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,567 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,568 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,582 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,678 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,679 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,693 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,694 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,784 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,785 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,799 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,799 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,889 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,890 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,906 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,907 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,997 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:10,998 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,013 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,014 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,104 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,105 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,122 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,123 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,234 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,239 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,257 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,258 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,388 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,389 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,488 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,490 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,510 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,511 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,608 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,609 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,630 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,630 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,721 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,722 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,742 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 122075 backedges. 39 proven. 113464 refuted. 0 times theorem prover too weak. 8572 trivial. 0 not checked. [2021-05-02 13:19:11,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038025187] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:11,753 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:19:11,753 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2021-05-02 13:19:11,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922311690] [2021-05-02 13:19:11,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-02 13:19:11,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:19:11,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-02 13:19:11,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=697, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 13:19:11,755 INFO L87 Difference]: Start difference. First operand 1307 states and 1345 transitions. Second operand has 34 states, 34 states have (on average 8.029411764705882) internal successors, (273), 33 states have internal predecessors, (273), 29 states have call successors, (32), 4 states have call predecessors, (32), 2 states have return successors, (29), 27 states have call predecessors, (29), 28 states have call successors, (29) [2021-05-02 13:19:12,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:19:12,124 INFO L93 Difference]: Finished difference Result 1447 states and 1490 transitions. [2021-05-02 13:19:12,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-02 13:19:12,125 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 8.029411764705882) internal successors, (273), 33 states have internal predecessors, (273), 29 states have call successors, (32), 4 states have call predecessors, (32), 2 states have return successors, (29), 27 states have call predecessors, (29), 28 states have call successors, (29) Word has length 1005 [2021-05-02 13:19:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:19:12,127 INFO L225 Difference]: With dead ends: 1447 [2021-05-02 13:19:12,127 INFO L226 Difference]: Without dead ends: 1374 [2021-05-02 13:19:12,128 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1053 GetRequests, 1020 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 367.0ms TimeCoverageRelationStatistics Valid=429, Invalid=761, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 13:19:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2021-05-02 13:19:12,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2021-05-02 13:19:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1342 states have (on average 1.0171385991058122) internal successors, (1365), 1345 states have internal predecessors, (1365), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2021-05-02 13:19:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1414 transitions. [2021-05-02 13:19:12,157 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1414 transitions. Word has length 1005 [2021-05-02 13:19:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:19:12,158 INFO L480 AbstractCegarLoop]: Abstraction has 1374 states and 1414 transitions. [2021-05-02 13:19:12,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 8.029411764705882) internal successors, (273), 33 states have internal predecessors, (273), 29 states have call successors, (32), 4 states have call predecessors, (32), 2 states have return successors, (29), 27 states have call predecessors, (29), 28 states have call successors, (29) [2021-05-02 13:19:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1414 transitions. [2021-05-02 13:19:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2021-05-02 13:19:12,165 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:19:12,165 INFO L523 BasicCegarLoop]: trace histogram [300, 300, 300, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:19:12,365 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2021-05-02 13:19:12,366 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:19:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:19:12,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1383945980, now seen corresponding path program 14 times [2021-05-02 13:19:12,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:19:12,366 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487613874] [2021-05-02 13:19:12,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:19:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:19:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:19:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:19:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:19:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:19:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 13:19:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 13:19:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 13:19:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 13:19:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 13:19:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 13:19:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 13:19:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 13:19:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-02 13:19:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-02 13:19:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-02 13:19:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 140177 backedges. 42 proven. 130921 refuted. 0 times theorem prover too weak. 9214 trivial. 0 not checked. [2021-05-02 13:19:12,791 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:19:12,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487613874] [2021-05-02 13:19:12,792 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487613874] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:12,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916536992] [2021-05-02 13:19:12,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:19:13,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 13:19:13,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:19:13,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 1705 conjuncts, 18 conjunts are in the unsatisfiable core [2021-05-02 13:19:13,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:19:13,135 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,136 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,146 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,147 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,238 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,249 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,250 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,342 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,343 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,358 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,359 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,456 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,471 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,472 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,566 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,567 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,580 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,673 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,674 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,689 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,690 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,782 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,783 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,798 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,799 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,906 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,907 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,923 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:13,924 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,017 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,035 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,126 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,127 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,144 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,145 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,238 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,239 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,258 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,258 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,349 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,350 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,370 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,460 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,461 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,481 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,482 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,577 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,578 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,599 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,600 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,692 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,712 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 140177 backedges. 42 proven. 130921 refuted. 0 times theorem prover too weak. 9214 trivial. 0 not checked. [2021-05-02 13:19:14,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916536992] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:14,723 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:19:14,723 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2021-05-02 13:19:14,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709460580] [2021-05-02 13:19:14,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-02 13:19:14,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:19:14,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-02 13:19:14,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=783, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 13:19:14,724 INFO L87 Difference]: Start difference. First operand 1374 states and 1414 transitions. Second operand has 36 states, 36 states have (on average 8.083333333333334) internal successors, (291), 35 states have internal predecessors, (291), 31 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (31), 29 states have call predecessors, (31), 30 states have call successors, (31) [2021-05-02 13:19:15,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:19:15,073 INFO L93 Difference]: Finished difference Result 1514 states and 1559 transitions. [2021-05-02 13:19:15,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-02 13:19:15,074 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 8.083333333333334) internal successors, (291), 35 states have internal predecessors, (291), 31 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (31), 29 states have call predecessors, (31), 30 states have call successors, (31) Word has length 1076 [2021-05-02 13:19:15,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:19:15,076 INFO L225 Difference]: With dead ends: 1514 [2021-05-02 13:19:15,076 INFO L226 Difference]: Without dead ends: 1441 [2021-05-02 13:19:15,077 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1092 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 369.6ms TimeCoverageRelationStatistics Valid=481, Invalid=851, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 13:19:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2021-05-02 13:19:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1441. [2021-05-02 13:19:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1408 states have (on average 1.0170454545454546) internal successors, (1432), 1411 states have internal predecessors, (1432), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-05-02 13:19:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 1483 transitions. [2021-05-02 13:19:15,115 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 1483 transitions. Word has length 1076 [2021-05-02 13:19:15,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:19:15,116 INFO L480 AbstractCegarLoop]: Abstraction has 1441 states and 1483 transitions. [2021-05-02 13:19:15,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 8.083333333333334) internal successors, (291), 35 states have internal predecessors, (291), 31 states have call successors, (34), 4 states have call predecessors, (34), 2 states have return successors, (31), 29 states have call predecessors, (31), 30 states have call successors, (31) [2021-05-02 13:19:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1483 transitions. [2021-05-02 13:19:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1148 [2021-05-02 13:19:15,124 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:19:15,124 INFO L523 BasicCegarLoop]: trace histogram [320, 320, 320, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:19:15,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:19:15,325 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:19:15,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:19:15,325 INFO L82 PathProgramCache]: Analyzing trace with hash -688863167, now seen corresponding path program 15 times [2021-05-02 13:19:15,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:19:15,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282471804] [2021-05-02 13:19:15,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:19:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:19:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:19:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:19:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:19:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:19:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 13:19:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 13:19:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 13:19:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 13:19:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 13:19:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 13:19:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 13:19:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 13:19:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-02 13:19:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-02 13:19:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-02 13:19:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-02 13:19:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 159530 backedges. 45 proven. 149625 refuted. 0 times theorem prover too weak. 9860 trivial. 0 not checked. [2021-05-02 13:19:15,741 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:19:15,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282471804] [2021-05-02 13:19:15,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282471804] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:15,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277701717] [2021-05-02 13:19:15,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:19:16,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 134 check-sat command(s) [2021-05-02 13:19:16,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:19:16,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 1811 conjuncts, 19 conjunts are in the unsatisfiable core [2021-05-02 13:19:16,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:19:16,648 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:16,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:16,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:16,661 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:16,752 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:16,753 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:16,766 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:16,767 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:16,859 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:16,860 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:16,872 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:16,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:16,964 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:16,965 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:16,977 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:16,978 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,086 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,088 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,102 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,196 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,197 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,213 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,214 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,310 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,311 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,327 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,328 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,419 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,421 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,438 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,439 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,528 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,530 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,546 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,547 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,639 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,656 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,657 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,752 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,753 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,772 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,773 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,866 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,867 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,886 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,887 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,978 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,979 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:17,999 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:18,000 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:18,094 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:18,095 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:18,116 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:18,117 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:18,208 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:18,209 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:18,230 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:18,231 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:18,324 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:18,325 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:18,346 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 159530 backedges. 45 proven. 149625 refuted. 0 times theorem prover too weak. 9860 trivial. 0 not checked. [2021-05-02 13:19:18,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277701717] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:18,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:19:18,360 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2021-05-02 13:19:18,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042244267] [2021-05-02 13:19:18,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-02 13:19:18,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:19:18,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-02 13:19:18,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=874, Unknown=0, NotChecked=0, Total=1406 [2021-05-02 13:19:18,361 INFO L87 Difference]: Start difference. First operand 1441 states and 1483 transitions. Second operand has 38 states, 38 states have (on average 8.131578947368421) internal successors, (309), 37 states have internal predecessors, (309), 33 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 31 states have call predecessors, (33), 32 states have call successors, (33) [2021-05-02 13:19:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:19:18,827 INFO L93 Difference]: Finished difference Result 1581 states and 1628 transitions. [2021-05-02 13:19:18,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-02 13:19:18,828 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 8.131578947368421) internal successors, (309), 37 states have internal predecessors, (309), 33 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 31 states have call predecessors, (33), 32 states have call successors, (33) Word has length 1147 [2021-05-02 13:19:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:19:18,830 INFO L225 Difference]: With dead ends: 1581 [2021-05-02 13:19:18,830 INFO L226 Difference]: Without dead ends: 1508 [2021-05-02 13:19:18,830 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1201 GetRequests, 1164 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 422.2ms TimeCoverageRelationStatistics Valid=536, Invalid=946, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 13:19:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2021-05-02 13:19:18,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1508. [2021-05-02 13:19:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1474 states have (on average 1.0169606512890095) internal successors, (1499), 1477 states have internal predecessors, (1499), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2021-05-02 13:19:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1552 transitions. [2021-05-02 13:19:18,862 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1552 transitions. Word has length 1147 [2021-05-02 13:19:18,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:19:18,863 INFO L480 AbstractCegarLoop]: Abstraction has 1508 states and 1552 transitions. [2021-05-02 13:19:18,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 8.131578947368421) internal successors, (309), 37 states have internal predecessors, (309), 33 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (33), 31 states have call predecessors, (33), 32 states have call successors, (33) [2021-05-02 13:19:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1552 transitions. [2021-05-02 13:19:18,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1219 [2021-05-02 13:19:18,871 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:19:18,872 INFO L523 BasicCegarLoop]: trace histogram [340, 340, 340, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:19:19,072 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:19:19,072 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:19:19,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:19:19,073 INFO L82 PathProgramCache]: Analyzing trace with hash 722925404, now seen corresponding path program 16 times [2021-05-02 13:19:19,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:19:19,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978714041] [2021-05-02 13:19:19,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:19:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:19:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:19:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:19:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:19:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:19:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 13:19:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 13:19:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 13:19:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 13:19:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 13:19:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 13:19:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 13:19:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 13:19:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-02 13:19:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-02 13:19:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-02 13:19:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-02 13:19:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1143 [2021-05-02 13:19:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:19,519 INFO L134 CoverageAnalysis]: Checked inductivity of 180134 backedges. 48 proven. 169576 refuted. 0 times theorem prover too weak. 10510 trivial. 0 not checked. [2021-05-02 13:19:19,520 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:19:19,520 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978714041] [2021-05-02 13:19:19,520 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978714041] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:19,520 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478088039] [2021-05-02 13:19:19,520 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:19:19,770 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 13:19:19,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:19:19,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 1880 conjuncts, 40 conjunts are in the unsatisfiable core [2021-05-02 13:19:19,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:19:19,851 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:19,852 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:19,869 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:19,870 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:19,888 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:19,889 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:19,908 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:19,909 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:19,928 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:19,929 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:19,949 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:19,950 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:19,971 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:19,972 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:19,993 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:19,994 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,043 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,044 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,074 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,076 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,106 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,107 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,132 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,159 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,161 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,188 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,188 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,217 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,245 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,246 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,276 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,277 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,307 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,308 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,362 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,363 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,381 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,495 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,496 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,516 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,517 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,630 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,631 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,652 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,653 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,760 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,761 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,782 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,783 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,891 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,892 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,914 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:20,915 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,023 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,024 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,048 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,049 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,160 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,161 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,183 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,184 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,295 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,296 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,334 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,335 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,447 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,472 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,473 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,589 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,616 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,732 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,733 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,761 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,879 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,880 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,910 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:21,911 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,035 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,064 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,065 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,180 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,208 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,209 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,325 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,326 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,355 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,356 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,477 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,511 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,512 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,629 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,630 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 180134 backedges. 580 proven. 169634 refuted. 0 times theorem prover too weak. 9920 trivial. 0 not checked. [2021-05-02 13:19:22,673 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478088039] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:22,673 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:19:22,673 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 42] total 61 [2021-05-02 13:19:22,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089444565] [2021-05-02 13:19:22,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-05-02 13:19:22,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:19:22,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-05-02 13:19:22,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=844, Invalid=2816, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 13:19:22,675 INFO L87 Difference]: Start difference. First operand 1508 states and 1552 transitions. Second operand has 61 states, 61 states have (on average 6.278688524590164) internal successors, (383), 60 states have internal predecessors, (383), 35 states have call successors, (39), 4 states have call predecessors, (39), 2 states have return successors, (36), 34 states have call predecessors, (36), 34 states have call successors, (36) [2021-05-02 13:19:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:19:23,571 INFO L93 Difference]: Finished difference Result 1648 states and 1697 transitions. [2021-05-02 13:19:23,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-02 13:19:23,571 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 6.278688524590164) internal successors, (383), 60 states have internal predecessors, (383), 35 states have call successors, (39), 4 states have call predecessors, (39), 2 states have return successors, (36), 34 states have call predecessors, (36), 34 states have call successors, (36) Word has length 1218 [2021-05-02 13:19:23,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:19:23,575 INFO L225 Difference]: With dead ends: 1648 [2021-05-02 13:19:23,575 INFO L226 Difference]: Without dead ends: 1575 [2021-05-02 13:19:23,576 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1295 GetRequests, 1183 SyntacticMatches, 32 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2629 ImplicationChecksByTransitivity, 1692.8ms TimeCoverageRelationStatistics Valid=2048, Invalid=4594, Unknown=0, NotChecked=0, Total=6642 [2021-05-02 13:19:23,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2021-05-02 13:19:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2021-05-02 13:19:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1540 states have (on average 1.016883116883117) internal successors, (1566), 1543 states have internal predecessors, (1566), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2021-05-02 13:19:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1621 transitions. [2021-05-02 13:19:23,617 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1621 transitions. Word has length 1218 [2021-05-02 13:19:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:19:23,618 INFO L480 AbstractCegarLoop]: Abstraction has 1575 states and 1621 transitions. [2021-05-02 13:19:23,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 61 states, 61 states have (on average 6.278688524590164) internal successors, (383), 60 states have internal predecessors, (383), 35 states have call successors, (39), 4 states have call predecessors, (39), 2 states have return successors, (36), 34 states have call predecessors, (36), 34 states have call successors, (36) [2021-05-02 13:19:23,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1621 transitions. [2021-05-02 13:19:23,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1290 [2021-05-02 13:19:23,629 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:19:23,629 INFO L523 BasicCegarLoop]: trace histogram [360, 360, 360, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:19:23,842 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2021-05-02 13:19:23,842 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:19:23,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:19:23,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1522074655, now seen corresponding path program 17 times [2021-05-02 13:19:23,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:19:23,843 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269009303] [2021-05-02 13:19:23,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:19:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:19:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:19:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:19:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:19:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:19:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 13:19:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 13:19:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 13:19:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 13:19:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 13:19:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 13:19:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 13:19:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 13:19:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-02 13:19:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-02 13:19:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-02 13:19:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-02 13:19:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1143 [2021-05-02 13:19:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1214 [2021-05-02 13:19:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 201989 backedges. 51 proven. 190774 refuted. 0 times theorem prover too weak. 11164 trivial. 0 not checked. [2021-05-02 13:19:24,342 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:19:24,342 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269009303] [2021-05-02 13:19:24,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269009303] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:24,342 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817038099] [2021-05-02 13:19:24,342 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:19:25,326 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 156 check-sat command(s) [2021-05-02 13:19:25,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:19:25,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 2023 conjuncts, 43 conjunts are in the unsatisfiable core [2021-05-02 13:19:25,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:19:25,443 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,444 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,459 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,460 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,540 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,541 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,556 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,557 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,582 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,583 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,602 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,603 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,623 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,624 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,646 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,648 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,675 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,700 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,701 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,724 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,725 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,750 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,751 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,776 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,777 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,803 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,804 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,830 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,831 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,858 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,859 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,887 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,888 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,916 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,917 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,946 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,947 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,977 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:25,978 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,009 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,043 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,044 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,077 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,078 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,139 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,163 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,164 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,187 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,188 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,300 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,301 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,324 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,325 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,441 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,442 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,465 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,466 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,596 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,597 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,621 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,622 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,734 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,735 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,760 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,761 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,874 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,898 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:26,899 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,012 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,013 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,039 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,040 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,155 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,181 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,182 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,298 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,299 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,326 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,327 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,447 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,474 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,475 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,592 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,593 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,621 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,622 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,743 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,744 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,774 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,774 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,891 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,892 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,920 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:27,921 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:28,054 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:28,055 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:28,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:28,086 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:28,205 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:28,206 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:28,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:28,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:28,357 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:28,358 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:28,389 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 201989 backedges. 741 proven. 190794 refuted. 0 times theorem prover too weak. 10454 trivial. 0 not checked. [2021-05-02 13:19:28,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817038099] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:28,403 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:19:28,404 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 44] total 64 [2021-05-02 13:19:28,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907216766] [2021-05-02 13:19:28,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-02 13:19:28,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:19:28,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-02 13:19:28,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=893, Invalid=3139, Unknown=0, NotChecked=0, Total=4032 [2021-05-02 13:19:28,406 INFO L87 Difference]: Start difference. First operand 1575 states and 1621 transitions. Second operand has 64 states, 64 states have (on average 6.265625) internal successors, (401), 63 states have internal predecessors, (401), 37 states have call successors, (41), 4 states have call predecessors, (41), 2 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2021-05-02 13:19:29,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:19:29,999 INFO L93 Difference]: Finished difference Result 1715 states and 1766 transitions. [2021-05-02 13:19:30,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-05-02 13:19:30,000 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 6.265625) internal successors, (401), 63 states have internal predecessors, (401), 37 states have call successors, (41), 4 states have call predecessors, (41), 2 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) Word has length 1289 [2021-05-02 13:19:30,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:19:30,002 INFO L225 Difference]: With dead ends: 1715 [2021-05-02 13:19:30,002 INFO L226 Difference]: Without dead ends: 1642 [2021-05-02 13:19:30,003 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1411 GetRequests, 1256 SyntacticMatches, 30 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5143 ImplicationChecksByTransitivity, 2394.9ms TimeCoverageRelationStatistics Valid=5372, Invalid=10630, Unknown=0, NotChecked=0, Total=16002 [2021-05-02 13:19:30,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2021-05-02 13:19:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1642. [2021-05-02 13:19:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1606 states have (on average 1.0168119551681196) internal successors, (1633), 1609 states have internal predecessors, (1633), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2021-05-02 13:19:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 1690 transitions. [2021-05-02 13:19:30,038 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 1690 transitions. Word has length 1289 [2021-05-02 13:19:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:19:30,039 INFO L480 AbstractCegarLoop]: Abstraction has 1642 states and 1690 transitions. [2021-05-02 13:19:30,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 64 states, 64 states have (on average 6.265625) internal successors, (401), 63 states have internal predecessors, (401), 37 states have call successors, (41), 4 states have call predecessors, (41), 2 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2021-05-02 13:19:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 1690 transitions. [2021-05-02 13:19:30,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1361 [2021-05-02 13:19:30,049 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:19:30,049 INFO L523 BasicCegarLoop]: trace histogram [380, 380, 380, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:19:30,249 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2021-05-02 13:19:30,250 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:19:30,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:19:30,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1329958980, now seen corresponding path program 18 times [2021-05-02 13:19:30,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:19:30,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337538419] [2021-05-02 13:19:30,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:19:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:19:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:19:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-05-02 13:19:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-05-02 13:19:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-05-02 13:19:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-05-02 13:19:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-05-02 13:19:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2021-05-02 13:19:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 504 [2021-05-02 13:19:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2021-05-02 13:19:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2021-05-02 13:19:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2021-05-02 13:19:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2021-05-02 13:19:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 859 [2021-05-02 13:19:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2021-05-02 13:19:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1001 [2021-05-02 13:19:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1072 [2021-05-02 13:19:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1143 [2021-05-02 13:19:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1214 [2021-05-02 13:19:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1285 [2021-05-02 13:19:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:19:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 225095 backedges. 54 proven. 213219 refuted. 0 times theorem prover too weak. 11822 trivial. 0 not checked. [2021-05-02 13:19:30,728 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:19:30,728 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337538419] [2021-05-02 13:19:30,728 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337538419] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:30,728 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442228259] [2021-05-02 13:19:30,728 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:19:31,362 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 145 check-sat command(s) [2021-05-02 13:19:31,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 13:19:31,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 22 conjunts are in the unsatisfiable core [2021-05-02 13:19:31,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:19:31,485 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,486 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,497 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,498 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,590 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,591 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,602 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,603 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,696 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,697 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,709 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,709 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,802 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,803 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,817 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,910 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,911 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,924 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:31,925 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,033 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,033 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,126 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,127 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,142 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,143 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,238 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,254 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,255 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,347 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,348 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,364 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,365 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,456 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,474 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,475 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,583 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,601 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,602 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,693 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,694 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,712 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,713 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,804 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,805 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,825 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,826 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,918 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,919 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,939 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:32,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,032 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,033 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,055 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,056 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,155 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,180 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,181 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,283 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,284 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,308 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,309 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,405 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,406 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,430 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,431 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,531 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,532 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,558 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:19:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 225095 backedges. 54 proven. 213219 refuted. 0 times theorem prover too weak. 11822 trivial. 0 not checked. [2021-05-02 13:19:33,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442228259] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:19:33,574 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:19:33,574 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2021-05-02 13:19:33,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238608553] [2021-05-02 13:19:33,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-02 13:19:33,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:19:33,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-02 13:19:33,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=1177, Unknown=0, NotChecked=0, Total=1892 [2021-05-02 13:19:33,575 INFO L87 Difference]: Start difference. First operand 1642 states and 1690 transitions. Second operand has 44 states, 44 states have (on average 8.25) internal successors, (363), 43 states have internal predecessors, (363), 39 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 37 states have call predecessors, (39), 38 states have call successors, (39) [2021-05-02 13:19:34,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:19:34,035 INFO L93 Difference]: Finished difference Result 1782 states and 1835 transitions. [2021-05-02 13:19:34,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-02 13:19:34,036 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 8.25) internal successors, (363), 43 states have internal predecessors, (363), 39 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 37 states have call predecessors, (39), 38 states have call successors, (39) Word has length 1360 [2021-05-02 13:19:34,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:19:34,038 INFO L225 Difference]: With dead ends: 1782 [2021-05-02 13:19:34,038 INFO L226 Difference]: Without dead ends: 1709 [2021-05-02 13:19:34,039 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 1423 GetRequests, 1380 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 527.6ms TimeCoverageRelationStatistics Valid=719, Invalid=1261, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 13:19:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2021-05-02 13:19:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1709. [2021-05-02 13:19:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1672 states have (on average 1.0167464114832536) internal successors, (1700), 1675 states have internal predecessors, (1700), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2021-05-02 13:19:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 1759 transitions. [2021-05-02 13:19:34,077 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 1759 transitions. Word has length 1360 [2021-05-02 13:19:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:19:34,077 INFO L480 AbstractCegarLoop]: Abstraction has 1709 states and 1759 transitions. [2021-05-02 13:19:34,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 8.25) internal successors, (363), 43 states have internal predecessors, (363), 39 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 37 states have call predecessors, (39), 38 states have call successors, (39) [2021-05-02 13:19:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 1759 transitions. [2021-05-02 13:19:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1432 [2021-05-02 13:19:34,089 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:19:34,089 INFO L523 BasicCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:19:34,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2021-05-02 13:19:34,294 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:19:34,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:19:34,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1961863295, now seen corresponding path program 19 times [2021-05-02 13:19:34,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:19:34,294 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866161706] [2021-05-02 13:19:34,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:19:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 13:19:34,476 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 13:19:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 13:19:34,676 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 13:19:34,914 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-02 13:19:34,914 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-02 13:19:34,914 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-05-02 13:19:35,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 01:19:35 BoogieIcfgContainer [2021-05-02 13:19:35,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 13:19:35,143 INFO L168 Benchmark]: Toolchain (without parser) took 100677.97 ms. Allocated memory was 202.4 MB in the beginning and 746.6 MB in the end (delta: 544.2 MB). Free memory was 167.9 MB in the beginning and 651.6 MB in the end (delta: -483.7 MB). Peak memory consumption was 447.8 MB. Max. memory is 8.0 GB. [2021-05-02 13:19:35,143 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 202.4 MB. Free memory is still 184.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 13:19:35,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.49 ms. Allocated memory is still 202.4 MB. Free memory was 167.5 MB in the beginning and 157.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-05-02 13:19:35,149 INFO L168 Benchmark]: Boogie Preprocessor took 56.17 ms. Allocated memory is still 202.4 MB. Free memory was 157.7 MB in the beginning and 185.5 MB in the end (delta: -27.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-05-02 13:19:35,149 INFO L168 Benchmark]: RCFGBuilder took 320.36 ms. Allocated memory is still 202.4 MB. Free memory was 185.5 MB in the beginning and 169.3 MB in the end (delta: 16.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-05-02 13:19:35,149 INFO L168 Benchmark]: TraceAbstraction took 100122.99 ms. Allocated memory was 202.4 MB in the beginning and 746.6 MB in the end (delta: 544.2 MB). Free memory was 168.8 MB in the beginning and 651.6 MB in the end (delta: -482.8 MB). Peak memory consumption was 447.9 MB. Max. memory is 8.0 GB. [2021-05-02 13:19:35,149 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 202.4 MB. Free memory is still 184.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 171.49 ms. Allocated memory is still 202.4 MB. Free memory was 167.5 MB in the beginning and 157.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 56.17 ms. Allocated memory is still 202.4 MB. Free memory was 157.7 MB in the beginning and 185.5 MB in the end (delta: -27.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 320.36 ms. Allocated memory is still 202.4 MB. Free memory was 185.5 MB in the beginning and 169.3 MB in the end (delta: 16.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 100122.99 ms. Allocated memory was 202.4 MB in the beginning and 746.6 MB in the end (delta: 544.2 MB). Free memory was 168.8 MB in the beginning and 651.6 MB in the end (delta: -482.8 MB). Peak memory consumption was 447.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L9] int last ; [L18] int SIZE = 20; VAL [\old(last)=52, \old(SIZE)=51, last=0, SIZE=20] [L20] last = __VERIFIER_nondet_int() [L21] CALL assume_abort_if_not(last > 0) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L6] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L21] RET assume_abort_if_not(last > 0) VAL [\old(last)=0, last=22, SIZE=20] [L22] int a=0,b=0,c=0,st=0,d=0; VAL [\old(last)=0, a=0, b=0, c=0, d=0, last=22, SIZE=20, st=0] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=0, b=0, c=0, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=0, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=1, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=1, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=2, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=2, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=3, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=3, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=4, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=4, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=5, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=5, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=6, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=6, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=7, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=7, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=8, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=8, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=9, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=9, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=10, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=10, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=11, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=11, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=12, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=12, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=13, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=13, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=14, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=14, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=15, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=15, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=16, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=16, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=17, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=17, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=18, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=18, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=19, d=0, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=0, b=0, c=19, d=0, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=0, b=0, c=20, d=0, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=2, b=2, c=0, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=0, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=1, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=1, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=2, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=2, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=3, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=3, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=4, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=4, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=5, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=5, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=6, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=6, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=7, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=7, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=8, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=8, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=9, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=9, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=10, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=10, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=11, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=11, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=12, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=12, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=13, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=13, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=14, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=14, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=15, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=15, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=16, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=16, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=17, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=17, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=18, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=18, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=19, d=1, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=2, b=2, c=19, d=1, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=2, b=2, c=20, d=1, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=4, b=4, c=0, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=0, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=1, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=1, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=2, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=2, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=3, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=3, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=4, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=4, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=5, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=5, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=6, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=6, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=7, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=7, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=8, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=8, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=9, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=9, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=10, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=10, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=11, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=11, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=12, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=12, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=13, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=13, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=14, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=14, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=15, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=15, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=16, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=16, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=17, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=17, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=18, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=18, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=19, d=2, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=4, b=4, c=19, d=2, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=4, b=4, c=20, d=2, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=6, b=6, c=0, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=0, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=1, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=1, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=2, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=2, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=3, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=3, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=4, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=4, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=5, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=5, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=6, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=6, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=7, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=7, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=8, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=8, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=9, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=9, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=10, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=10, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=11, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=11, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=12, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=12, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=13, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=13, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=14, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=14, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=15, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=15, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=16, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=16, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=17, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=17, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=18, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=18, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=19, d=3, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=6, b=6, c=19, d=3, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=6, b=6, c=20, d=3, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=8, b=8, c=0, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=0, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=1, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=1, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=2, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=2, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=3, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=3, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=4, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=4, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=5, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=5, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=6, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=6, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=7, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=7, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=8, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=8, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=9, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=9, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=10, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=10, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=11, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=11, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=12, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=12, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=13, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=13, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=14, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=14, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=15, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=15, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=16, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=16, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=17, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=17, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=18, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=18, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=19, d=4, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=8, b=8, c=19, d=4, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=8, b=8, c=20, d=4, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=10, b=10, c=0, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=0, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=1, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=1, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=2, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=2, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=3, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=3, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=4, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=4, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=5, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=5, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=6, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=6, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=7, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=7, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=8, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=8, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=9, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=9, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=10, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=10, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=11, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=11, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=12, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=12, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=13, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=13, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=14, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=14, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=15, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=15, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=16, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=16, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=17, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=17, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=18, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=18, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=19, d=5, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=10, b=10, c=19, d=5, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=10, b=10, c=20, d=5, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=12, b=12, c=0, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=0, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=1, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=1, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=2, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=2, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=3, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=3, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=4, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=4, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=5, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=5, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=6, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=6, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=7, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=7, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=8, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=8, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=9, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=9, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=10, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=10, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=11, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=11, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=12, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=12, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=13, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=13, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=14, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=14, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=15, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=15, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=16, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=16, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=17, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=17, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=18, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=18, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=19, d=6, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=12, b=12, c=19, d=6, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=12, b=12, c=20, d=6, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=14, b=14, c=0, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=0, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=1, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=1, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=2, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=2, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=3, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=3, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=4, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=4, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=5, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=5, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=6, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=6, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=7, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=7, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=8, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=8, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=9, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=9, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=10, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=10, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=11, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=11, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=12, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=12, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=13, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=13, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=14, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=14, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=15, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=15, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=16, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=16, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=17, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=17, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=18, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=18, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=19, d=7, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=14, b=14, c=19, d=7, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=14, b=14, c=20, d=7, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=16, b=16, c=0, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=0, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=1, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=1, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=2, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=2, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=3, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=3, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=4, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=4, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=5, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=5, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=6, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=6, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=7, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=7, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=8, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=8, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=9, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=9, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=10, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=10, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=11, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=11, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=12, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=12, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=13, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=13, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=14, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=14, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=15, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=15, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=16, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=16, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=17, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=17, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=18, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=18, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=19, d=8, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=16, b=16, c=19, d=8, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=16, b=16, c=20, d=8, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=18, b=18, c=0, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=0, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=1, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=1, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=2, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=2, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=3, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=3, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=4, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=4, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=5, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=5, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=6, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=6, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=7, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=7, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=8, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=8, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=9, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=9, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=10, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=10, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=11, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=11, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=12, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=12, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=13, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=13, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=14, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=14, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=15, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=15, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=16, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=16, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=17, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=17, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=18, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=18, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=19, d=9, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=18, b=18, c=19, d=9, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=18, b=18, c=20, d=9, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=20, b=20, c=0, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=0, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=1, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=1, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=2, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=2, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=3, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=3, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=4, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=4, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=5, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=5, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=6, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=6, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=7, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=7, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=8, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=8, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=9, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=9, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=10, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=10, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=11, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=11, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=12, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=12, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=13, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=13, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=14, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=14, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=15, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=15, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=16, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=16, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=17, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=17, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=18, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=18, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=19, d=10, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=20, b=20, c=19, d=10, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=20, b=20, c=20, d=10, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=22, b=22, c=0, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=0, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=1, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=1, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=2, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=2, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=3, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=3, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=4, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=4, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=5, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=5, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=6, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=6, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=7, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=7, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=8, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=8, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=9, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=9, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=10, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=10, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=11, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=11, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=12, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=12, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=13, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=13, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=14, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=14, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=15, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=15, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=16, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=16, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=17, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=17, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=18, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=18, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=19, d=11, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=22, b=22, c=19, d=11, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=22, b=22, c=20, d=11, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=24, b=24, c=0, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=0, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=1, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=1, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=2, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=2, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=3, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=3, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=4, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=4, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=5, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=5, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=6, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=6, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=7, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=7, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=8, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=8, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=9, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=9, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=10, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=10, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=11, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=11, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=12, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=12, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=13, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=13, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=14, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=14, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=15, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=15, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=16, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=16, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=17, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=17, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=18, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=18, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=19, d=12, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=24, b=24, c=19, d=12, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=24, b=24, c=20, d=12, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=26, b=26, c=0, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=0, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=1, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=1, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=2, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=2, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=3, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=3, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=4, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=4, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=5, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=5, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=6, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=6, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=7, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=7, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=8, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=8, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=9, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=9, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=10, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=10, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=11, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=11, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=12, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=12, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=13, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=13, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=14, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=14, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=15, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=15, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=16, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=16, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=17, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=17, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=18, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=18, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=19, d=13, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=26, b=26, c=19, d=13, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=26, b=26, c=20, d=13, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=28, b=28, c=0, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=0, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=1, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=1, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=2, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=2, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=3, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=3, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=4, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=4, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=5, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=5, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=6, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=6, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=7, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=7, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=8, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=8, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=9, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=9, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=10, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=10, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=11, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=11, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=12, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=12, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=13, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=13, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=14, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=14, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=15, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=15, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=16, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=16, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=17, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=17, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=18, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=18, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=19, d=14, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=28, b=28, c=19, d=14, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=28, b=28, c=20, d=14, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=30, b=30, c=0, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=0, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=1, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=1, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=2, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=2, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=3, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=3, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=4, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=4, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=5, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=5, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=6, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=6, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=7, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=7, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=8, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=8, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=9, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=9, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=10, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=10, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=11, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=11, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=12, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=12, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=13, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=13, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=14, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=14, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=15, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=15, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=16, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=16, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=17, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=17, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=18, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=18, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=19, d=15, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=30, b=30, c=19, d=15, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=30, b=30, c=20, d=15, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=32, b=32, c=0, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=0, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=1, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=1, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=2, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=2, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=3, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=3, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=4, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=4, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=5, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=5, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=6, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=6, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=7, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=7, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=8, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=8, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=9, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=9, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=10, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=10, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=11, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=11, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=12, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=12, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=13, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=13, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=14, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=14, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=15, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=15, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=16, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=16, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=17, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=17, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=18, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=18, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=19, d=16, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=32, b=32, c=19, d=16, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=32, b=32, c=20, d=16, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=34, b=34, c=0, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=0, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=1, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=1, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=2, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=2, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=3, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=3, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=4, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=4, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=5, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=5, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=6, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=6, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=7, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=7, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=8, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=8, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=9, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=9, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=10, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=10, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=11, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=11, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=12, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=12, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=13, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=13, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=14, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=14, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=15, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=15, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=16, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=16, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=17, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=17, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=18, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=18, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=19, d=17, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=34, b=34, c=19, d=17, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=34, b=34, c=20, d=17, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=36, b=36, c=0, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=0, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=1, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=1, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=2, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=2, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=3, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=3, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=4, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=4, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=5, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=5, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=6, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=6, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=7, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=7, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=8, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=8, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=9, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=9, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=10, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=10, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=11, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=11, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=12, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=12, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=13, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=13, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=14, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=14, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=15, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=15, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=16, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=16, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=17, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=17, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=18, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=18, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=19, d=18, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=36, b=36, c=19, d=18, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=36, b=36, c=20, d=18, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=22, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=1, \old(last)=0, last=22, SIZE=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(last)=0, cond=1, last=22, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=22, SIZE=20, st=1] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [\old(last)=0, a=38, b=38, c=0, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=0, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=1, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=1, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=2, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=2, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=3, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=3, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=4, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=4, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=5, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=5, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=6, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=6, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=7, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=7, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=8, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=8, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=9, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=9, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=10, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=10, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=11, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=11, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=12, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=12, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=13, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=13, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=14, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=14, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=15, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=15, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=16, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=16, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=17, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=17, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=18, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=18, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=19, d=19, last=22, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [\old(last)=0, a=38, b=38, c=19, d=19, last=22, SIZE=20, st=1] [L25] c++ VAL [\old(last)=0, a=38, b=38, c=20, d=19, last=22, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [\old(last)=0, a=40, b=40, c=20, d=20, last=22, SIZE=20, st=1] [L37] COND TRUE d == SIZE [L38] a = 0 [L39] b = 1 VAL [\old(last)=0, a=0, b=1, c=20, d=20, last=22, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) VAL [\old(cond)=0, \old(last)=0, last=22, SIZE=20] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(last)=0, cond=0, last=22, SIZE=20] [L12] reach_error() VAL [\old(cond)=0, \old(last)=0, cond=0, last=22, SIZE=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 99860.0ms, OverallIterations: 53, TraceHistogramMax: 400, EmptinessCheckTime: 133.7ms, AutomataDifference: 34192.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1150 SDtfs, 10663 SDslu, 3181 SDs, 0 SdLazy, 26990 SolverSat, 2457 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11019.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18362 GetRequests, 15937 SyntacticMatches, 121 SemanticMatches, 2304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57560 ImplicationChecksByTransitivity, 35117.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1709occurred in iteration=52, InterpolantAutomatonStates: 1579, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1384.8ms AutomataMinimizationTime, 52 MinimizatonAttempts, 3808 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1061.7ms SsaConstructionTime, 6265.9ms SatisfiabilityAnalysisTime, 45195.2ms InterpolantComputationTime, 33717 NumberOfCodeBlocks, 32464 NumberOfCodeBlocksAsserted, 1007 NumberOfCheckSat, 32188 ConstructedInterpolants, 0 QuantifiedInterpolants, 180197 SizeOfPredicates, 111 NumberOfNonLiveVariables, 26819 ConjunctsInSsa, 844 ConjunctsInUnsatCore, 98 InterpolantComputations, 10 PerfectInterpolantSequences, 259851/3127656 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...