/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:43:49,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:43:49,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:43:49,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:43:49,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:43:49,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:43:49,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:43:49,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:43:49,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:43:49,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:43:49,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:43:49,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:43:49,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:43:49,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:43:49,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:43:49,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:43:49,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:43:49,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:43:49,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:43:49,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:43:49,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:43:49,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:43:49,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:43:49,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:43:49,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:43:49,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:43:49,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:43:49,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:43:49,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:43:49,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:43:49,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:43:49,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:43:49,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:43:49,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:43:49,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:43:49,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:43:49,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:43:49,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:43:49,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:43:49,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:43:49,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:43:49,734 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:43:49,761 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:43:49,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:43:49,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:43:49,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:43:49,763 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:43:49,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:43:49,764 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:43:49,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:43:49,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:43:49,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:43:49,765 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:43:49,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:43:49,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:43:49,765 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:43:49,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:43:49,766 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:43:49,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:43:49,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:43:49,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:43:49,766 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:43:49,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:43:49,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:43:49,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:43:49,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:43:49,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:43:49,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:43:49,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:43:49,768 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:43:49,768 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:43:49,768 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:43:50,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:43:50,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:43:50,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:43:50,279 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:43:50,280 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:43:50,281 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2020-09-04 13:43:50,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f24cca301/f295d57f2618430182b7122bc0e26b6f/FLAG32fe4b147 [2020-09-04 13:43:50,963 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:43:50,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2020-09-04 13:43:50,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f24cca301/f295d57f2618430182b7122bc0e26b6f/FLAG32fe4b147 [2020-09-04 13:43:51,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f24cca301/f295d57f2618430182b7122bc0e26b6f [2020-09-04 13:43:51,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:43:51,301 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:43:51,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:43:51,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:43:51,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:43:51,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:43:51" (1/1) ... [2020-09-04 13:43:51,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30a48022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:51, skipping insertion in model container [2020-09-04 13:43:51,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:43:51" (1/1) ... [2020-09-04 13:43:51,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:43:51,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:43:51,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:43:51,639 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:43:51,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:43:51,798 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:43:51,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:51 WrapperNode [2020-09-04 13:43:51,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:43:51,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:43:51,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:43:51,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:43:51,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:51" (1/1) ... [2020-09-04 13:43:51,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:51" (1/1) ... [2020-09-04 13:43:51,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:51" (1/1) ... [2020-09-04 13:43:51,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:51" (1/1) ... [2020-09-04 13:43:51,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:51" (1/1) ... [2020-09-04 13:43:51,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:51" (1/1) ... [2020-09-04 13:43:51,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:51" (1/1) ... [2020-09-04 13:43:51,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:43:51,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:43:51,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:43:51,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:43:51,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:51" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:43:51,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:43:51,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:43:51,928 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 13:43:51,928 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:43:51,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:43:51,928 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 13:43:51,929 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 13:43:51,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 13:43:51,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:43:51,929 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:43:51,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:43:51,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:43:52,493 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:43:52,493 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 13:43:52,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:43:52 BoogieIcfgContainer [2020-09-04 13:43:52,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:43:52,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:43:52,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:43:52,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:43:52,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:43:51" (1/3) ... [2020-09-04 13:43:52,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6183850d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:43:52, skipping insertion in model container [2020-09-04 13:43:52,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:51" (2/3) ... [2020-09-04 13:43:52,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6183850d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:43:52, skipping insertion in model container [2020-09-04 13:43:52,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:43:52" (3/3) ... [2020-09-04 13:43:52,511 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2020-09-04 13:43:52,522 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:43:52,533 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2020-09-04 13:43:52,556 INFO L251 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-09-04 13:43:52,586 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:43:52,587 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:43:52,587 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:43:52,587 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:43:52,587 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:43:52,587 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:43:52,588 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:43:52,588 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:43:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-09-04 13:43:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 13:43:52,621 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:52,622 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:52,623 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:52,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:52,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2019463306, now seen corresponding path program 1 times [2020-09-04 13:43:52,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:52,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323655358] [2020-09-04 13:43:52,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:52,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:52,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323655358] [2020-09-04 13:43:52,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:52,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 13:43:52,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505485043] [2020-09-04 13:43:52,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:43:52,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:52,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:43:52,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:43:52,937 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 4 states. [2020-09-04 13:43:53,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:53,087 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2020-09-04 13:43:53,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:43:53,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-09-04 13:43:53,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:53,104 INFO L225 Difference]: With dead ends: 93 [2020-09-04 13:43:53,105 INFO L226 Difference]: Without dead ends: 80 [2020-09-04 13:43:53,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:43:53,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-09-04 13:43:53,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-09-04 13:43:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-09-04 13:43:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2020-09-04 13:43:53,170 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2020-09-04 13:43:53,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:53,171 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2020-09-04 13:43:53,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:43:53,171 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2020-09-04 13:43:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:43:53,172 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:53,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:53,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:43:53,173 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:53,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:53,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1821150056, now seen corresponding path program 1 times [2020-09-04 13:43:53,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:53,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740189908] [2020-09-04 13:43:53,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:53,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740189908] [2020-09-04 13:43:53,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:53,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 13:43:53,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152624873] [2020-09-04 13:43:53,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:43:53,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:53,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:43:53,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:43:53,315 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 7 states. [2020-09-04 13:43:53,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:53,511 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2020-09-04 13:43:53,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:43:53,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-09-04 13:43:53,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:53,514 INFO L225 Difference]: With dead ends: 80 [2020-09-04 13:43:53,514 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 13:43:53,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:43:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 13:43:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-04 13:43:53,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 13:43:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2020-09-04 13:43:53,528 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2020-09-04 13:43:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:53,541 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2020-09-04 13:43:53,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:43:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2020-09-04 13:43:53,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:43:53,542 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:53,543 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:53,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:43:53,543 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:53,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:53,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2073610827, now seen corresponding path program 1 times [2020-09-04 13:43:53,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:53,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195001689] [2020-09-04 13:43:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:53,642 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195001689] [2020-09-04 13:43:53,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:53,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:43:53,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724902003] [2020-09-04 13:43:53,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:43:53,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:53,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:43:53,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:43:53,645 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 5 states. [2020-09-04 13:43:53,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:53,859 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2020-09-04 13:43:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:43:53,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-09-04 13:43:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:53,861 INFO L225 Difference]: With dead ends: 101 [2020-09-04 13:43:53,861 INFO L226 Difference]: Without dead ends: 99 [2020-09-04 13:43:53,862 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:43:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-09-04 13:43:53,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2020-09-04 13:43:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-04 13:43:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-09-04 13:43:53,873 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2020-09-04 13:43:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:53,874 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-09-04 13:43:53,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:43:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-09-04 13:43:53,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:43:53,875 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:53,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:53,875 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:43:53,876 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:53,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:53,876 INFO L82 PathProgramCache]: Analyzing trace with hash -142570686, now seen corresponding path program 1 times [2020-09-04 13:43:53,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:53,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108503035] [2020-09-04 13:43:53,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:53,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108503035] [2020-09-04 13:43:53,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:54,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:54,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120684808] [2020-09-04 13:43:54,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:54,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:54,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:54,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:54,008 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2020-09-04 13:43:54,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:54,177 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2020-09-04 13:43:54,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:43:54,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-09-04 13:43:54,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:54,179 INFO L225 Difference]: With dead ends: 76 [2020-09-04 13:43:54,179 INFO L226 Difference]: Without dead ends: 74 [2020-09-04 13:43:54,180 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:43:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-09-04 13:43:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-09-04 13:43:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-09-04 13:43:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2020-09-04 13:43:54,188 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2020-09-04 13:43:54,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:54,189 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2020-09-04 13:43:54,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-09-04 13:43:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:43:54,190 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:54,190 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:54,190 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:43:54,191 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:54,191 INFO L82 PathProgramCache]: Analyzing trace with hash 402497124, now seen corresponding path program 1 times [2020-09-04 13:43:54,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:54,192 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136710017] [2020-09-04 13:43:54,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:54,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136710017] [2020-09-04 13:43:54,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:54,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:54,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76166487] [2020-09-04 13:43:54,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:54,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:54,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:54,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:54,288 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 6 states. [2020-09-04 13:43:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:54,758 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2020-09-04 13:43:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 13:43:54,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-09-04 13:43:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:54,761 INFO L225 Difference]: With dead ends: 141 [2020-09-04 13:43:54,761 INFO L226 Difference]: Without dead ends: 139 [2020-09-04 13:43:54,762 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:43:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-09-04 13:43:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2020-09-04 13:43:54,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-09-04 13:43:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-09-04 13:43:54,773 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2020-09-04 13:43:54,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:54,773 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-09-04 13:43:54,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-09-04 13:43:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:43:54,775 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:54,775 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:54,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:43:54,775 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:54,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:54,776 INFO L82 PathProgramCache]: Analyzing trace with hash 406230933, now seen corresponding path program 1 times [2020-09-04 13:43:54,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:54,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049775444] [2020-09-04 13:43:54,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:54,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049775444] [2020-09-04 13:43:54,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:54,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:54,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805685082] [2020-09-04 13:43:54,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:54,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:54,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:54,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:54,876 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2020-09-04 13:43:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:55,227 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2020-09-04 13:43:55,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 13:43:55,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-09-04 13:43:55,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:55,229 INFO L225 Difference]: With dead ends: 108 [2020-09-04 13:43:55,229 INFO L226 Difference]: Without dead ends: 106 [2020-09-04 13:43:55,230 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:43:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-09-04 13:43:55,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2020-09-04 13:43:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-04 13:43:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2020-09-04 13:43:55,240 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2020-09-04 13:43:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:55,240 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2020-09-04 13:43:55,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2020-09-04 13:43:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:43:55,241 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:55,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:55,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:43:55,242 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:55,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:55,243 INFO L82 PathProgramCache]: Analyzing trace with hash -407487796, now seen corresponding path program 1 times [2020-09-04 13:43:55,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:55,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111760058] [2020-09-04 13:43:55,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:55,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111760058] [2020-09-04 13:43:55,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:55,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:55,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660934625] [2020-09-04 13:43:55,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:55,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:55,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:55,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:55,344 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2020-09-04 13:43:55,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:55,608 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2020-09-04 13:43:55,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:43:55,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-09-04 13:43:55,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:55,610 INFO L225 Difference]: With dead ends: 121 [2020-09-04 13:43:55,610 INFO L226 Difference]: Without dead ends: 119 [2020-09-04 13:43:55,611 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:43:55,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-09-04 13:43:55,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2020-09-04 13:43:55,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-09-04 13:43:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-09-04 13:43:55,619 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2020-09-04 13:43:55,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:55,620 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-09-04 13:43:55,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-09-04 13:43:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:43:55,621 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:55,621 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:55,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:43:55,622 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:55,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:55,622 INFO L82 PathProgramCache]: Analyzing trace with hash -291739827, now seen corresponding path program 1 times [2020-09-04 13:43:55,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:55,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150141715] [2020-09-04 13:43:55,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:55,687 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150141715] [2020-09-04 13:43:55,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:55,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:55,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417344541] [2020-09-04 13:43:55,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:55,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:55,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:55,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:55,689 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2020-09-04 13:43:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:55,894 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-09-04 13:43:55,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:43:55,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-09-04 13:43:55,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:55,896 INFO L225 Difference]: With dead ends: 77 [2020-09-04 13:43:55,896 INFO L226 Difference]: Without dead ends: 75 [2020-09-04 13:43:55,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:43:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-04 13:43:55,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-09-04 13:43:55,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-09-04 13:43:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-09-04 13:43:55,904 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2020-09-04 13:43:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:55,905 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-09-04 13:43:55,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-09-04 13:43:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-09-04 13:43:55,906 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:55,906 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:55,906 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 13:43:55,907 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:55,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:55,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1188998893, now seen corresponding path program 1 times [2020-09-04 13:43:55,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:55,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765620167] [2020-09-04 13:43:55,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:55,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765620167] [2020-09-04 13:43:55,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:55,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 13:43:55,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269407268] [2020-09-04 13:43:55,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:43:55,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:55,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:43:55,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:43:55,954 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 4 states. [2020-09-04 13:43:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:56,069 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2020-09-04 13:43:56,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 13:43:56,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-09-04 13:43:56,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:56,070 INFO L225 Difference]: With dead ends: 115 [2020-09-04 13:43:56,071 INFO L226 Difference]: Without dead ends: 75 [2020-09-04 13:43:56,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:43:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-04 13:43:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-09-04 13:43:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-09-04 13:43:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2020-09-04 13:43:56,078 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2020-09-04 13:43:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:56,079 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2020-09-04 13:43:56,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:43:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2020-09-04 13:43:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 13:43:56,080 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:56,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:56,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 13:43:56,081 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:56,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1640998784, now seen corresponding path program 1 times [2020-09-04 13:43:56,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:56,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837239444] [2020-09-04 13:43:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:56,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:56,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837239444] [2020-09-04 13:43:56,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:56,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:56,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378831698] [2020-09-04 13:43:56,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:56,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:56,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:56,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:56,170 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 6 states. [2020-09-04 13:43:56,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:56,304 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2020-09-04 13:43:56,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:43:56,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-09-04 13:43:56,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:56,306 INFO L225 Difference]: With dead ends: 76 [2020-09-04 13:43:56,306 INFO L226 Difference]: Without dead ends: 74 [2020-09-04 13:43:56,307 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:43:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-09-04 13:43:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2020-09-04 13:43:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-09-04 13:43:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2020-09-04 13:43:56,313 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2020-09-04 13:43:56,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:56,313 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2020-09-04 13:43:56,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2020-09-04 13:43:56,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 13:43:56,314 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:56,315 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:56,315 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 13:43:56,315 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:56,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:56,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1892106755, now seen corresponding path program 1 times [2020-09-04 13:43:56,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:56,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979966203] [2020-09-04 13:43:56,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:56,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:43:56,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979966203] [2020-09-04 13:43:56,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141531269] [2020-09-04 13:43:56,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:43:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:56,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-04 13:43:56,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:43:56,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:43:56,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:43:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:43:56,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:43:56,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-09-04 13:43:56,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359749393] [2020-09-04 13:43:56,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:43:56,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:56,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:43:56,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:43:56,586 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 7 states. [2020-09-04 13:43:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:56,796 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2020-09-04 13:43:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:43:56,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-09-04 13:43:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:56,797 INFO L225 Difference]: With dead ends: 111 [2020-09-04 13:43:56,798 INFO L226 Difference]: Without dead ends: 109 [2020-09-04 13:43:56,798 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:43:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-09-04 13:43:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2020-09-04 13:43:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 13:43:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2020-09-04 13:43:56,804 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2020-09-04 13:43:56,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:56,804 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2020-09-04 13:43:56,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:43:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-09-04 13:43:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 13:43:56,805 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:56,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:57,017 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-09-04 13:43:57,018 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:57,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:57,019 INFO L82 PathProgramCache]: Analyzing trace with hash 668648404, now seen corresponding path program 1 times [2020-09-04 13:43:57,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:57,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194740] [2020-09-04 13:43:57,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:57,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:57,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194740] [2020-09-04 13:43:57,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:57,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:57,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718758816] [2020-09-04 13:43:57,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:57,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:57,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:57,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:57,111 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2020-09-04 13:43:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:57,226 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-09-04 13:43:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:43:57,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-09-04 13:43:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:57,228 INFO L225 Difference]: With dead ends: 70 [2020-09-04 13:43:57,228 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 13:43:57,229 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:43:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 13:43:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-09-04 13:43:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 13:43:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2020-09-04 13:43:57,236 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2020-09-04 13:43:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:57,240 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2020-09-04 13:43:57,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-09-04 13:43:57,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 13:43:57,243 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:57,243 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:57,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 13:43:57,243 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:57,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:57,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1470784207, now seen corresponding path program 1 times [2020-09-04 13:43:57,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:57,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293599524] [2020-09-04 13:43:57,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:57,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:43:57,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293599524] [2020-09-04 13:43:57,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184973053] [2020-09-04 13:43:57,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:43:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:57,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-04 13:43:57,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:43:57,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:43:57,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:43:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:43:57,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:43:57,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-09-04 13:43:57,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628310624] [2020-09-04 13:43:57,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:43:57,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:57,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:43:57,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:43:57,501 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 7 states. [2020-09-04 13:43:57,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:57,634 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2020-09-04 13:43:57,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:43:57,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-09-04 13:43:57,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:57,635 INFO L225 Difference]: With dead ends: 69 [2020-09-04 13:43:57,636 INFO L226 Difference]: Without dead ends: 67 [2020-09-04 13:43:57,636 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:43:57,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-09-04 13:43:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2020-09-04 13:43:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-09-04 13:43:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2020-09-04 13:43:57,641 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2020-09-04 13:43:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:57,642 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2020-09-04 13:43:57,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:43:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2020-09-04 13:43:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 13:43:57,643 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:57,643 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:57,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-09-04 13:43:57,856 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:57,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:57,857 INFO L82 PathProgramCache]: Analyzing trace with hash -350608983, now seen corresponding path program 1 times [2020-09-04 13:43:57,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:57,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339527266] [2020-09-04 13:43:57,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:57,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:57,937 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339527266] [2020-09-04 13:43:57,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:57,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:57,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144153266] [2020-09-04 13:43:57,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:57,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:57,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:57,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:57,942 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 6 states. [2020-09-04 13:43:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:58,079 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2020-09-04 13:43:58,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:43:58,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-09-04 13:43:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:58,081 INFO L225 Difference]: With dead ends: 63 [2020-09-04 13:43:58,081 INFO L226 Difference]: Without dead ends: 61 [2020-09-04 13:43:58,081 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:43:58,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-09-04 13:43:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2020-09-04 13:43:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-04 13:43:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2020-09-04 13:43:58,086 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2020-09-04 13:43:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:58,086 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2020-09-04 13:43:58,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-09-04 13:43:58,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-09-04 13:43:58,087 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:58,087 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:58,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 13:43:58,088 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:58,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:58,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2016026591, now seen corresponding path program 1 times [2020-09-04 13:43:58,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:58,089 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272748429] [2020-09-04 13:43:58,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:58,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:58,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272748429] [2020-09-04 13:43:58,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:58,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 13:43:58,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377486276] [2020-09-04 13:43:58,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:43:58,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:58,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:43:58,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:43:58,158 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2020-09-04 13:43:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:58,358 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2020-09-04 13:43:58,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:43:58,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-09-04 13:43:58,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:58,360 INFO L225 Difference]: With dead ends: 71 [2020-09-04 13:43:58,360 INFO L226 Difference]: Without dead ends: 69 [2020-09-04 13:43:58,360 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:43:58,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-09-04 13:43:58,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2020-09-04 13:43:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 13:43:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2020-09-04 13:43:58,365 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2020-09-04 13:43:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:58,366 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2020-09-04 13:43:58,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:43:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-09-04 13:43:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-09-04 13:43:58,367 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:58,367 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:58,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 13:43:58,368 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:58,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:58,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1371399406, now seen corresponding path program 1 times [2020-09-04 13:43:58,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:58,369 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876785349] [2020-09-04 13:43:58,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:58,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:58,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876785349] [2020-09-04 13:43:58,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:58,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:58,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362668021] [2020-09-04 13:43:58,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:58,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:58,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:58,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:58,434 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 6 states. [2020-09-04 13:43:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:58,721 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2020-09-04 13:43:58,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 13:43:58,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-09-04 13:43:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:58,722 INFO L225 Difference]: With dead ends: 91 [2020-09-04 13:43:58,723 INFO L226 Difference]: Without dead ends: 89 [2020-09-04 13:43:58,723 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:43:58,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-09-04 13:43:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2020-09-04 13:43:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-09-04 13:43:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2020-09-04 13:43:58,730 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2020-09-04 13:43:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:58,731 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2020-09-04 13:43:58,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-09-04 13:43:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-09-04 13:43:58,732 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:58,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:58,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 13:43:58,733 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:58,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:58,733 INFO L82 PathProgramCache]: Analyzing trace with hash 436294569, now seen corresponding path program 1 times [2020-09-04 13:43:58,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:58,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582534872] [2020-09-04 13:43:58,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:58,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:58,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:58,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582534872] [2020-09-04 13:43:58,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:58,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:58,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441850207] [2020-09-04 13:43:58,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:58,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:58,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:58,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:58,810 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 6 states. [2020-09-04 13:43:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:58,994 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-09-04 13:43:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:43:58,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-09-04 13:43:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:58,995 INFO L225 Difference]: With dead ends: 61 [2020-09-04 13:43:58,995 INFO L226 Difference]: Without dead ends: 59 [2020-09-04 13:43:58,996 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:43:58,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-09-04 13:43:59,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-09-04 13:43:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-09-04 13:43:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2020-09-04 13:43:59,003 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2020-09-04 13:43:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:59,005 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2020-09-04 13:43:59,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-09-04 13:43:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-04 13:43:59,005 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:59,006 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:59,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 13:43:59,006 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:59,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:59,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1627614740, now seen corresponding path program 1 times [2020-09-04 13:43:59,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:59,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788050894] [2020-09-04 13:43:59,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:59,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:59,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788050894] [2020-09-04 13:43:59,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:59,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:59,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214055104] [2020-09-04 13:43:59,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:59,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:59,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:59,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:59,100 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 6 states. [2020-09-04 13:43:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:59,252 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-09-04 13:43:59,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:43:59,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2020-09-04 13:43:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:59,253 INFO L225 Difference]: With dead ends: 70 [2020-09-04 13:43:59,253 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 13:43:59,254 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:43:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 13:43:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-09-04 13:43:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-04 13:43:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2020-09-04 13:43:59,263 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 41 [2020-09-04 13:43:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:59,263 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2020-09-04 13:43:59,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2020-09-04 13:43:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-09-04 13:43:59,264 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:59,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:59,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 13:43:59,265 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:59,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:59,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1083553822, now seen corresponding path program 1 times [2020-09-04 13:43:59,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:59,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239550145] [2020-09-04 13:43:59,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:59,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:59,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:59,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239550145] [2020-09-04 13:43:59,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:59,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:59,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595201995] [2020-09-04 13:43:59,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:59,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:59,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:59,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:59,335 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2020-09-04 13:43:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:59,528 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2020-09-04 13:43:59,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:43:59,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-09-04 13:43:59,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:59,529 INFO L225 Difference]: With dead ends: 68 [2020-09-04 13:43:59,530 INFO L226 Difference]: Without dead ends: 66 [2020-09-04 13:43:59,530 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:43:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-04 13:43:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-09-04 13:43:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-09-04 13:43:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2020-09-04 13:43:59,537 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 42 [2020-09-04 13:43:59,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:59,538 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2020-09-04 13:43:59,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2020-09-04 13:43:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-04 13:43:59,538 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:59,539 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:59,539 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 13:43:59,539 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:59,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:59,539 INFO L82 PathProgramCache]: Analyzing trace with hash -769566670, now seen corresponding path program 1 times [2020-09-04 13:43:59,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:59,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754751442] [2020-09-04 13:43:59,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:59,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:59,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754751442] [2020-09-04 13:43:59,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:59,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:59,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934176463] [2020-09-04 13:43:59,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:59,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:59,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:59,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:59,641 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2020-09-04 13:43:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:59,944 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2020-09-04 13:43:59,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 13:43:59,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-09-04 13:43:59,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:59,946 INFO L225 Difference]: With dead ends: 90 [2020-09-04 13:43:59,946 INFO L226 Difference]: Without dead ends: 88 [2020-09-04 13:43:59,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:43:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-09-04 13:43:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2020-09-04 13:43:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-09-04 13:43:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2020-09-04 13:43:59,953 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 43 [2020-09-04 13:43:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:59,953 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2020-09-04 13:43:59,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2020-09-04 13:43:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 13:43:59,954 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:59,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:59,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 13:43:59,955 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1913240228, now seen corresponding path program 1 times [2020-09-04 13:43:59,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:59,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897058208] [2020-09-04 13:43:59,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:44:00,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:44:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:44:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:44:00,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897058208] [2020-09-04 13:44:00,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:44:00,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:44:00,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497181619] [2020-09-04 13:44:00,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:44:00,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:44:00,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:44:00,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:44:00,037 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 6 states. [2020-09-04 13:44:00,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:44:00,238 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2020-09-04 13:44:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:44:00,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-09-04 13:44:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:44:00,240 INFO L225 Difference]: With dead ends: 75 [2020-09-04 13:44:00,240 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 13:44:00,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:44:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 13:44:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2020-09-04 13:44:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-09-04 13:44:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2020-09-04 13:44:00,249 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 44 [2020-09-04 13:44:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:44:00,249 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2020-09-04 13:44:00,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:44:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2020-09-04 13:44:00,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 13:44:00,250 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:44:00,250 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:44:00,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 13:44:00,250 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:44:00,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:44:00,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1562566919, now seen corresponding path program 1 times [2020-09-04 13:44:00,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:44:00,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922534142] [2020-09-04 13:44:00,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:44:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:44:00,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:44:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:44:00,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:44:00,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922534142] [2020-09-04 13:44:00,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383078155] [2020-09-04 13:44:00,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:44:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:44:00,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-04 13:44:00,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:44:00,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:44:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:44:00,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:44:00,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-09-04 13:44:00,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831511460] [2020-09-04 13:44:00,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:44:00,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:44:00,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:44:00,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:44:00,550 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 7 states. [2020-09-04 13:44:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:44:00,698 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2020-09-04 13:44:00,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:44:00,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-09-04 13:44:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:44:00,701 INFO L225 Difference]: With dead ends: 67 [2020-09-04 13:44:00,701 INFO L226 Difference]: Without dead ends: 65 [2020-09-04 13:44:00,702 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:44:00,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-09-04 13:44:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-09-04 13:44:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-09-04 13:44:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2020-09-04 13:44:00,709 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 44 [2020-09-04 13:44:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:44:00,710 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2020-09-04 13:44:00,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:44:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-09-04 13:44:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-09-04 13:44:00,710 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:44:00,711 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:44:00,911 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-09-04 13:44:00,912 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:44:00,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:44:00,912 INFO L82 PathProgramCache]: Analyzing trace with hash 790604971, now seen corresponding path program 1 times [2020-09-04 13:44:00,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:44:00,912 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246369131] [2020-09-04 13:44:00,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:44:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:44:00,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:44:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:44:01,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 13:44:01,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246369131] [2020-09-04 13:44:01,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:44:01,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:44:01,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483579831] [2020-09-04 13:44:01,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:44:01,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:44:01,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:44:01,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:44:01,003 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2020-09-04 13:44:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:44:01,273 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-09-04 13:44:01,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:44:01,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-09-04 13:44:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:44:01,274 INFO L225 Difference]: With dead ends: 77 [2020-09-04 13:44:01,275 INFO L226 Difference]: Without dead ends: 75 [2020-09-04 13:44:01,275 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:44:01,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-04 13:44:01,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2020-09-04 13:44:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 13:44:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-09-04 13:44:01,282 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2020-09-04 13:44:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:44:01,282 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-09-04 13:44:01,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:44:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-09-04 13:44:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 13:44:01,283 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:44:01,283 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:44:01,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 13:44:01,284 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:44:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:44:01,284 INFO L82 PathProgramCache]: Analyzing trace with hash 705971477, now seen corresponding path program 1 times [2020-09-04 13:44:01,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:44:01,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714230528] [2020-09-04 13:44:01,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:44:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:44:01,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:44:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:44:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 13:44:01,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714230528] [2020-09-04 13:44:01,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:44:01,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:44:01,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835375626] [2020-09-04 13:44:01,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:44:01,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:44:01,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:44:01,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:44:01,363 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2020-09-04 13:44:01,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:44:01,509 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2020-09-04 13:44:01,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:44:01,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-09-04 13:44:01,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:44:01,511 INFO L225 Difference]: With dead ends: 60 [2020-09-04 13:44:01,511 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 13:44:01,512 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:44:01,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 13:44:01,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 13:44:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 13:44:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 13:44:01,513 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2020-09-04 13:44:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:44:01,514 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 13:44:01,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:44:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 13:44:01,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 13:44:01,515 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 13:44:01,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 13:44:01,840 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 [2020-09-04 13:44:01,985 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2020-09-04 13:44:02,175 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 108 [2020-09-04 13:44:02,376 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2020-09-04 13:44:02,721 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2020-09-04 13:44:02,977 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-09-04 13:44:03,282 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2020-09-04 13:44:03,285 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:44:03,286 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|)) [2020-09-04 13:44:03,286 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:44:03,286 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:44:03,286 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 13:44:03,286 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 13:44:03,287 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:44:03,287 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-09-04 13:44:03,287 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-09-04 13:44:03,287 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 6) no Hoare annotation was computed. [2020-09-04 13:44:03,287 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-09-04 13:44:03,287 INFO L268 CegarLoopResult]: For program point L192(lines 192 352) no Hoare annotation was computed. [2020-09-04 13:44:03,287 INFO L268 CegarLoopResult]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 123) no Hoare annotation was computed. [2020-09-04 13:44:03,288 INFO L268 CegarLoopResult]: For program point L382(lines 382 391) no Hoare annotation was computed. [2020-09-04 13:44:03,288 INFO L268 CegarLoopResult]: For program point L93(lines 93 410) no Hoare annotation was computed. [2020-09-04 13:44:03,288 INFO L268 CegarLoopResult]: For program point L27(lines 27 435) no Hoare annotation was computed. [2020-09-04 13:44:03,288 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 437) no Hoare annotation was computed. [2020-09-04 13:44:03,288 INFO L268 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2020-09-04 13:44:03,289 INFO L264 CegarLoopResult]: At program point L399(lines 129 400) the Hoare annotation is: (and (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (< 0 main_~main__scheme~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~16 0)) .cse2 .cse3) (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3))) (= |old(~__return_375~0)| ~__return_375~0)) [2020-09-04 13:44:03,289 INFO L268 CegarLoopResult]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 253) no Hoare annotation was computed. [2020-09-04 13:44:03,289 INFO L268 CegarLoopResult]: For program point L102(lines 102 409) no Hoare annotation was computed. [2020-09-04 13:44:03,289 INFO L268 CegarLoopResult]: For program point L69(lines 69 414) no Hoare annotation was computed. [2020-09-04 13:44:03,291 INFO L264 CegarLoopResult]: At program point L325(lines 260 326) the Hoare annotation is: (let ((.cse18 (+ main_~main__cp~0 1))) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse1 (= main_~__VERIFIER_assert__cond~10 1)) (.cse2 (< 0 main_~main__scheme~0)) (.cse3 (not (= main_~main__urilen~0 .cse18))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse6 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~9 0))) (.cse8 (= main_~__VERIFIER_assert__cond~3 1)) (.cse9 (= |old(~__return_375~0)| ~__return_375~0)) (.cse10 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse11 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse12 (<= .cse18 main_~main__urilen~0)) (.cse13 (= main_~__VERIFIER_assert__cond~9 1)) (.cse14 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse15 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse16 (<= 1 main_~main__cp~0)) (.cse17 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 main_~main__c~0) .cse11 .cse12 .cse13 .cse14 .cse15 (not (= main_~__VERIFIER_assert__cond~15 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) .cse16 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse17) (and .cse0 .cse1 .cse2 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse3 .cse4 .cse5 .cse6 .cse7 (= main_~main__c~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2020-09-04 13:44:03,291 INFO L268 CegarLoopResult]: For program point L292(lines 292 316) no Hoare annotation was computed. [2020-09-04 13:44:03,291 INFO L268 CegarLoopResult]: For program point L160(lines 160 357) no Hoare annotation was computed. [2020-09-04 13:44:03,291 INFO L268 CegarLoopResult]: For program point L61(lines 61 420) no Hoare annotation was computed. [2020-09-04 13:44:03,292 INFO L268 CegarLoopResult]: For program point L251(lines 251 327) no Hoare annotation was computed. [2020-09-04 13:44:03,292 INFO L268 CegarLoopResult]: For program point L185(lines 185 353) no Hoare annotation was computed. [2020-09-04 13:44:03,292 INFO L268 CegarLoopResult]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2020-09-04 13:44:03,292 INFO L264 CegarLoopResult]: At program point L408(lines 102 409) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2020-09-04 13:44:03,292 INFO L268 CegarLoopResult]: For program point L210(lines 210 344) no Hoare annotation was computed. [2020-09-04 13:44:03,292 INFO L268 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2020-09-04 13:44:03,292 INFO L268 CegarLoopResult]: For program point L45(lines 45 432) no Hoare annotation was computed. [2020-09-04 13:44:03,293 INFO L268 CegarLoopResult]: For program point L268(lines 268 320) no Hoare annotation was computed. [2020-09-04 13:44:03,293 INFO L268 CegarLoopResult]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 294) no Hoare annotation was computed. [2020-09-04 13:44:03,293 INFO L268 CegarLoopResult]: For program point L202(lines 202 351) no Hoare annotation was computed. [2020-09-04 13:44:03,293 INFO L268 CegarLoopResult]: For program point L260(lines 260 326) no Hoare annotation was computed. [2020-09-04 13:44:03,293 INFO L268 CegarLoopResult]: For program point L384(line 384) no Hoare annotation was computed. [2020-09-04 13:44:03,293 INFO L268 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2020-09-04 13:44:03,293 INFO L268 CegarLoopResult]: For program point L153(lines 153 358) no Hoare annotation was computed. [2020-09-04 13:44:03,294 INFO L268 CegarLoopResult]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2020-09-04 13:44:03,294 INFO L268 CegarLoopResult]: For program point L21(lines 21 436) no Hoare annotation was computed. [2020-09-04 13:44:03,294 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 437) no Hoare annotation was computed. [2020-09-04 13:44:03,294 INFO L268 CegarLoopResult]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 282) no Hoare annotation was computed. [2020-09-04 13:44:03,294 INFO L268 CegarLoopResult]: For program point L294(line 294) no Hoare annotation was computed. [2020-09-04 13:44:03,294 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2020-09-04 13:44:03,294 INFO L268 CegarLoopResult]: For program point L63(lines 63 415) no Hoare annotation was computed. [2020-09-04 13:44:03,294 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 437) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2020-09-04 13:44:03,295 INFO L268 CegarLoopResult]: For program point L253(line 253) no Hoare annotation was computed. [2020-09-04 13:44:03,295 INFO L268 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2020-09-04 13:44:03,295 INFO L268 CegarLoopResult]: For program point L121(lines 121 401) no Hoare annotation was computed. [2020-09-04 13:44:03,295 INFO L268 CegarLoopResult]: For program point L212(line 212) no Hoare annotation was computed. [2020-09-04 13:44:03,295 INFO L268 CegarLoopResult]: For program point L270(line 270) no Hoare annotation was computed. [2020-09-04 13:44:03,295 INFO L268 CegarLoopResult]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2020-09-04 13:44:03,295 INFO L268 CegarLoopResult]: For program point L39(lines 39 433) no Hoare annotation was computed. [2020-09-04 13:44:03,295 INFO L268 CegarLoopResult]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 372) no Hoare annotation was computed. [2020-09-04 13:44:03,296 INFO L268 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2020-09-04 13:44:03,296 INFO L268 CegarLoopResult]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 187) no Hoare annotation was computed. [2020-09-04 13:44:03,296 INFO L268 CegarLoopResult]: For program point L370(lines 370 393) no Hoare annotation was computed. [2020-09-04 13:44:03,296 INFO L268 CegarLoopResult]: For program point L81(lines 81 412) no Hoare annotation was computed. [2020-09-04 13:44:03,296 INFO L268 CegarLoopResult]: For program point L304(lines 304 314) no Hoare annotation was computed. [2020-09-04 13:44:03,296 INFO L268 CegarLoopResult]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 306) no Hoare annotation was computed. [2020-09-04 13:44:03,296 INFO L268 CegarLoopResult]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 111) no Hoare annotation was computed. [2020-09-04 13:44:03,296 INFO L268 CegarLoopResult]: For program point L222(lines 222 342) no Hoare annotation was computed. [2020-09-04 13:44:03,297 INFO L268 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2020-09-04 13:44:03,297 INFO L268 CegarLoopResult]: For program point L57(lines 57 430) no Hoare annotation was computed. [2020-09-04 13:44:03,297 INFO L264 CegarLoopResult]: At program point L313(lines 228 342) the Hoare annotation is: (let ((.cse0 (+ main_~main__cp~0 1))) (let ((.cse1 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse2 (< 0 main_~main__scheme~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse16 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse5 (= main_~main__c~0 0)) (.cse6 (= main_~__VERIFIER_assert__cond~3 1)) (.cse7 (= |old(~__return_375~0)| ~__return_375~0)) (.cse8 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse9 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (<= .cse0 main_~main__urilen~0)) (.cse11 (= main_~__VERIFIER_assert__cond~9 1)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse14 (<= 1 main_~main__cp~0)) (.cse15 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse17 (<= 1 main_~__VERIFIER_assert__cond~10))) (or (and (< .cse0 main_~main__urilen~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= main_~__VERIFIER_assert__cond~8 1) .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse6 .cse7 (<= 1 main_~main__c~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= main_~__VERIFIER_assert__cond~15 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (not (= main_~__VERIFIER_assert__cond~12 0)) .cse14 .cse15 .cse17) (and .cse1 .cse2 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17)))) [2020-09-04 13:44:03,297 INFO L268 CegarLoopResult]: For program point L280(lines 280 318) no Hoare annotation was computed. [2020-09-04 13:44:03,297 INFO L268 CegarLoopResult]: For program point L239(lines 239 329) no Hoare annotation was computed. [2020-09-04 13:44:03,298 INFO L268 CegarLoopResult]: For program point L173(lines 173 355) no Hoare annotation was computed. [2020-09-04 13:44:03,298 INFO L268 CegarLoopResult]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 241) no Hoare annotation was computed. [2020-09-04 13:44:03,298 INFO L268 CegarLoopResult]: For program point L33(lines 33 434) no Hoare annotation was computed. [2020-09-04 13:44:03,298 INFO L268 CegarLoopResult]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2020-09-04 13:44:03,298 INFO L268 CegarLoopResult]: For program point L372(line 372) no Hoare annotation was computed. [2020-09-04 13:44:03,298 INFO L268 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2020-09-04 13:44:03,298 INFO L268 CegarLoopResult]: For program point L306(line 306) no Hoare annotation was computed. [2020-09-04 13:44:03,298 INFO L268 CegarLoopResult]: For program point L141(lines 141 360) no Hoare annotation was computed. [2020-09-04 13:44:03,299 INFO L268 CegarLoopResult]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2020-09-04 13:44:03,299 INFO L268 CegarLoopResult]: For program point L232(lines 232 336) no Hoare annotation was computed. [2020-09-04 13:44:03,299 INFO L268 CegarLoopResult]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 384) no Hoare annotation was computed. [2020-09-04 13:44:03,299 INFO L268 CegarLoopResult]: For program point L133(lines 133 395) no Hoare annotation was computed. [2020-09-04 13:44:03,299 INFO L268 CegarLoopResult]: For program point L224(line 224) no Hoare annotation was computed. [2020-09-04 13:44:03,299 INFO L268 CegarLoopResult]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2020-09-04 13:44:03,299 INFO L268 CegarLoopResult]: For program point L59(lines 59 425) no Hoare annotation was computed. [2020-09-04 13:44:03,299 INFO L268 CegarLoopResult]: For program point L282(line 282) no Hoare annotation was computed. [2020-09-04 13:44:03,300 INFO L268 CegarLoopResult]: For program point L51(lines 51 431) no Hoare annotation was computed. [2020-09-04 13:44:03,300 INFO L268 CegarLoopResult]: For program point L241(line 241) no Hoare annotation was computed. [2020-09-04 13:44:03,300 INFO L268 CegarLoopResult]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 270) no Hoare annotation was computed. [2020-09-04 13:44:03,300 INFO L268 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2020-09-04 13:44:03,300 INFO L268 CegarLoopResult]: For program point L109(lines 109 403) no Hoare annotation was computed. [2020-09-04 13:44:03,300 INFO L264 CegarLoopResult]: At program point L390(lines 127 401) the Hoare annotation is: (and (let ((.cse0 (< 0 main_~main__scheme~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (= main_~__VERIFIER_assert__cond~3 1)) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse2 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse3 .cse4 (<= 1 main_~__VERIFIER_assert__cond~16)))) (= |old(~__return_375~0)| ~__return_375~0) (<= (+ main_~main__cp~0 1) main_~main__urilen~0)) [2020-09-04 13:44:03,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:44:03 BoogieIcfgContainer [2020-09-04 13:44:03,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:44:03,335 INFO L168 Benchmark]: Toolchain (without parser) took 12034.79 ms. Allocated memory was 146.8 MB in the beginning and 319.8 MB in the end (delta: 173.0 MB). Free memory was 103.3 MB in the beginning and 163.3 MB in the end (delta: -60.1 MB). Peak memory consumption was 164.9 MB. Max. memory is 7.1 GB. [2020-09-04 13:44:03,336 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 146.8 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 13:44:03,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 496.62 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 103.1 MB in the beginning and 181.2 MB in the end (delta: -78.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2020-09-04 13:44:03,337 INFO L168 Benchmark]: Boogie Preprocessor took 47.33 ms. Allocated memory is still 202.9 MB. Free memory was 181.2 MB in the beginning and 179.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-09-04 13:44:03,337 INFO L168 Benchmark]: RCFGBuilder took 653.42 ms. Allocated memory is still 202.9 MB. Free memory was 179.0 MB in the beginning and 151.1 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2020-09-04 13:44:03,338 INFO L168 Benchmark]: TraceAbstraction took 10831.69 ms. Allocated memory was 202.9 MB in the beginning and 319.8 MB in the end (delta: 116.9 MB). Free memory was 150.5 MB in the beginning and 163.3 MB in the end (delta: -12.9 MB). Peak memory consumption was 156.0 MB. Max. memory is 7.1 GB. [2020-09-04 13:44:03,340 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 146.8 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 496.62 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 103.1 MB in the beginning and 181.2 MB in the end (delta: -78.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.33 ms. Allocated memory is still 202.9 MB. Free memory was 181.2 MB in the beginning and 179.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 653.42 ms. Allocated memory is still 202.9 MB. Free memory was 179.0 MB in the beginning and 151.1 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10831.69 ms. Allocated memory was 202.9 MB in the beginning and 319.8 MB in the end (delta: 116.9 MB). Free memory was 150.5 MB in the beginning and 163.3 MB in the end (delta: -12.9 MB). Peak memory consumption was 156.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 306]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 372]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 187]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 282]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 241]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 294]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 270]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 143]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 253]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 384]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 111]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 155]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 123]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((((((0 < main__scheme && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((0 < main__scheme && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond)) && \old(__return_375) == __return_375) && main__cp + 1 <= main__urilen - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) && \old(__return_375) == __return_375 - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: (((((((((((((((((main__cp + 1 < main__urilen && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && 1 <= main__c) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond)) || (((((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((main__cp < main__urilen && __VERIFIER_assert__cond == 1) && ((((((0 < main__scheme && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((0 < main__scheme && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)))) && \old(__return_375) == __return_375 - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && 0 < main__scheme) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && 1 <= __VERIFIER_assert__cond) && 1 <= main__c) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.9s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1392 SDtfs, 3896 SDslu, 358 SDs, 0 SdLazy, 2609 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 180 SyntacticMatches, 6 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 288 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 507 HoareAnnotationTreeSize, 9 FomulaSimplifications, 71847 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 9 FomulaSimplificationsInter, 7009 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 879 ConstructedInterpolants, 0 QuantifiedInterpolants, 68951 SizeOfPredicates, 15 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 15/27 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 correct! Received shutdown request...