/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 --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/loop-invgen/id_build.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:39:04,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:39:04,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:39:04,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:39:04,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:39:04,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:39:04,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:39:04,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:39:04,241 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:39:04,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:39:04,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:39:04,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:39:04,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:39:04,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:39:04,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:39:04,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:39:04,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:39:04,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:39:04,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:39:04,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:39:04,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:39:04,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:39:04,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:39:04,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:39:04,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:39:04,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:39:04,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:39:04,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:39:04,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:39:04,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:39:04,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:39:04,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:39:04,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:39:04,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:39:04,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:39:04,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:39:04,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:39:04,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:39:04,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:39:04,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:39:04,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:39:04,339 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:39:04,365 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:39:04,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:39:04,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:39:04,371 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:39:04,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:39:04,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:39:04,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:39:04,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:39:04,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:39:04,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:39:04,373 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:39:04,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:39:04,374 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:39:04,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:39:04,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:39:04,375 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:39:04,375 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:39:04,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:39:04,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:39:04,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:39:04,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:39:04,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:39:04,377 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.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-11-07 06:39:04,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:39:04,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:39:04,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:39:04,827 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:39:04,827 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:39:04,829 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/id_build.i [2020-11-07 06:39:04,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f2b180f/69bd5f38472e4fa08ba2e9c75f542e00/FLAGf70f57db4 [2020-11-07 06:39:05,610 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:39:05,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i [2020-11-07 06:39:05,619 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f2b180f/69bd5f38472e4fa08ba2e9c75f542e00/FLAGf70f57db4 [2020-11-07 06:39:05,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f2b180f/69bd5f38472e4fa08ba2e9c75f542e00 [2020-11-07 06:39:05,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:39:06,004 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:39:06,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:39:06,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:39:06,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:39:06,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:39:05" (1/1) ... [2020-11-07 06:39:06,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33af22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:06, skipping insertion in model container [2020-11-07 06:39:06,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:39:05" (1/1) ... [2020-11-07 06:39:06,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:39:06,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:39:06,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:39:06,268 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:39:06,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:39:06,318 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:39:06,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:06 WrapperNode [2020-11-07 06:39:06,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:39:06,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:39:06,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:39:06,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:39:06,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:06" (1/1) ... [2020-11-07 06:39:06,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:06" (1/1) ... [2020-11-07 06:39:06,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:06" (1/1) ... [2020-11-07 06:39:06,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:06" (1/1) ... [2020-11-07 06:39:06,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:06" (1/1) ... [2020-11-07 06:39:06,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:06" (1/1) ... [2020-11-07 06:39:06,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:06" (1/1) ... [2020-11-07 06:39:06,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:39:06,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:39:06,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:39:06,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:39:06,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:06" (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-07 06:39:06,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:39:06,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:39:06,507 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:39:06,508 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 06:39:06,508 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:39:06,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:39:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:39:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:39:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 06:39:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 06:39:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:39:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:39:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 06:39:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:39:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:39:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:39:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:39:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:39:06,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:39:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:39:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:39:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:39:06,847 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:39:06,847 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-07 06:39:06,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:39:06 BoogieIcfgContainer [2020-11-07 06:39:06,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:39:06,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:39:06,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:39:06,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:39:06,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:39:05" (1/3) ... [2020-11-07 06:39:06,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48acebe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:39:06, skipping insertion in model container [2020-11-07 06:39:06,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:06" (2/3) ... [2020-11-07 06:39:06,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48acebe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:39:06, skipping insertion in model container [2020-11-07 06:39:06,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:39:06" (3/3) ... [2020-11-07 06:39:06,860 INFO L111 eAbstractionObserver]: Analyzing ICFG id_build.i [2020-11-07 06:39:06,895 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:39:06,903 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:39:06,927 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:39:06,974 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:39:06,974 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:39:06,974 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:39:06,974 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:39:06,974 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:39:06,975 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:39:06,975 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:39:06,975 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:39:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-11-07 06:39:07,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-07 06:39:07,019 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:07,021 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] [2020-11-07 06:39:07,022 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:07,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:07,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1115921713, now seen corresponding path program 1 times [2020-11-07 06:39:07,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:07,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1995942828] [2020-11-07 06:39:07,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:07,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:07,521 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-07 06:39:07,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1995942828] [2020-11-07 06:39:07,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:39:07,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 06:39:07,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841148573] [2020-11-07 06:39:07,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:39:07,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:07,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:39:07,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:39:07,551 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 6 states. [2020-11-07 06:39:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:07,999 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2020-11-07 06:39:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:39:08,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-11-07 06:39:08,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:08,010 INFO L225 Difference]: With dead ends: 75 [2020-11-07 06:39:08,011 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 06:39:08,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 06:39:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-07 06:39:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-07 06:39:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-11-07 06:39:08,072 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 28 [2020-11-07 06:39:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:08,072 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-11-07 06:39:08,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:39:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-11-07 06:39:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 06:39:08,074 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:08,075 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:08,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:39:08,075 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:08,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:08,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1724895446, now seen corresponding path program 1 times [2020-11-07 06:39:08,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:08,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1674134635] [2020-11-07 06:39:08,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:08,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:08,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 06:39:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:39:08,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1674134635] [2020-11-07 06:39:08,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:39:08,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 06:39:08,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378545700] [2020-11-07 06:39:08,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:39:08,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:08,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:39:08,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:39:08,222 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 6 states. [2020-11-07 06:39:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:08,517 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2020-11-07 06:39:08,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:39:08,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-11-07 06:39:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:08,521 INFO L225 Difference]: With dead ends: 60 [2020-11-07 06:39:08,521 INFO L226 Difference]: Without dead ends: 56 [2020-11-07 06:39:08,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-07 06:39:08,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2020-11-07 06:39:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-07 06:39:08,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2020-11-07 06:39:08,548 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 33 [2020-11-07 06:39:08,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:08,549 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2020-11-07 06:39:08,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:39:08,549 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2020-11-07 06:39:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-07 06:39:08,551 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:08,552 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:08,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:39:08,552 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:08,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:08,553 INFO L82 PathProgramCache]: Analyzing trace with hash -311170620, now seen corresponding path program 1 times [2020-11-07 06:39:08,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:08,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1522437945] [2020-11-07 06:39:08,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:08,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:08,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:39:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:08,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:39:08,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1522437945] [2020-11-07 06:39:08,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:39:08,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 06:39:08,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182664719] [2020-11-07 06:39:08,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 06:39:08,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:08,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 06:39:08,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 06:39:08,663 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 4 states. [2020-11-07 06:39:08,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:08,814 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2020-11-07 06:39:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 06:39:08,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-11-07 06:39:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:08,817 INFO L225 Difference]: With dead ends: 87 [2020-11-07 06:39:08,817 INFO L226 Difference]: Without dead ends: 64 [2020-11-07 06:39:08,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:39:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-07 06:39:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2020-11-07 06:39:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-07 06:39:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2020-11-07 06:39:08,846 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2020-11-07 06:39:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:08,847 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2020-11-07 06:39:08,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 06:39:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-11-07 06:39:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-07 06:39:08,851 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:08,851 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 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-11-07 06:39:08,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:39:08,853 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:08,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:08,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2071585797, now seen corresponding path program 1 times [2020-11-07 06:39:08,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:08,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [782506352] [2020-11-07 06:39:08,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:08,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:09,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 06:39:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:09,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:39:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:09,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-07 06:39:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:39:09,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [782506352] [2020-11-07 06:39:09,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:09,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 06:39:09,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927653843] [2020-11-07 06:39:09,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:39:09,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:09,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:39:09,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:39:09,026 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 6 states. [2020-11-07 06:39:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:09,272 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2020-11-07 06:39:09,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:39:09,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2020-11-07 06:39:09,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:09,275 INFO L225 Difference]: With dead ends: 100 [2020-11-07 06:39:09,275 INFO L226 Difference]: Without dead ends: 76 [2020-11-07 06:39:09,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-11-07 06:39:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2020-11-07 06:39:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-07 06:39:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2020-11-07 06:39:09,306 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 53 [2020-11-07 06:39:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:09,309 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2020-11-07 06:39:09,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:39:09,309 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2020-11-07 06:39:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-07 06:39:09,318 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:09,318 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 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] [2020-11-07 06:39:09,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:39:09,319 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:09,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1288152954, now seen corresponding path program 2 times [2020-11-07 06:39:09,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:09,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1734697065] [2020-11-07 06:39:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:09,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:09,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 06:39:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:09,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:39:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:09,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-07 06:39:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:09,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:39:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:09,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:39:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-11-07 06:39:09,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1734697065] [2020-11-07 06:39:09,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:09,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:39:09,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391753560] [2020-11-07 06:39:09,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:39:09,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:09,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:39:09,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:39:09,509 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 8 states. [2020-11-07 06:39:09,848 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-11-07 06:39:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:10,135 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2020-11-07 06:39:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:39:10,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2020-11-07 06:39:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:10,141 INFO L225 Difference]: With dead ends: 96 [2020-11-07 06:39:10,141 INFO L226 Difference]: Without dead ends: 92 [2020-11-07 06:39:10,142 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:39:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-07 06:39:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2020-11-07 06:39:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-11-07 06:39:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2020-11-07 06:39:10,190 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 67 [2020-11-07 06:39:10,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:10,191 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2020-11-07 06:39:10,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:39:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2020-11-07 06:39:10,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-11-07 06:39:10,194 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:10,194 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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] [2020-11-07 06:39:10,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:39:10,195 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:10,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:10,195 INFO L82 PathProgramCache]: Analyzing trace with hash -406653898, now seen corresponding path program 3 times [2020-11-07 06:39:10,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:10,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [949679214] [2020-11-07 06:39:10,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:10,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:10,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 06:39:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:10,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:39:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:10,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-07 06:39:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:10,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:39:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:10,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:39:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:10,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:39:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:10,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 06:39:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:10,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:39:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:10,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-07 06:39:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2020-11-07 06:39:10,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [949679214] [2020-11-07 06:39:10,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:10,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:39:10,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096543126] [2020-11-07 06:39:10,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:39:10,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:10,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:39:10,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:39:10,363 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 8 states. [2020-11-07 06:39:10,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:10,817 INFO L93 Difference]: Finished difference Result 172 states and 205 transitions. [2020-11-07 06:39:10,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:39:10,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2020-11-07 06:39:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:10,820 INFO L225 Difference]: With dead ends: 172 [2020-11-07 06:39:10,820 INFO L226 Difference]: Without dead ends: 120 [2020-11-07 06:39:10,821 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:39:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-11-07 06:39:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2020-11-07 06:39:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-07 06:39:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2020-11-07 06:39:10,851 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 101 [2020-11-07 06:39:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:10,852 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2020-11-07 06:39:10,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:39:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2020-11-07 06:39:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-07 06:39:10,853 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:10,853 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 7, 7, 7, 6, 6, 6, 6, 3, 3, 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] [2020-11-07 06:39:10,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:39:10,854 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:10,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:10,854 INFO L82 PathProgramCache]: Analyzing trace with hash 937547704, now seen corresponding path program 4 times [2020-11-07 06:39:10,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:10,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1315206980] [2020-11-07 06:39:10,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 06:39:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:39:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-07 06:39:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:39:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-07 06:39:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-07 06:39:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 06:39:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:39:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-11-07 06:39:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-11-07 06:39:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 06:39:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-11-07 06:39:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 06:39:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 101 proven. 21 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2020-11-07 06:39:11,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1315206980] [2020-11-07 06:39:11,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:11,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:39:11,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762693795] [2020-11-07 06:39:11,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:39:11,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:11,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:39:11,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:11,136 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand 10 states. [2020-11-07 06:39:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:11,726 INFO L93 Difference]: Finished difference Result 202 states and 245 transitions. [2020-11-07 06:39:11,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:39:11,727 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2020-11-07 06:39:11,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:11,729 INFO L225 Difference]: With dead ends: 202 [2020-11-07 06:39:11,729 INFO L226 Difference]: Without dead ends: 138 [2020-11-07 06:39:11,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:39:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-11-07 06:39:11,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 126. [2020-11-07 06:39:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-11-07 06:39:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2020-11-07 06:39:11,766 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 129 [2020-11-07 06:39:11,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:11,767 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2020-11-07 06:39:11,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:39:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2020-11-07 06:39:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-11-07 06:39:11,769 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:11,769 INFO L422 BasicCegarLoop]: trace histogram [18, 17, 17, 9, 9, 9, 9, 8, 8, 8, 8, 3, 3, 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] [2020-11-07 06:39:11,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:39:11,769 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:11,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:11,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1632285754, now seen corresponding path program 5 times [2020-11-07 06:39:11,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:11,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1281849630] [2020-11-07 06:39:11,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 06:39:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:39:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-07 06:39:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:39:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-07 06:39:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-07 06:39:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:39:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:39:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-11-07 06:39:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-11-07 06:39:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 06:39:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-11-07 06:39:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-07 06:39:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-11-07 06:39:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 06:39:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:11,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 06:39:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:12,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-11-07 06:39:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 156 proven. 40 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2020-11-07 06:39:12,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1281849630] [2020-11-07 06:39:12,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:12,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:39:12,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574048584] [2020-11-07 06:39:12,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:39:12,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:12,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:39:12,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:39:12,047 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand 12 states. [2020-11-07 06:39:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:12,823 INFO L93 Difference]: Finished difference Result 232 states and 285 transitions. [2020-11-07 06:39:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:39:12,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2020-11-07 06:39:12,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:12,828 INFO L225 Difference]: With dead ends: 232 [2020-11-07 06:39:12,828 INFO L226 Difference]: Without dead ends: 156 [2020-11-07 06:39:12,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2020-11-07 06:39:12,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-11-07 06:39:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2020-11-07 06:39:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-11-07 06:39:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 173 transitions. [2020-11-07 06:39:12,878 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 173 transitions. Word has length 157 [2020-11-07 06:39:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:12,880 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 173 transitions. [2020-11-07 06:39:12,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:39:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 173 transitions. [2020-11-07 06:39:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-07 06:39:12,885 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:12,886 INFO L422 BasicCegarLoop]: trace histogram [22, 21, 21, 11, 11, 11, 11, 10, 10, 10, 10, 3, 3, 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] [2020-11-07 06:39:12,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:39:12,886 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1967519300, now seen corresponding path program 6 times [2020-11-07 06:39:12,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:12,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [422069560] [2020-11-07 06:39:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 06:39:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:39:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-07 06:39:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:39:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-07 06:39:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-07 06:39:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:39:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:39:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-11-07 06:39:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-11-07 06:39:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 06:39:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-11-07 06:39:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-07 06:39:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-11-07 06:39:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 06:39:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 06:39:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2020-11-07 06:39:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-11-07 06:39:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:39:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 06:39:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-11-07 06:39:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 223 proven. 65 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2020-11-07 06:39:13,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [422069560] [2020-11-07 06:39:13,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:13,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 06:39:13,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386634004] [2020-11-07 06:39:13,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 06:39:13,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:13,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 06:39:13,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:39:13,182 INFO L87 Difference]: Start difference. First operand 144 states and 173 transitions. Second operand 14 states. [2020-11-07 06:39:14,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:14,080 INFO L93 Difference]: Finished difference Result 262 states and 325 transitions. [2020-11-07 06:39:14,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 06:39:14,080 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 185 [2020-11-07 06:39:14,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:14,093 INFO L225 Difference]: With dead ends: 262 [2020-11-07 06:39:14,093 INFO L226 Difference]: Without dead ends: 174 [2020-11-07 06:39:14,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=591, Unknown=0, NotChecked=0, Total=870 [2020-11-07 06:39:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-11-07 06:39:14,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 162. [2020-11-07 06:39:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-11-07 06:39:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 197 transitions. [2020-11-07 06:39:14,138 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 197 transitions. Word has length 185 [2020-11-07 06:39:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:14,138 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 197 transitions. [2020-11-07 06:39:14,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 06:39:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 197 transitions. [2020-11-07 06:39:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-11-07 06:39:14,141 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:14,142 INFO L422 BasicCegarLoop]: trace histogram [26, 25, 25, 13, 13, 13, 13, 12, 12, 12, 12, 3, 3, 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] [2020-11-07 06:39:14,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:39:14,142 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:14,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:14,143 INFO L82 PathProgramCache]: Analyzing trace with hash 841766974, now seen corresponding path program 7 times [2020-11-07 06:39:14,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:14,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [809744931] [2020-11-07 06:39:14,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 06:39:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:39:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-07 06:39:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:39:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-07 06:39:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-07 06:39:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:39:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:39:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-11-07 06:39:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-11-07 06:39:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:39:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:39:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-07 06:39:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-11-07 06:39:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 06:39:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 06:39:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2020-11-07 06:39:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-11-07 06:39:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:39:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 06:39:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2020-11-07 06:39:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-11-07 06:39:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 06:39:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-11-07 06:39:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2020-11-07 06:39:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 302 proven. 96 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2020-11-07 06:39:14,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [809744931] [2020-11-07 06:39:14,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:14,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 06:39:14,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777513376] [2020-11-07 06:39:14,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 06:39:14,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:14,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 06:39:14,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:39:14,675 INFO L87 Difference]: Start difference. First operand 162 states and 197 transitions. Second operand 16 states. [2020-11-07 06:39:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:15,891 INFO L93 Difference]: Finished difference Result 292 states and 365 transitions. [2020-11-07 06:39:15,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 06:39:15,892 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 213 [2020-11-07 06:39:15,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:15,895 INFO L225 Difference]: With dead ends: 292 [2020-11-07 06:39:15,895 INFO L226 Difference]: Without dead ends: 192 [2020-11-07 06:39:15,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 06:39:15,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-11-07 06:39:15,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 180. [2020-11-07 06:39:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-11-07 06:39:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 221 transitions. [2020-11-07 06:39:15,944 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 221 transitions. Word has length 213 [2020-11-07 06:39:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:15,944 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 221 transitions. [2020-11-07 06:39:15,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 06:39:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 221 transitions. [2020-11-07 06:39:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-11-07 06:39:15,951 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:15,951 INFO L422 BasicCegarLoop]: trace histogram [30, 29, 29, 15, 15, 15, 15, 14, 14, 14, 14, 3, 3, 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] [2020-11-07 06:39:15,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:39:15,951 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:15,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:15,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1931599936, now seen corresponding path program 8 times [2020-11-07 06:39:15,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:15,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [877886659] [2020-11-07 06:39:15,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 06:39:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:39:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-07 06:39:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:39:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-07 06:39:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-07 06:39:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:39:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:39:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-11-07 06:39:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-11-07 06:39:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:39:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:39:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:39:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-11-07 06:39:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-11-07 06:39:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-11-07 06:39:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2020-11-07 06:39:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-11-07 06:39:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:39:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 06:39:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2020-11-07 06:39:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-11-07 06:39:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 06:39:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-11-07 06:39:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-11-07 06:39:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2020-11-07 06:39:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2020-11-07 06:39:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2020-11-07 06:39:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2020-11-07 06:39:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2310 backedges. 393 proven. 133 refuted. 0 times theorem prover too weak. 1784 trivial. 0 not checked. [2020-11-07 06:39:16,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [877886659] [2020-11-07 06:39:16,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:16,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 06:39:16,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832283584] [2020-11-07 06:39:16,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 06:39:16,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:16,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 06:39:16,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2020-11-07 06:39:16,470 INFO L87 Difference]: Start difference. First operand 180 states and 221 transitions. Second operand 18 states. [2020-11-07 06:39:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:17,836 INFO L93 Difference]: Finished difference Result 310 states and 387 transitions. [2020-11-07 06:39:17,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 06:39:17,836 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 241 [2020-11-07 06:39:17,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:17,839 INFO L225 Difference]: With dead ends: 310 [2020-11-07 06:39:17,839 INFO L226 Difference]: Without dead ends: 198 [2020-11-07 06:39:17,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=485, Invalid=1075, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 06:39:17,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-11-07 06:39:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2020-11-07 06:39:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-11-07 06:39:17,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 245 transitions. [2020-11-07 06:39:17,879 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 245 transitions. Word has length 241 [2020-11-07 06:39:17,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:17,880 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 245 transitions. [2020-11-07 06:39:17,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 06:39:17,880 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 245 transitions. [2020-11-07 06:39:17,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2020-11-07 06:39:17,884 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:17,884 INFO L422 BasicCegarLoop]: trace histogram [34, 33, 33, 17, 17, 17, 17, 16, 16, 16, 16, 3, 3, 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] [2020-11-07 06:39:17,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 06:39:17,885 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:17,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:17,885 INFO L82 PathProgramCache]: Analyzing trace with hash -414457790, now seen corresponding path program 9 times [2020-11-07 06:39:17,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:17,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [105038685] [2020-11-07 06:39:17,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 06:39:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:39:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-07 06:39:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:39:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-07 06:39:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-07 06:39:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:39:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 06:39:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-11-07 06:39:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-11-07 06:39:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-07 06:39:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:39:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:39:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-11-07 06:39:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2020-11-07 06:39:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-11-07 06:39:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2020-11-07 06:39:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-11-07 06:39:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:39:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-11-07 06:39:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2020-11-07 06:39:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-11-07 06:39:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-11-07 06:39:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-11-07 06:39:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-11-07 06:39:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2020-11-07 06:39:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2020-11-07 06:39:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2020-11-07 06:39:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2020-11-07 06:39:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-11-07 06:39:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2020-11-07 06:39:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2020-11-07 06:39:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2020-11-07 06:39:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2990 backedges. 94 proven. 432 refuted. 0 times theorem prover too weak. 2464 trivial. 0 not checked. [2020-11-07 06:39:18,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [105038685] [2020-11-07 06:39:18,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:18,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:39:18,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156168698] [2020-11-07 06:39:18,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:39:18,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:18,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:39:18,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:18,264 INFO L87 Difference]: Start difference. First operand 198 states and 245 transitions. Second operand 10 states. [2020-11-07 06:39:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:18,968 INFO L93 Difference]: Finished difference Result 200 states and 247 transitions. [2020-11-07 06:39:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:39:18,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 269 [2020-11-07 06:39:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:18,970 INFO L225 Difference]: With dead ends: 200 [2020-11-07 06:39:18,970 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 06:39:18,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:39:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 06:39:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 06:39:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 06:39:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 06:39:18,973 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 269 [2020-11-07 06:39:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:18,974 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 06:39:18,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:39:18,974 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 06:39:18,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 06:39:18,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 06:39:18,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 06:39:19,658 WARN L194 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 98 [2020-11-07 06:39:20,135 WARN L194 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 98 [2020-11-07 06:39:20,440 WARN L194 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 106 [2020-11-07 06:39:20,844 WARN L194 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 98 [2020-11-07 06:39:21,497 WARN L194 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 16 [2020-11-07 06:39:21,816 WARN L194 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 16 [2020-11-07 06:39:22,295 WARN L194 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 16 [2020-11-07 06:39:22,680 WARN L194 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 16 [2020-11-07 06:39:22,739 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 12) the Hoare annotation is: true [2020-11-07 06:39:22,739 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 12) the Hoare annotation is: true [2020-11-07 06:39:22,741 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:39:22,741 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:39:22,741 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:39:22,741 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: true [2020-11-07 06:39:22,741 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:39:22,741 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 06:39:22,741 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 12) the Hoare annotation is: true [2020-11-07 06:39:22,741 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 06:39:22,742 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:39:22,742 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:39:22,742 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2020-11-07 06:39:22,742 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:39:22,742 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:39:22,742 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:39:22,743 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:39:22,743 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 06:39:22,743 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:39:22,743 INFO L266 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-11-07 06:39:22,743 INFO L266 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-11-07 06:39:22,743 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:39:22,743 INFO L266 CegarLoopResult]: For program point L15-3(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:39:22,743 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:39:22,743 INFO L262 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (<= (+ main_~i~0 1) main_~nlen~0)) (.cse1 (<= main_~j~0 7))) (or (and .cse0 .cse1 (<= 1 main_~i~0)) (and .cse0 .cse1 (= main_~i~0 0)))) [2020-11-07 06:39:22,745 INFO L262 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (let ((.cse0 (<= (+ main_~i~0 1) main_~nlen~0)) (.cse1 (<= main_~j~0 7))) (or (and .cse0 .cse1 (<= 1 main_~i~0)) (and .cse0 .cse1 (= main_~i~0 0)))) [2020-11-07 06:39:22,745 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 06:39:22,745 INFO L269 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-11-07 06:39:22,746 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 24 34) the Hoare annotation is: true [2020-11-07 06:39:22,746 INFO L269 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-11-07 06:39:22,746 INFO L262 CegarLoopResult]: At program point L27-3(lines 27 32) the Hoare annotation is: (let ((.cse0 (<= (+ main_~i~0 1) main_~nlen~0))) (or (and .cse0 (<= 1 main_~i~0)) (and .cse0 (= main_~i~0 0)))) [2020-11-07 06:39:22,746 INFO L269 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: true [2020-11-07 06:39:22,746 INFO L262 CegarLoopResult]: At program point L27-4(line 27) the Hoare annotation is: (let ((.cse0 (<= (+ main_~i~0 1) main_~nlen~0))) (or (and .cse0 (= main_~i~0 0) (= |main_#t~post4| 0)) (and .cse0 (<= 1 main_~i~0) (<= 1 |main_#t~post4|)))) [2020-11-07 06:39:22,746 INFO L269 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: true [2020-11-07 06:39:22,746 INFO L262 CegarLoopResult]: At program point L27-5(line 27) the Hoare annotation is: (or (and (<= 2 main_~i~0) (<= 1 |main_#t~post4|)) (and (<= 1 main_~i~0) (= |main_#t~post4| 0))) [2020-11-07 06:39:22,747 INFO L262 CegarLoopResult]: At program point L27-6(lines 27 32) the Hoare annotation is: (or (= main_~i~0 0) (<= 1 main_~i~0)) [2020-11-07 06:39:22,747 INFO L269 CegarLoopResult]: At program point L27-7(lines 27 32) the Hoare annotation is: true [2020-11-07 06:39:22,748 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 24 34) the Hoare annotation is: true [2020-11-07 06:39:22,748 INFO L262 CegarLoopResult]: At program point L30(lines 28 31) the Hoare annotation is: (let ((.cse0 (<= (+ main_~i~0 1) main_~nlen~0)) (.cse1 (<= main_~j~0 7))) (or (and .cse0 .cse1 (<= 1 main_~i~0)) (and .cse0 .cse1 (= main_~i~0 0)))) [2020-11-07 06:39:22,748 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 24 34) the Hoare annotation is: true [2020-11-07 06:39:22,749 INFO L262 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= (+ main_~i~0 1) main_~nlen~0))) (or (and .cse0 (<= 1 main_~i~0)) (and .cse0 (= main_~i~0 0)))) [2020-11-07 06:39:22,749 INFO L269 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-11-07 06:39:22,749 INFO L269 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-11-07 06:39:22,749 INFO L262 CegarLoopResult]: At program point L28-3(line 28) the Hoare annotation is: (let ((.cse0 (<= (+ main_~i~0 1) main_~nlen~0)) (.cse1 (<= main_~j~0 7))) (or (and .cse0 .cse1 (<= 1 main_~i~0)) (and .cse0 .cse1 (= main_~i~0 0)))) [2020-11-07 06:39:22,749 INFO L262 CegarLoopResult]: At program point L28-4(line 28) the Hoare annotation is: (let ((.cse0 (<= (+ main_~i~0 1) main_~nlen~0))) (or (and .cse0 (<= 1 main_~i~0)) (and .cse0 (= main_~i~0 0)))) [2020-11-07 06:39:22,749 INFO L262 CegarLoopResult]: At program point L28-5(lines 28 31) the Hoare annotation is: (let ((.cse0 (<= (+ main_~i~0 1) main_~nlen~0))) (or (and .cse0 (<= 1 main_~i~0)) (and .cse0 (= main_~i~0 0)))) [2020-11-07 06:39:22,749 INFO L262 CegarLoopResult]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:39:22,749 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2020-11-07 06:39:22,750 INFO L262 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:39:22,750 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:39:22,750 INFO L262 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:39:22,750 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:39:22,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:39:22 BoogieIcfgContainer [2020-11-07 06:39:22,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:39:22,783 INFO L168 Benchmark]: Toolchain (without parser) took 16781.03 ms. Allocated memory was 151.0 MB in the beginning and 332.4 MB in the end (delta: 181.4 MB). Free memory was 128.0 MB in the beginning and 218.9 MB in the end (delta: -90.8 MB). Peak memory consumption was 196.6 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:22,787 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory is still 125.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:39:22,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.50 ms. Allocated memory is still 151.0 MB. Free memory was 127.3 MB in the beginning and 117.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:22,789 INFO L168 Benchmark]: Boogie Preprocessor took 71.10 ms. Allocated memory is still 151.0 MB. Free memory was 117.9 MB in the beginning and 116.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:22,792 INFO L168 Benchmark]: RCFGBuilder took 456.36 ms. Allocated memory is still 151.0 MB. Free memory was 116.3 MB in the beginning and 101.3 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:22,796 INFO L168 Benchmark]: TraceAbstraction took 15926.09 ms. Allocated memory was 151.0 MB in the beginning and 332.4 MB in the end (delta: 181.4 MB). Free memory was 100.8 MB in the beginning and 218.9 MB in the end (delta: -118.1 MB). Peak memory consumption was 169.4 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:22,803 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.22 ms. Allocated memory is still 151.0 MB. Free memory is still 125.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 313.50 ms. Allocated memory is still 151.0 MB. Free memory was 127.3 MB in the beginning and 117.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 71.10 ms. Allocated memory is still 151.0 MB. Free memory was 117.9 MB in the beginning and 116.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 456.36 ms. Allocated memory is still 151.0 MB. Free memory was 116.3 MB in the beginning and 101.3 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15926.09 ms. Allocated memory was 151.0 MB in the beginning and 332.4 MB in the end (delta: 181.4 MB). Free memory was 100.8 MB in the beginning and 218.9 MB in the end (delta: -118.1 MB). Peak memory consumption was 169.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: 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: 28]: Loop Invariant Derived loop invariant: (i + 1 <= nlen && 1 <= i) || (i + 1 <= nlen && i == 0) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: i == 0 || 1 <= i - ProcedureContractResult [Line: 12]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.0s, OverallIterations: 12, TraceHistogramMax: 34, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 452 SDtfs, 572 SDslu, 729 SDs, 0 SdLazy, 1955 SolverSat, 387 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 80 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 47 LocationsWithAnnotation, 1079 PreInvPairs, 1341 NumberOfFragments, 308 HoareAnnotationTreeSize, 1079 FomulaSimplifications, 262700 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 47 FomulaSimplificationsInter, 18952 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1515 NumberOfCodeBlocks, 1515 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1503 ConstructedInterpolants, 0 QuantifiedInterpolants, 436003 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 9024/9829 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...