/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/invert_string-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 23:10:21,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 23:10:21,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 23:10:21,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 23:10:21,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 23:10:21,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 23:10:21,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 23:10:21,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 23:10:21,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 23:10:21,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 23:10:21,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 23:10:21,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 23:10:21,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 23:10:21,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 23:10:21,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 23:10:21,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 23:10:21,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 23:10:21,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 23:10:21,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 23:10:21,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 23:10:21,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 23:10:21,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 23:10:21,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 23:10:21,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 23:10:21,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 23:10:21,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 23:10:21,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 23:10:21,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 23:10:21,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 23:10:21,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 23:10:21,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 23:10:21,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 23:10:21,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 23:10:21,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 23:10:21,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 23:10:21,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 23:10:21,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 23:10:21,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 23:10:21,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 23:10:21,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 23:10:21,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 23:10:21,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 23:10:21,968 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 23:10:21,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 23:10:21,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 23:10:21,970 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 23:10:21,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 23:10:21,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 23:10:21,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 23:10:21,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 23:10:21,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 23:10:21,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 23:10:21,972 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 23:10:21,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 23:10:21,972 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 23:10:21,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 23:10:21,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 23:10:21,973 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 23:10:21,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 23:10:21,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 23:10:21,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:10:21,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 23:10:21,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 23:10:21,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 23:10:21,975 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 23:10:22,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 23:10:22,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 23:10:22,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 23:10:22,492 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 23:10:22,492 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 23:10:22,494 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-1.c [2020-09-04 23:10:22,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/59772fe1d/1078300a7fe54cb18c8585f3fc4b193e/FLAG46fdc5909 [2020-09-04 23:10:23,148 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 23:10:23,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loops/invert_string-1.c [2020-09-04 23:10:23,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/59772fe1d/1078300a7fe54cb18c8585f3fc4b193e/FLAG46fdc5909 [2020-09-04 23:10:23,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/59772fe1d/1078300a7fe54cb18c8585f3fc4b193e [2020-09-04 23:10:23,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 23:10:23,483 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 23:10:23,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 23:10:23,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 23:10:23,489 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 23:10:23,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:10:23" (1/1) ... [2020-09-04 23:10:23,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29eb21d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:23, skipping insertion in model container [2020-09-04 23:10:23,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:10:23" (1/1) ... [2020-09-04 23:10:23,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 23:10:23,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 23:10:23,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:10:23,777 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 23:10:23,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:10:23,837 INFO L208 MainTranslator]: Completed translation [2020-09-04 23:10:23,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:23 WrapperNode [2020-09-04 23:10:23,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 23:10:23,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 23:10:23,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 23:10:23,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 23:10:23,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:23" (1/1) ... [2020-09-04 23:10:23,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:23" (1/1) ... [2020-09-04 23:10:23,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:23" (1/1) ... [2020-09-04 23:10:23,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:23" (1/1) ... [2020-09-04 23:10:23,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:23" (1/1) ... [2020-09-04 23:10:23,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:23" (1/1) ... [2020-09-04 23:10:23,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:23" (1/1) ... [2020-09-04 23:10:23,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 23:10:23,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 23:10:23,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 23:10:23,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 23:10:23,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:23" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:10:24,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 23:10:24,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 23:10:24,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 23:10:24,073 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 23:10:24,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 23:10:24,073 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 23:10:24,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 23:10:24,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-09-04 23:10:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-09-04 23:10:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 23:10:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-04 23:10:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 23:10:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 23:10:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 23:10:24,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 23:10:24,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 23:10:24,452 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 23:10:24,452 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-09-04 23:10:24,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:10:24 BoogieIcfgContainer [2020-09-04 23:10:24,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 23:10:24,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 23:10:24,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 23:10:24,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 23:10:24,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 11:10:23" (1/3) ... [2020-09-04 23:10:24,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248c4c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:10:24, skipping insertion in model container [2020-09-04 23:10:24,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:23" (2/3) ... [2020-09-04 23:10:24,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248c4c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:10:24, skipping insertion in model container [2020-09-04 23:10:24,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:10:24" (3/3) ... [2020-09-04 23:10:24,469 INFO L109 eAbstractionObserver]: Analyzing ICFG invert_string-1.c [2020-09-04 23:10:24,479 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 23:10:24,489 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 23:10:24,511 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 23:10:24,541 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 23:10:24,542 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 23:10:24,542 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 23:10:24,542 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 23:10:24,542 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 23:10:24,542 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 23:10:24,543 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 23:10:24,543 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 23:10:24,564 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2020-09-04 23:10:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 23:10:24,579 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:24,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:10:24,581 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:24,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:24,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1584943199, now seen corresponding path program 1 times [2020-09-04 23:10:24,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:24,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [615328424] [2020-09-04 23:10:24,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:24,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:10:24,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [615328424] [2020-09-04 23:10:24,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:10:24,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 23:10:24,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698476484] [2020-09-04 23:10:24,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 23:10:24,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:24,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 23:10:24,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 23:10:24,881 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2020-09-04 23:10:25,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:25,153 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2020-09-04 23:10:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 23:10:25,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-09-04 23:10:25,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:25,167 INFO L225 Difference]: With dead ends: 121 [2020-09-04 23:10:25,168 INFO L226 Difference]: Without dead ends: 57 [2020-09-04 23:10:25,173 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 23:10:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-09-04 23:10:25,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-09-04 23:10:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-09-04 23:10:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2020-09-04 23:10:25,234 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 31 [2020-09-04 23:10:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:25,235 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2020-09-04 23:10:25,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 23:10:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2020-09-04 23:10:25,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 23:10:25,237 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:25,237 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:10:25,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 23:10:25,238 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:25,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:25,239 INFO L82 PathProgramCache]: Analyzing trace with hash -318765620, now seen corresponding path program 1 times [2020-09-04 23:10:25,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:25,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [968812763] [2020-09-04 23:10:25,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:25,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:10:25,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [968812763] [2020-09-04 23:10:25,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:10:25,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 23:10:25,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119639560] [2020-09-04 23:10:25,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 23:10:25,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:25,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 23:10:25,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-04 23:10:25,386 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2020-09-04 23:10:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:25,603 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2020-09-04 23:10:25,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 23:10:25,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-09-04 23:10:25,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:25,608 INFO L225 Difference]: With dead ends: 107 [2020-09-04 23:10:25,609 INFO L226 Difference]: Without dead ends: 74 [2020-09-04 23:10:25,610 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:10:25,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-09-04 23:10:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2020-09-04 23:10:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 23:10:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2020-09-04 23:10:25,634 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 31 [2020-09-04 23:10:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:25,635 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2020-09-04 23:10:25,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 23:10:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-09-04 23:10:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-09-04 23:10:25,637 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:25,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:10:25,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 23:10:25,638 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:25,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:25,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1837873718, now seen corresponding path program 1 times [2020-09-04 23:10:25,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:25,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [443087527] [2020-09-04 23:10:25,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:25,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 23:10:25,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [443087527] [2020-09-04 23:10:25,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:10:25,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 23:10:25,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457180160] [2020-09-04 23:10:25,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 23:10:25,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:25,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 23:10:25,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 23:10:25,846 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2020-09-04 23:10:26,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:26,050 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2020-09-04 23:10:26,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 23:10:26,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-09-04 23:10:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:26,052 INFO L225 Difference]: With dead ends: 95 [2020-09-04 23:10:26,052 INFO L226 Difference]: Without dead ends: 75 [2020-09-04 23:10:26,053 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:10:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-04 23:10:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2020-09-04 23:10:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-09-04 23:10:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2020-09-04 23:10:26,067 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 38 [2020-09-04 23:10:26,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:26,067 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2020-09-04 23:10:26,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 23:10:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-09-04 23:10:26,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 23:10:26,069 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:26,069 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:10:26,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 23:10:26,070 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:26,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:26,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2141827952, now seen corresponding path program 1 times [2020-09-04 23:10:26,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:26,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [211547882] [2020-09-04 23:10:26,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:27,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:10:27,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [211547882] [2020-09-04 23:10:27,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:10:27,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 23:10:27,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603044018] [2020-09-04 23:10:27,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 23:10:27,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:27,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 23:10:27,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2020-09-04 23:10:27,257 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 19 states. [2020-09-04 23:10:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:29,182 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions. [2020-09-04 23:10:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 23:10:29,189 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2020-09-04 23:10:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:29,191 INFO L225 Difference]: With dead ends: 164 [2020-09-04 23:10:29,193 INFO L226 Difference]: Without dead ends: 162 [2020-09-04 23:10:29,196 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 23:10:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-09-04 23:10:29,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 90. [2020-09-04 23:10:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-09-04 23:10:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2020-09-04 23:10:29,232 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 48 [2020-09-04 23:10:29,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:29,233 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2020-09-04 23:10:29,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 23:10:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2020-09-04 23:10:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-09-04 23:10:29,235 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:29,236 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:10:29,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 23:10:29,236 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:29,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:29,237 INFO L82 PathProgramCache]: Analyzing trace with hash -523876270, now seen corresponding path program 2 times [2020-09-04 23:10:29,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:29,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [582551784] [2020-09-04 23:10:29,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:29,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:10:29,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [582551784] [2020-09-04 23:10:29,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:10:29,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 23:10:29,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989776494] [2020-09-04 23:10:29,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:10:29,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:29,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:10:29,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:10:29,342 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 9 states. [2020-09-04 23:10:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:29,747 INFO L93 Difference]: Finished difference Result 171 states and 180 transitions. [2020-09-04 23:10:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 23:10:29,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2020-09-04 23:10:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:29,755 INFO L225 Difference]: With dead ends: 171 [2020-09-04 23:10:29,755 INFO L226 Difference]: Without dead ends: 151 [2020-09-04 23:10:29,759 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2020-09-04 23:10:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-09-04 23:10:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 100. [2020-09-04 23:10:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-04 23:10:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2020-09-04 23:10:29,788 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 55 [2020-09-04 23:10:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:29,789 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2020-09-04 23:10:29,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:10:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2020-09-04 23:10:29,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-09-04 23:10:29,791 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:29,791 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:10:29,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 23:10:29,792 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:29,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:29,792 INFO L82 PathProgramCache]: Analyzing trace with hash -2134174762, now seen corresponding path program 3 times [2020-09-04 23:10:29,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:29,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [406648705] [2020-09-04 23:10:29,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:29,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:10:29,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [406648705] [2020-09-04 23:10:29,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:10:29,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 23:10:29,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498132006] [2020-09-04 23:10:29,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:10:29,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:29,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:10:29,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:10:29,903 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 10 states. [2020-09-04 23:10:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:30,254 INFO L93 Difference]: Finished difference Result 165 states and 172 transitions. [2020-09-04 23:10:30,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 23:10:30,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2020-09-04 23:10:30,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:30,256 INFO L225 Difference]: With dead ends: 165 [2020-09-04 23:10:30,257 INFO L226 Difference]: Without dead ends: 135 [2020-09-04 23:10:30,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2020-09-04 23:10:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-09-04 23:10:30,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2020-09-04 23:10:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-04 23:10:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2020-09-04 23:10:30,277 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 58 [2020-09-04 23:10:30,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:30,278 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2020-09-04 23:10:30,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:10:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2020-09-04 23:10:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 23:10:30,279 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:30,280 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:10:30,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 23:10:30,280 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:30,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash -280271430, now seen corresponding path program 1 times [2020-09-04 23:10:30,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:30,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1062490668] [2020-09-04 23:10:30,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:30,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:30,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:10:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 23:10:30,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1062490668] [2020-09-04 23:10:30,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:10:30,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 23:10:30,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838849111] [2020-09-04 23:10:30,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:10:30,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:30,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:10:30,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:10:30,418 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 10 states. [2020-09-04 23:10:30,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:30,766 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2020-09-04 23:10:30,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 23:10:30,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2020-09-04 23:10:30,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:30,770 INFO L225 Difference]: With dead ends: 143 [2020-09-04 23:10:30,770 INFO L226 Difference]: Without dead ends: 92 [2020-09-04 23:10:30,771 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2020-09-04 23:10:30,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-09-04 23:10:30,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2020-09-04 23:10:30,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-04 23:10:30,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2020-09-04 23:10:30,800 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 64 [2020-09-04 23:10:30,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:30,805 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2020-09-04 23:10:30,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:10:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2020-09-04 23:10:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-09-04 23:10:30,807 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:30,807 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:10:30,807 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 23:10:30,808 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:30,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:30,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1930216728, now seen corresponding path program 4 times [2020-09-04 23:10:30,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:30,809 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [711717755] [2020-09-04 23:10:30,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:31,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:10:31,701 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [711717755] [2020-09-04 23:10:31,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:10:31,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 23:10:31,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546028591] [2020-09-04 23:10:31,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 23:10:31,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:31,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 23:10:31,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2020-09-04 23:10:31,704 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 23 states. [2020-09-04 23:10:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:33,631 INFO L93 Difference]: Finished difference Result 191 states and 200 transitions. [2020-09-04 23:10:33,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-09-04 23:10:33,631 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 65 [2020-09-04 23:10:33,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:33,633 INFO L225 Difference]: With dead ends: 191 [2020-09-04 23:10:33,634 INFO L226 Difference]: Without dead ends: 189 [2020-09-04 23:10:33,636 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=499, Invalid=2693, Unknown=0, NotChecked=0, Total=3192 [2020-09-04 23:10:33,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-09-04 23:10:33,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 117. [2020-09-04 23:10:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-09-04 23:10:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2020-09-04 23:10:33,665 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 65 [2020-09-04 23:10:33,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:33,667 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2020-09-04 23:10:33,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 23:10:33,667 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2020-09-04 23:10:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 23:10:33,672 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:33,673 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:10:33,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 23:10:33,674 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:33,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:33,674 INFO L82 PathProgramCache]: Analyzing trace with hash 499090838, now seen corresponding path program 5 times [2020-09-04 23:10:33,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:33,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1379937558] [2020-09-04 23:10:33,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:33,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:10:33,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1379937558] [2020-09-04 23:10:33,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:10:33,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 23:10:33,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093372977] [2020-09-04 23:10:33,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:10:33,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:33,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:10:33,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:10:33,886 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 12 states. [2020-09-04 23:10:34,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:34,448 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2020-09-04 23:10:34,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 23:10:34,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2020-09-04 23:10:34,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:34,452 INFO L225 Difference]: With dead ends: 193 [2020-09-04 23:10:34,452 INFO L226 Difference]: Without dead ends: 173 [2020-09-04 23:10:34,453 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2020-09-04 23:10:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-09-04 23:10:34,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 127. [2020-09-04 23:10:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-09-04 23:10:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2020-09-04 23:10:34,473 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 72 [2020-09-04 23:10:34,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:34,474 INFO L479 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2020-09-04 23:10:34,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:10:34,474 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2020-09-04 23:10:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-09-04 23:10:34,475 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:34,475 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:10:34,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 23:10:34,476 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:34,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1430946398, now seen corresponding path program 6 times [2020-09-04 23:10:34,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:34,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1513934146] [2020-09-04 23:10:34,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:34,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:10:34,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1513934146] [2020-09-04 23:10:34,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:10:34,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 23:10:34,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170064610] [2020-09-04 23:10:34,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 23:10:34,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:34,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 23:10:34,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-09-04 23:10:34,621 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 13 states. [2020-09-04 23:10:35,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:35,066 INFO L93 Difference]: Finished difference Result 192 states and 199 transitions. [2020-09-04 23:10:35,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 23:10:35,066 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2020-09-04 23:10:35,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:35,067 INFO L225 Difference]: With dead ends: 192 [2020-09-04 23:10:35,068 INFO L226 Difference]: Without dead ends: 162 [2020-09-04 23:10:35,069 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2020-09-04 23:10:35,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-09-04 23:10:35,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 127. [2020-09-04 23:10:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-09-04 23:10:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 130 transitions. [2020-09-04 23:10:35,089 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 130 transitions. Word has length 75 [2020-09-04 23:10:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:35,090 INFO L479 AbstractCegarLoop]: Abstraction has 127 states and 130 transitions. [2020-09-04 23:10:35,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 23:10:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2020-09-04 23:10:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-09-04 23:10:35,091 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:35,091 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:10:35,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 23:10:35,092 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:35,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:35,092 INFO L82 PathProgramCache]: Analyzing trace with hash 810536514, now seen corresponding path program 2 times [2020-09-04 23:10:35,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:35,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [954527660] [2020-09-04 23:10:35,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 23:10:35,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 23:10:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 23:10:35,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 23:10:35,184 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 23:10:35,185 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 23:10:35,185 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 23:10:35,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 11:10:35 BoogieIcfgContainer [2020-09-04 23:10:35,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 23:10:35,256 INFO L168 Benchmark]: Toolchain (without parser) took 11771.35 ms. Allocated memory was 145.8 MB in the beginning and 323.5 MB in the end (delta: 177.7 MB). Free memory was 103.2 MB in the beginning and 248.0 MB in the end (delta: -144.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. [2020-09-04 23:10:35,257 INFO L168 Benchmark]: CDTParser took 1.07 ms. Allocated memory is still 145.8 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 23:10:35,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.13 ms. Allocated memory is still 145.8 MB. Free memory was 103.0 MB in the beginning and 92.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-09-04 23:10:35,258 INFO L168 Benchmark]: Boogie Preprocessor took 143.37 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 92.2 MB in the beginning and 180.2 MB in the end (delta: -88.0 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-09-04 23:10:35,259 INFO L168 Benchmark]: RCFGBuilder took 476.16 ms. Allocated memory is still 202.9 MB. Free memory was 180.2 MB in the beginning and 161.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2020-09-04 23:10:35,260 INFO L168 Benchmark]: TraceAbstraction took 10791.83 ms. Allocated memory was 202.9 MB in the beginning and 323.5 MB in the end (delta: 120.6 MB). Free memory was 160.7 MB in the beginning and 248.0 MB in the end (delta: -87.4 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. [2020-09-04 23:10:35,271 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07 ms. Allocated memory is still 145.8 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 354.13 ms. Allocated memory is still 145.8 MB. Free memory was 103.0 MB in the beginning and 92.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.37 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 92.2 MB in the beginning and 180.2 MB in the end (delta: -88.0 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 476.16 ms. Allocated memory is still 202.9 MB. Free memory was 180.2 MB in the beginning and 161.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10791.83 ms. Allocated memory was 202.9 MB in the beginning and 323.5 MB in the end (delta: 120.6 MB). Free memory was 160.7 MB in the beginning and 248.0 MB in the end (delta: -87.4 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int MAX = __VERIFIER_nondet_uint(); VAL [__VERIFIER_nondet_uint()=2, MAX=2] [L15] COND FALSE !(!(MAX > 0)) VAL [MAX=2] [L16] char str1[MAX], str2[MAX]; VAL [MAX=2, str1={4:0}, str2={3:0}] [L17] int cont, i, j; VAL [MAX=2, str1={4:0}, str2={3:0}] [L18] cont = 0 VAL [cont=0, MAX=2, str1={4:0}, str2={3:0}] [L20] i=0 VAL [cont=0, i=0, MAX=2, str1={4:0}, str2={3:0}] [L20] COND TRUE i= 0 VAL [cont=0, i=1, j=0, MAX=2, str1={4:0}, str2={3:0}] [L28] EXPR str1[0] VAL [cont=0, i=1, j=0, MAX=2, str1={4:0}, str1[0]=-1, str2={3:0}] [L28] str2[j] = str1[0] VAL [cont=0, i=1, j=0, MAX=2, str1={4:0}, str1[0]=-1, str2={3:0}] [L29] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={4:0}, str2={3:0}] [L27] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={3:0}] [L27] COND TRUE i >= 0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={3:0}] [L28] EXPR str1[0] VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str1[0]=-1, str2={3:0}] [L28] str2[j] = str1[0] VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str1[0]=-1, str2={3:0}] [L29] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={4:0}, str2={3:0}] [L27] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={3:0}] [L27] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={3:0}] [L32] j = MAX-1 VAL [cont=0, i=-1, j=1, MAX=2, str1={4:0}, str2={3:0}] [L33] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={3:0}] [L33] COND TRUE i