/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:45:51,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:45:51,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:45:51,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:45:51,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:45:51,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:45:51,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:45:51,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:45:51,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:45:51,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:45:51,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:45:51,792 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:45:51,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:45:51,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:45:51,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:45:51,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:45:51,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:45:51,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:45:51,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:45:51,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:45:51,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:45:51,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:45:51,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:45:51,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:45:51,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:45:51,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:45:51,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:45:51,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:45:51,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:45:51,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:45:51,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:45:51,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:45:51,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:45:51,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:45:51,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:45:51,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:45:51,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:45:51,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:45:51,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:45:51,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:45:51,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:45:51,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:45:51,863 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:45:51,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:45:51,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:45:51,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:45:51,865 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:45:51,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:45:51,866 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:45:51,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:45:51,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:45:51,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:45:51,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:45:51,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:45:51,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:45:51,867 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:45:51,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:45:51,867 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:45:51,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:45:51,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:45:51,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:45:51,868 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:45:51,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:45:51,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:45:51,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:45:51,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:45:51,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:45:51,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:45:51,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:45:51,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:45:51,870 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:45:51,870 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:45:52,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:45:52,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:45:52,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:45:52,301 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:45:52,301 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:45:52,302 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2020-11-06 22:45:52,388 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5fbc8fcc/e293bdb2de584d90958439ed3e186d76/FLAG0c081c5b4 [2020-11-06 22:45:52,996 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:45:52,997 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2020-11-06 22:45:53,009 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5fbc8fcc/e293bdb2de584d90958439ed3e186d76/FLAG0c081c5b4 [2020-11-06 22:45:53,366 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5fbc8fcc/e293bdb2de584d90958439ed3e186d76 [2020-11-06 22:45:53,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:45:53,383 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:45:53,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:45:53,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:45:53,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:45:53,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:53" (1/1) ... [2020-11-06 22:45:53,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14315246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:53, skipping insertion in model container [2020-11-06 22:45:53,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:53" (1/1) ... [2020-11-06 22:45:53,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:45:53,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:45:53,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:45:53,660 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:45:53,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:45:53,719 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:45:53,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:53 WrapperNode [2020-11-06 22:45:53,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:45:53,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:45:53,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:45:53,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:45:53,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:53" (1/1) ... [2020-11-06 22:45:53,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:53" (1/1) ... [2020-11-06 22:45:53,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:53" (1/1) ... [2020-11-06 22:45:53,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:53" (1/1) ... [2020-11-06 22:45:53,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:53" (1/1) ... [2020-11-06 22:45:53,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:53" (1/1) ... [2020-11-06 22:45:53,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:53" (1/1) ... [2020-11-06 22:45:53,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:45:53,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:45:53,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:45:53,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:45:53,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:45:53,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:45:53,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:45:53,897 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:45:53,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-06 22:45:53,897 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:45:53,898 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:45:53,898 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:45:53,898 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:45:53,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:45:53,899 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-06 22:45:53,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-06 22:45:53,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:45:53,900 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:45:53,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:45:53,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:45:53,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:45:53,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:45:53,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:45:53,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:45:54,648 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:45:54,648 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-06 22:45:54,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:54 BoogieIcfgContainer [2020-11-06 22:45:54,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:45:54,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:45:54,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:45:54,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:45:54,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:45:53" (1/3) ... [2020-11-06 22:45:54,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576a8fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:54, skipping insertion in model container [2020-11-06 22:45:54,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:53" (2/3) ... [2020-11-06 22:45:54,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576a8fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:54, skipping insertion in model container [2020-11-06 22:45:54,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:54" (3/3) ... [2020-11-06 22:45:54,659 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2020-11-06 22:45:54,674 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:45:54,678 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:45:54,690 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:45:54,716 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:45:54,717 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:45:54,717 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:45:54,717 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:45:54,717 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:45:54,717 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:45:54,717 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:45:54,717 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:45:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2020-11-06 22:45:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-06 22:45:54,741 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:54,742 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:54,743 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1761043542, now seen corresponding path program 1 times [2020-11-06 22:45:54,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:54,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756032249] [2020-11-06 22:45:54,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:55,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:45:55,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756032249] [2020-11-06 22:45:55,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:55,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:45:55,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225185966] [2020-11-06 22:45:55,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:45:55,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:55,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:45:55,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:45:55,095 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 4 states. [2020-11-06 22:45:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:55,313 INFO L93 Difference]: Finished difference Result 92 states and 139 transitions. [2020-11-06 22:45:55,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-06 22:45:55,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-06 22:45:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:55,324 INFO L225 Difference]: With dead ends: 92 [2020-11-06 22:45:55,325 INFO L226 Difference]: Without dead ends: 59 [2020-11-06 22:45:55,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:45:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-06 22:45:55,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2020-11-06 22:45:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-06 22:45:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2020-11-06 22:45:55,393 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 14 [2020-11-06 22:45:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:55,394 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2020-11-06 22:45:55,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:45:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2020-11-06 22:45:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-06 22:45:55,395 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:55,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:55,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:45:55,396 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:55,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:55,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1340443989, now seen corresponding path program 1 times [2020-11-06 22:45:55,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:55,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852909161] [2020-11-06 22:45:55,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:55,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:45:55,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852909161] [2020-11-06 22:45:55,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:55,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-06 22:45:55,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545718875] [2020-11-06 22:45:55,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-06 22:45:55,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:55,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-06 22:45:55,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:45:55,521 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand 5 states. [2020-11-06 22:45:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:55,928 INFO L93 Difference]: Finished difference Result 117 states and 170 transitions. [2020-11-06 22:45:55,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:45:55,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-06 22:45:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:55,931 INFO L225 Difference]: With dead ends: 117 [2020-11-06 22:45:55,931 INFO L226 Difference]: Without dead ends: 78 [2020-11-06 22:45:55,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:45:55,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-06 22:45:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 46. [2020-11-06 22:45:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-06 22:45:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2020-11-06 22:45:55,950 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 15 [2020-11-06 22:45:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:55,951 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2020-11-06 22:45:55,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-06 22:45:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2020-11-06 22:45:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-06 22:45:55,952 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:55,952 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:55,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:45:55,952 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:55,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:55,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1242212429, now seen corresponding path program 1 times [2020-11-06 22:45:55,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:55,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624547146] [2020-11-06 22:45:55,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:56,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:45:56,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624547146] [2020-11-06 22:45:56,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:56,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-06 22:45:56,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197330112] [2020-11-06 22:45:56,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-06 22:45:56,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:56,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-06 22:45:56,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:45:56,056 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 5 states. [2020-11-06 22:45:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:56,253 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2020-11-06 22:45:56,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-06 22:45:56,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-06 22:45:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:56,255 INFO L225 Difference]: With dead ends: 62 [2020-11-06 22:45:56,255 INFO L226 Difference]: Without dead ends: 59 [2020-11-06 22:45:56,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:45:56,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-06 22:45:56,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2020-11-06 22:45:56,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-06 22:45:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2020-11-06 22:45:56,269 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 15 [2020-11-06 22:45:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:56,269 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2020-11-06 22:45:56,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-06 22:45:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2020-11-06 22:45:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-06 22:45:56,270 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:56,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:56,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:45:56,273 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:56,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:56,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1395909301, now seen corresponding path program 1 times [2020-11-06 22:45:56,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:56,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950446950] [2020-11-06 22:45:56,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:56,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:45:56,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950446950] [2020-11-06 22:45:56,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:56,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-06 22:45:56,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449130461] [2020-11-06 22:45:56,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-06 22:45:56,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:56,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-06 22:45:56,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:45:56,422 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand 5 states. [2020-11-06 22:45:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:56,679 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2020-11-06 22:45:56,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-06 22:45:56,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-06 22:45:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:56,681 INFO L225 Difference]: With dead ends: 77 [2020-11-06 22:45:56,681 INFO L226 Difference]: Without dead ends: 74 [2020-11-06 22:45:56,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:45:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-06 22:45:56,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 44. [2020-11-06 22:45:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-06 22:45:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2020-11-06 22:45:56,694 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 16 [2020-11-06 22:45:56,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:56,695 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2020-11-06 22:45:56,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-06 22:45:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2020-11-06 22:45:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-06 22:45:56,696 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:56,696 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:56,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:45:56,696 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:56,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:56,697 INFO L82 PathProgramCache]: Analyzing trace with hash -323511465, now seen corresponding path program 1 times [2020-11-06 22:45:56,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:56,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825499193] [2020-11-06 22:45:56,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:56,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:45:56,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825499193] [2020-11-06 22:45:56,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:56,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:45:56,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546096290] [2020-11-06 22:45:56,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:45:56,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:56,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:45:56,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:45:56,789 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand 6 states. [2020-11-06 22:45:57,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:57,104 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2020-11-06 22:45:57,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-06 22:45:57,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-11-06 22:45:57,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:57,106 INFO L225 Difference]: With dead ends: 77 [2020-11-06 22:45:57,106 INFO L226 Difference]: Without dead ends: 74 [2020-11-06 22:45:57,107 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:45:57,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-06 22:45:57,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 43. [2020-11-06 22:45:57,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-06 22:45:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2020-11-06 22:45:57,118 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 17 [2020-11-06 22:45:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:57,119 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2020-11-06 22:45:57,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:45:57,119 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2020-11-06 22:45:57,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-06 22:45:57,120 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:57,120 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:57,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:45:57,120 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:57,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:57,121 INFO L82 PathProgramCache]: Analyzing trace with hash -234239127, now seen corresponding path program 1 times [2020-11-06 22:45:57,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:57,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11307831] [2020-11-06 22:45:57,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:57,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:45:57,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11307831] [2020-11-06 22:45:57,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:57,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-06 22:45:57,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167946129] [2020-11-06 22:45:57,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-06 22:45:57,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:57,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-06 22:45:57,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:45:57,197 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand 5 states. [2020-11-06 22:45:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:57,587 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2020-11-06 22:45:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:45:57,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-06 22:45:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:57,590 INFO L225 Difference]: With dead ends: 61 [2020-11-06 22:45:57,590 INFO L226 Difference]: Without dead ends: 58 [2020-11-06 22:45:57,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:45:57,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-11-06 22:45:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2020-11-06 22:45:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-06 22:45:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2020-11-06 22:45:57,613 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 17 [2020-11-06 22:45:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:57,613 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-11-06 22:45:57,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-06 22:45:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2020-11-06 22:45:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-06 22:45:57,617 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:57,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:57,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:45:57,618 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:57,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:57,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1438913011, now seen corresponding path program 1 times [2020-11-06 22:45:57,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:57,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957896001] [2020-11-06 22:45:57,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:57,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:45:57,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957896001] [2020-11-06 22:45:57,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:57,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-06 22:45:57,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774643350] [2020-11-06 22:45:57,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-06 22:45:57,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:57,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-06 22:45:57,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:45:57,733 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 5 states. [2020-11-06 22:45:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:57,992 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2020-11-06 22:45:57,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-06 22:45:57,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-06 22:45:57,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:57,994 INFO L225 Difference]: With dead ends: 76 [2020-11-06 22:45:57,994 INFO L226 Difference]: Without dead ends: 73 [2020-11-06 22:45:57,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:45:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-06 22:45:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2020-11-06 22:45:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-06 22:45:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2020-11-06 22:45:58,006 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 18 [2020-11-06 22:45:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:58,007 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2020-11-06 22:45:58,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-06 22:45:58,007 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2020-11-06 22:45:58,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-06 22:45:58,008 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:58,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:58,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-06 22:45:58,008 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:58,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:58,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1328540162, now seen corresponding path program 1 times [2020-11-06 22:45:58,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:58,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377521367] [2020-11-06 22:45:58,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:58,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:45:58,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377521367] [2020-11-06 22:45:58,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:58,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:45:58,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675133976] [2020-11-06 22:45:58,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:45:58,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:58,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:45:58,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:45:58,126 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 6 states. [2020-11-06 22:45:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:58,532 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2020-11-06 22:45:58,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:45:58,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-06 22:45:58,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:58,533 INFO L225 Difference]: With dead ends: 68 [2020-11-06 22:45:58,534 INFO L226 Difference]: Without dead ends: 65 [2020-11-06 22:45:58,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:45:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-06 22:45:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2020-11-06 22:45:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-06 22:45:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2020-11-06 22:45:58,547 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 18 [2020-11-06 22:45:58,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:58,547 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2020-11-06 22:45:58,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:45:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2020-11-06 22:45:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-06 22:45:58,548 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:58,548 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-11-06 22:45:58,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-06 22:45:58,549 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:58,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1764905525, now seen corresponding path program 1 times [2020-11-06 22:45:58,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:58,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750388237] [2020-11-06 22:45:58,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:58,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:45:58,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750388237] [2020-11-06 22:45:58,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:58,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:45:58,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636798198] [2020-11-06 22:45:58,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:45:58,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:58,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:45:58,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:45:58,630 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 6 states. [2020-11-06 22:45:58,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:58,964 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2020-11-06 22:45:58,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-06 22:45:58,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-06 22:45:58,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:58,966 INFO L225 Difference]: With dead ends: 57 [2020-11-06 22:45:58,966 INFO L226 Difference]: Without dead ends: 54 [2020-11-06 22:45:58,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:45:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-06 22:45:58,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2020-11-06 22:45:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-06 22:45:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2020-11-06 22:45:58,989 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 19 [2020-11-06 22:45:58,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:58,989 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2020-11-06 22:45:58,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:45:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2020-11-06 22:45:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-06 22:45:58,990 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:58,991 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-11-06 22:45:58,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-06 22:45:58,991 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:58,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:58,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1122529892, now seen corresponding path program 1 times [2020-11-06 22:45:58,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:58,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362952647] [2020-11-06 22:45:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:45:59,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362952647] [2020-11-06 22:45:59,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:59,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-06 22:45:59,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892063333] [2020-11-06 22:45:59,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-06 22:45:59,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:59,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-06 22:45:59,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:45:59,076 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 5 states. [2020-11-06 22:45:59,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:59,271 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2020-11-06 22:45:59,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-06 22:45:59,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-11-06 22:45:59,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:59,272 INFO L225 Difference]: With dead ends: 58 [2020-11-06 22:45:59,272 INFO L226 Difference]: Without dead ends: 55 [2020-11-06 22:45:59,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:45:59,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-06 22:45:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2020-11-06 22:45:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-11-06 22:45:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2020-11-06 22:45:59,283 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2020-11-06 22:45:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:59,283 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2020-11-06 22:45:59,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-06 22:45:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2020-11-06 22:45:59,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-06 22:45:59,284 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:59,284 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] [2020-11-06 22:45:59,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-06 22:45:59,284 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:59,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:59,285 INFO L82 PathProgramCache]: Analyzing trace with hash 438718509, now seen corresponding path program 1 times [2020-11-06 22:45:59,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:59,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917483834] [2020-11-06 22:45:59,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:45:59,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917483834] [2020-11-06 22:45:59,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:59,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-06 22:45:59,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54698659] [2020-11-06 22:45:59,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-06 22:45:59,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:59,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-06 22:45:59,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:45:59,356 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 5 states. [2020-11-06 22:45:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:59,646 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2020-11-06 22:45:59,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:45:59,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-06 22:45:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:59,649 INFO L225 Difference]: With dead ends: 67 [2020-11-06 22:45:59,649 INFO L226 Difference]: Without dead ends: 64 [2020-11-06 22:45:59,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:45:59,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-06 22:45:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 37. [2020-11-06 22:45:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-06 22:45:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2020-11-06 22:45:59,663 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 21 [2020-11-06 22:45:59,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:59,664 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2020-11-06 22:45:59,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-06 22:45:59,664 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2020-11-06 22:45:59,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-06 22:45:59,666 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:59,667 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-11-06 22:45:59,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-06 22:45:59,667 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:59,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:59,672 INFO L82 PathProgramCache]: Analyzing trace with hash 715406022, now seen corresponding path program 1 times [2020-11-06 22:45:59,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:59,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073951775] [2020-11-06 22:45:59,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:45:59,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073951775] [2020-11-06 22:45:59,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:59,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:45:59,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515713514] [2020-11-06 22:45:59,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:45:59,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:59,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:45:59,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:45:59,792 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 6 states. [2020-11-06 22:46:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:00,146 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2020-11-06 22:46:00,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:46:00,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-11-06 22:46:00,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:00,147 INFO L225 Difference]: With dead ends: 73 [2020-11-06 22:46:00,147 INFO L226 Difference]: Without dead ends: 70 [2020-11-06 22:46:00,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:46:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-06 22:46:00,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 36. [2020-11-06 22:46:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-11-06 22:46:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-11-06 22:46:00,157 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 22 [2020-11-06 22:46:00,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:00,157 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-11-06 22:46:00,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:46:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-11-06 22:46:00,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-06 22:46:00,158 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:00,158 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-11-06 22:46:00,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-06 22:46:00,159 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:00,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:00,159 INFO L82 PathProgramCache]: Analyzing trace with hash 702788239, now seen corresponding path program 1 times [2020-11-06 22:46:00,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:00,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073167121] [2020-11-06 22:46:00,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:46:00,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073167121] [2020-11-06 22:46:00,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:00,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:46:00,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450245668] [2020-11-06 22:46:00,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:46:00,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:00,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:46:00,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:46:00,249 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 7 states. [2020-11-06 22:46:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:00,695 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2020-11-06 22:46:00,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:46:00,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-06 22:46:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:00,696 INFO L225 Difference]: With dead ends: 62 [2020-11-06 22:46:00,696 INFO L226 Difference]: Without dead ends: 59 [2020-11-06 22:46:00,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:46:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-06 22:46:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2020-11-06 22:46:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-06 22:46:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2020-11-06 22:46:00,719 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2020-11-06 22:46:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:00,720 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2020-11-06 22:46:00,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:46:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2020-11-06 22:46:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-06 22:46:00,721 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:00,721 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] [2020-11-06 22:46:00,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-06 22:46:00,721 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:00,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:00,722 INFO L82 PathProgramCache]: Analyzing trace with hash 311640872, now seen corresponding path program 1 times [2020-11-06 22:46:00,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:00,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581961937] [2020-11-06 22:46:00,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:46:00,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581961937] [2020-11-06 22:46:00,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:00,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:46:00,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301032212] [2020-11-06 22:46:00,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:46:00,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:00,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:46:00,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:46:00,832 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 6 states. [2020-11-06 22:46:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:01,250 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2020-11-06 22:46:01,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-06 22:46:01,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-11-06 22:46:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:01,252 INFO L225 Difference]: With dead ends: 88 [2020-11-06 22:46:01,252 INFO L226 Difference]: Without dead ends: 85 [2020-11-06 22:46:01,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:46:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-06 22:46:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2020-11-06 22:46:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-06 22:46:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2020-11-06 22:46:01,260 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 24 [2020-11-06 22:46:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:01,260 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2020-11-06 22:46:01,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:46:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-11-06 22:46:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-06 22:46:01,261 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:01,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:46:01,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-06 22:46:01,262 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:01,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:01,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1070978289, now seen corresponding path program 1 times [2020-11-06 22:46:01,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:01,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988381651] [2020-11-06 22:46:01,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:01,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:46:01,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988381651] [2020-11-06 22:46:01,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:01,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:46:01,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874341593] [2020-11-06 22:46:01,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:46:01,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:01,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:46:01,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:46:01,356 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 7 states. [2020-11-06 22:46:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:01,813 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-11-06 22:46:01,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:46:01,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-11-06 22:46:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:01,814 INFO L225 Difference]: With dead ends: 62 [2020-11-06 22:46:01,815 INFO L226 Difference]: Without dead ends: 59 [2020-11-06 22:46:01,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:46:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-06 22:46:01,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 33. [2020-11-06 22:46:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-11-06 22:46:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-11-06 22:46:01,821 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2020-11-06 22:46:01,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:01,822 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-11-06 22:46:01,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:46:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-11-06 22:46:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-06 22:46:01,823 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:01,823 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-11-06 22:46:01,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-06 22:46:01,823 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:01,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:01,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1159361654, now seen corresponding path program 1 times [2020-11-06 22:46:01,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:01,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343998528] [2020-11-06 22:46:01,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:01,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:46:01,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343998528] [2020-11-06 22:46:01,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:01,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:46:01,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81940978] [2020-11-06 22:46:01,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:46:01,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:01,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:46:01,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:46:01,917 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2020-11-06 22:46:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:02,599 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2020-11-06 22:46:02,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:46:02,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-11-06 22:46:02,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:02,600 INFO L225 Difference]: With dead ends: 126 [2020-11-06 22:46:02,600 INFO L226 Difference]: Without dead ends: 0 [2020-11-06 22:46:02,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:46:02,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-06 22:46:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-06 22:46:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-06 22:46:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-06 22:46:02,604 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-11-06 22:46:02,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:02,604 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-06 22:46:02,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:46:02,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-06 22:46:02,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-06 22:46:02,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-06 22:46:02,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-06 22:46:03,095 WARN L194 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 132 [2020-11-06 22:46:03,590 WARN L194 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 113 [2020-11-06 22:46:04,098 WARN L194 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 156 [2020-11-06 22:46:04,413 WARN L194 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 22 [2020-11-06 22:46:04,617 WARN L194 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 13 [2020-11-06 22:46:05,145 WARN L194 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 38 [2020-11-06 22:46:05,154 INFO L266 CegarLoopResult]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2020-11-06 22:46:05,154 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-06 22:46:05,154 INFO L266 CegarLoopResult]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2020-11-06 22:46:05,155 INFO L266 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-11-06 22:46:05,155 INFO L266 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:46:05,156 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~__return_334~0 |old(~__return_334~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-06 22:46:05,156 INFO L266 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:46:05,156 INFO L266 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:46:05,156 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-06 22:46:05,156 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-06 22:46:05,156 INFO L266 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:46:05,156 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2020-11-06 22:46:05,156 INFO L266 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2020-11-06 22:46:05,156 INFO L266 CegarLoopResult]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2020-11-06 22:46:05,156 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2020-11-06 22:46:05,157 INFO L262 CegarLoopResult]: At program point L217(line 217) the Hoare annotation is: false [2020-11-06 22:46:05,157 INFO L266 CegarLoopResult]: For program point mainEXIT(lines 13 313) no Hoare annotation was computed. [2020-11-06 22:46:05,157 INFO L266 CegarLoopResult]: For program point L217-1(line 217) no Hoare annotation was computed. [2020-11-06 22:46:05,157 INFO L266 CegarLoopResult]: For program point L151(lines 151 281) no Hoare annotation was computed. [2020-11-06 22:46:05,157 INFO L266 CegarLoopResult]: For program point L110(lines 110 123) no Hoare annotation was computed. [2020-11-06 22:46:05,157 INFO L266 CegarLoopResult]: For program point L36(lines 36 300) no Hoare annotation was computed. [2020-11-06 22:46:05,157 INFO L262 CegarLoopResult]: At program point L193(line 193) the Hoare annotation is: false [2020-11-06 22:46:05,157 INFO L266 CegarLoopResult]: For program point L193-1(line 193) no Hoare annotation was computed. [2020-11-06 22:46:05,157 INFO L266 CegarLoopResult]: For program point L86(lines 86 127) no Hoare annotation was computed. [2020-11-06 22:46:05,157 INFO L266 CegarLoopResult]: For program point L20(lines 20 312) no Hoare annotation was computed. [2020-11-06 22:46:05,157 INFO L266 CegarLoopResult]: For program point L243(lines 243 267) no Hoare annotation was computed. [2020-11-06 22:46:05,158 INFO L262 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: false [2020-11-06 22:46:05,158 INFO L266 CegarLoopResult]: For program point L177-1(line 177) no Hoare annotation was computed. [2020-11-06 22:46:05,158 INFO L266 CegarLoopResult]: For program point L45(lines 45 288) no Hoare annotation was computed. [2020-11-06 22:46:05,158 INFO L262 CegarLoopResult]: At program point L293(lines 38 294) the Hoare annotation is: (and (<= 0 main_~main__i~0) (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2020-11-06 22:46:05,158 INFO L266 CegarLoopResult]: For program point L227(lines 227 269) no Hoare annotation was computed. [2020-11-06 22:46:05,158 INFO L262 CegarLoopResult]: At program point L153(line 153) the Hoare annotation is: false [2020-11-06 22:46:05,158 INFO L266 CegarLoopResult]: For program point L153-1(line 153) no Hoare annotation was computed. [2020-11-06 22:46:05,159 INFO L262 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: false [2020-11-06 22:46:05,159 INFO L266 CegarLoopResult]: For program point L112-1(line 112) no Hoare annotation was computed. [2020-11-06 22:46:05,159 INFO L266 CegarLoopResult]: For program point mainFINAL(lines 13 313) no Hoare annotation was computed. [2020-11-06 22:46:05,160 INFO L266 CegarLoopResult]: For program point L203(lines 203 273) no Hoare annotation was computed. [2020-11-06 22:46:05,160 INFO L266 CegarLoopResult]: For program point L38(lines 38 294) no Hoare annotation was computed. [2020-11-06 22:46:05,160 INFO L262 CegarLoopResult]: At program point mainENTRY(lines 13 313) the Hoare annotation is: (= |old(~__return_334~0)| ~__return_334~0) [2020-11-06 22:46:05,160 INFO L262 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: false [2020-11-06 22:46:05,160 INFO L266 CegarLoopResult]: For program point L88-1(line 88) no Hoare annotation was computed. [2020-11-06 22:46:05,160 INFO L262 CegarLoopResult]: At program point L245(line 245) the Hoare annotation is: false [2020-11-06 22:46:05,160 INFO L266 CegarLoopResult]: For program point L245-1(line 245) no Hoare annotation was computed. [2020-11-06 22:46:05,160 INFO L262 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: false [2020-11-06 22:46:05,160 INFO L266 CegarLoopResult]: For program point L47-1(line 47) no Hoare annotation was computed. [2020-11-06 22:46:05,161 INFO L262 CegarLoopResult]: At program point L229(line 229) the Hoare annotation is: false [2020-11-06 22:46:05,161 INFO L266 CegarLoopResult]: For program point L229-1(line 229) no Hoare annotation was computed. [2020-11-06 22:46:05,161 INFO L266 CegarLoopResult]: For program point L163(lines 163 279) no Hoare annotation was computed. [2020-11-06 22:46:05,161 INFO L262 CegarLoopResult]: At program point L304(lines 25 312) the Hoare annotation is: (and (<= 0 main_~main__i~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2020-11-06 22:46:05,161 INFO L262 CegarLoopResult]: At program point L205(line 205) the Hoare annotation is: false [2020-11-06 22:46:05,161 INFO L266 CegarLoopResult]: For program point L205-1(line 205) no Hoare annotation was computed. [2020-11-06 22:46:05,161 INFO L266 CegarLoopResult]: For program point L139(lines 139 283) no Hoare annotation was computed. [2020-11-06 22:46:05,161 INFO L266 CegarLoopResult]: For program point L98(lines 98 125) no Hoare annotation was computed. [2020-11-06 22:46:05,161 INFO L266 CegarLoopResult]: For program point L255(lines 255 265) no Hoare annotation was computed. [2020-11-06 22:46:05,161 INFO L266 CegarLoopResult]: For program point L57(lines 57 286) no Hoare annotation was computed. [2020-11-06 22:46:05,162 INFO L266 CegarLoopResult]: For program point L74(lines 74 129) no Hoare annotation was computed. [2020-11-06 22:46:05,162 INFO L262 CegarLoopResult]: At program point L264(lines 31 306) the Hoare annotation is: (let ((.cse4 (<= (+ main_~main__j~0 4) main_~main__bufsize~0)) (.cse0 (= |old(~__return_334~0)| ~__return_334~0)) (.cse1 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))) (let ((.cse2 (<= 1 main_~main__j~0)) (.cse3 (let ((.cse5 (<= 0 main_~main__j~0)) (.cse6 (<= 1 main_~main__i~0))) (or (and .cse5 .cse6 .cse0 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse1) (and .cse5 .cse6 .cse4 .cse0 .cse1))))) (or (and (<= 0 main_~main__i~0) (= main_~main__j~0 0) (< main_~main__i~0 main_~main__len~0) .cse0 .cse1) (and .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~14 0))) (and .cse2 .cse3 .cse4)))) [2020-11-06 22:46:05,162 INFO L262 CegarLoopResult]: At program point L165(line 165) the Hoare annotation is: false [2020-11-06 22:46:05,162 INFO L266 CegarLoopResult]: For program point L165-1(line 165) no Hoare annotation was computed. [2020-11-06 22:46:05,162 INFO L266 CegarLoopResult]: For program point L66(lines 66 285) no Hoare annotation was computed. [2020-11-06 22:46:05,162 INFO L266 CegarLoopResult]: For program point L215(lines 215 271) no Hoare annotation was computed. [2020-11-06 22:46:05,162 INFO L262 CegarLoopResult]: At program point L141(line 141) the Hoare annotation is: false [2020-11-06 22:46:05,162 INFO L266 CegarLoopResult]: For program point L141-1(line 141) no Hoare annotation was computed. [2020-11-06 22:46:05,162 INFO L262 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: false [2020-11-06 22:46:05,163 INFO L266 CegarLoopResult]: For program point L100-1(line 100) no Hoare annotation was computed. [2020-11-06 22:46:05,163 INFO L262 CegarLoopResult]: At program point L257(line 257) the Hoare annotation is: false [2020-11-06 22:46:05,163 INFO L266 CegarLoopResult]: For program point L257-1(line 257) no Hoare annotation was computed. [2020-11-06 22:46:05,163 INFO L266 CegarLoopResult]: For program point L191(lines 191 275) no Hoare annotation was computed. [2020-11-06 22:46:05,163 INFO L262 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: false [2020-11-06 22:46:05,163 INFO L266 CegarLoopResult]: For program point L59-1(line 59) no Hoare annotation was computed. [2020-11-06 22:46:05,163 INFO L266 CegarLoopResult]: For program point L175(lines 175 277) no Hoare annotation was computed. [2020-11-06 22:46:05,163 INFO L262 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: false [2020-11-06 22:46:05,163 INFO L266 CegarLoopResult]: For program point L76-1(line 76) no Hoare annotation was computed. [2020-11-06 22:46:05,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:46:05 BoogieIcfgContainer [2020-11-06 22:46:05,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:46:05,194 INFO L168 Benchmark]: Toolchain (without parser) took 11817.07 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 126.9 MB in the beginning and 237.7 MB in the end (delta: -110.9 MB). Peak memory consumption was 147.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:05,194 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 151.0 MB. Free memory is still 126.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:46:05,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.19 ms. Allocated memory is still 151.0 MB. Free memory was 126.3 MB in the beginning and 114.8 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:05,196 INFO L168 Benchmark]: Boogie Preprocessor took 80.40 ms. Allocated memory is still 151.0 MB. Free memory was 114.8 MB in the beginning and 113.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:05,197 INFO L168 Benchmark]: RCFGBuilder took 846.54 ms. Allocated memory is still 151.0 MB. Free memory was 113.0 MB in the beginning and 125.1 MB in the end (delta: -12.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:05,197 INFO L168 Benchmark]: TraceAbstraction took 10540.29 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 124.6 MB in the beginning and 237.7 MB in the end (delta: -113.2 MB). Peak memory consumption was 144.2 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:05,200 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 151.0 MB. Free memory is still 126.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 335.19 ms. Allocated memory is still 151.0 MB. Free memory was 126.3 MB in the beginning and 114.8 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 80.40 ms. Allocated memory is still 151.0 MB. Free memory was 114.8 MB in the beginning and 113.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 846.54 ms. Allocated memory is still 151.0 MB. Free memory was 113.0 MB in the beginning and 125.1 MB in the end (delta: -12.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10540.29 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 124.6 MB in the beginning and 237.7 MB in the end (delta: -113.2 MB). Peak memory consumption was 144.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((0 <= main__i && main__j == 0) && main__i < main__len) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize) || ((1 <= main__j && (((((0 <= main__j && 1 <= main__i) && \old(__return_334) == __return_334) && !(__VERIFIER_assert__cond == 0)) && main__limit + 4 <= main__bufsize) || ((((0 <= main__j && 1 <= main__i) && main__j + 4 <= main__bufsize) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize))) && !(__VERIFIER_assert__cond == 0))) || ((1 <= main__j && (((((0 <= main__j && 1 <= main__i) && \old(__return_334) == __return_334) && !(__VERIFIER_assert__cond == 0)) && main__limit + 4 <= main__bufsize) || ((((0 <= main__j && 1 <= main__i) && main__j + 4 <= main__bufsize) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize))) && main__j + 4 <= main__bufsize) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((0 <= main__i && main__i < main__len) && 0 <= main__j) && main__j + 5 <= main__bufsize) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (0 <= main__i && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 956 SDtfs, 1620 SDslu, 568 SDs, 0 SdLazy, 1624 SolverSat, 290 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred 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, 16 MinimizatonAttempts, 387 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 53 PreInvPairs, 72 NumberOfFragments, 210 HoareAnnotationTreeSize, 53 FomulaSimplifications, 3449650758 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 24 FomulaSimplificationsInter, 697078 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 24684 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...