/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/recursive-simple/id2_b2_o3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:53:59,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:53:59,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:53:59,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:53:59,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:53:59,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:53:59,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:53:59,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:53:59,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:53:59,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:53:59,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:53:59,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:53:59,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:53:59,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:53:59,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:53:59,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:53:59,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:53:59,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:53:59,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:53:59,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:53:59,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:53:59,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:53:59,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:53:59,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:53:59,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:53:59,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:53:59,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:53:59,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:53:59,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:53:59,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:53:59,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:53:59,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:53:59,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:53:59,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:53:59,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:53:59,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:53:59,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:53:59,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:53:59,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:53:59,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:53:59,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:53:59,959 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:53:59,982 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:53:59,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:53:59,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:53:59,988 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:53:59,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:53:59,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:53:59,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:53:59,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:53:59,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:53:59,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:53:59,992 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:53:59,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:53:59,993 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:53:59,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:53:59,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:53:59,993 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:53:59,993 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:53:59,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:53:59,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:53:59,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:53:59,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:53:59,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:53:59,995 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-10-24 00:54:00,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:54:00,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:54:00,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:54:00,411 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:54:00,412 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:54:00,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_b2_o3.c [2020-10-24 00:54:00,493 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be8f8a60/3d16601414c7468b8c71c67274fc1835/FLAG798ec8578 [2020-10-24 00:54:01,046 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:54:01,047 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_b2_o3.c [2020-10-24 00:54:01,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be8f8a60/3d16601414c7468b8c71c67274fc1835/FLAG798ec8578 [2020-10-24 00:54:01,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be8f8a60/3d16601414c7468b8c71c67274fc1835 [2020-10-24 00:54:01,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:54:01,463 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:54:01,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:54:01,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:54:01,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:54:01,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:54:01" (1/1) ... [2020-10-24 00:54:01,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7acba01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:01, skipping insertion in model container [2020-10-24 00:54:01,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:54:01" (1/1) ... [2020-10-24 00:54:01,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:54:01,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:54:01,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:54:01,726 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:54:01,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:54:01,762 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:54:01,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:01 WrapperNode [2020-10-24 00:54:01,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:54:01,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:54:01,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:54:01,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:54:01,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:01" (1/1) ... [2020-10-24 00:54:01,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:01" (1/1) ... [2020-10-24 00:54:01,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:01" (1/1) ... [2020-10-24 00:54:01,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:01" (1/1) ... [2020-10-24 00:54:01,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:01" (1/1) ... [2020-10-24 00:54:01,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:01" (1/1) ... [2020-10-24 00:54:01,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:01" (1/1) ... [2020-10-24 00:54:01,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:54:01,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:54:01,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:54:01,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:54:01,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:01" (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-10-24 00:54:01,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:54:01,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:54:01,874 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:54:01,874 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-10-24 00:54:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-10-24 00:54:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:54:01,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-10-24 00:54:01,876 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:54:01,876 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:54:01,876 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:54:01,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:54:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-10-24 00:54:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-10-24 00:54:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:54:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:54:01,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:54:01,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:54:01,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:54:01,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:54:01,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:54:02,196 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:54:02,197 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:54:02,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:54:02 BoogieIcfgContainer [2020-10-24 00:54:02,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:54:02,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:54:02,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:54:02,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:54:02,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:54:01" (1/3) ... [2020-10-24 00:54:02,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48824eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:54:02, skipping insertion in model container [2020-10-24 00:54:02,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:01" (2/3) ... [2020-10-24 00:54:02,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48824eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:54:02, skipping insertion in model container [2020-10-24 00:54:02,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:54:02" (3/3) ... [2020-10-24 00:54:02,213 INFO L111 eAbstractionObserver]: Analyzing ICFG id2_b2_o3.c [2020-10-24 00:54:02,232 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:54:02,240 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:54:02,273 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:54:02,331 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:54:02,331 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:54:02,331 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:54:02,332 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:54:02,332 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:54:02,332 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:54:02,332 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:54:02,332 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:54:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-10-24 00:54:02,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:54:02,363 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:02,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:02,364 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:02,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:02,371 INFO L82 PathProgramCache]: Analyzing trace with hash 138014369, now seen corresponding path program 1 times [2020-10-24 00:54:02,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:02,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [355890176] [2020-10-24 00:54:02,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:54:02,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [355890176] [2020-10-24 00:54:02,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:54:02,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:54:02,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658108385] [2020-10-24 00:54:02,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:54:02,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:02,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:54:02,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:54:02,882 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 6 states. [2020-10-24 00:54:03,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:03,298 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2020-10-24 00:54:03,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:54:03,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:54:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:03,312 INFO L225 Difference]: With dead ends: 64 [2020-10-24 00:54:03,313 INFO L226 Difference]: Without dead ends: 45 [2020-10-24 00:54:03,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-10-24 00:54:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-10-24 00:54:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-10-24 00:54:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-24 00:54:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-10-24 00:54:03,379 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 25 [2020-10-24 00:54:03,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:03,380 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-10-24 00:54:03,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:54:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-10-24 00:54:03,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-10-24 00:54:03,383 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:03,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:03,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:54:03,384 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1111577060, now seen corresponding path program 1 times [2020-10-24 00:54:03,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:03,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [71491463] [2020-10-24 00:54:03,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:03,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:03,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:03,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:54:03,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [71491463] [2020-10-24 00:54:03,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:54:03,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:54:03,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469408278] [2020-10-24 00:54:03,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:54:03,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:03,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:54:03,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:54:03,628 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2020-10-24 00:54:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:04,000 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2020-10-24 00:54:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:54:04,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-10-24 00:54:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:04,003 INFO L225 Difference]: With dead ends: 73 [2020-10-24 00:54:04,003 INFO L226 Difference]: Without dead ends: 53 [2020-10-24 00:54:04,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 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-10-24 00:54:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-24 00:54:04,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2020-10-24 00:54:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-24 00:54:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-10-24 00:54:04,024 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 34 [2020-10-24 00:54:04,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:04,025 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-10-24 00:54:04,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:54:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-10-24 00:54:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-10-24 00:54:04,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:04,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:04,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:54:04,028 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:04,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:04,029 INFO L82 PathProgramCache]: Analyzing trace with hash 982288804, now seen corresponding path program 1 times [2020-10-24 00:54:04,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:04,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1121992420] [2020-10-24 00:54:04,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:04,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:04,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:04,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:54:04,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1121992420] [2020-10-24 00:54:04,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:54:04,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-24 00:54:04,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271837402] [2020-10-24 00:54:04,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:54:04,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:04,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:54:04,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:54:04,236 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2020-10-24 00:54:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:04,787 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2020-10-24 00:54:04,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:54:04,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2020-10-24 00:54:04,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:04,789 INFO L225 Difference]: With dead ends: 59 [2020-10-24 00:54:04,790 INFO L226 Difference]: Without dead ends: 53 [2020-10-24 00:54:04,791 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:54:04,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-24 00:54:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-10-24 00:54:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:54:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-10-24 00:54:04,806 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 34 [2020-10-24 00:54:04,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:04,807 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-10-24 00:54:04,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:54:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-10-24 00:54:04,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:54:04,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:04,809 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:04,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:54:04,810 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:04,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:04,810 INFO L82 PathProgramCache]: Analyzing trace with hash 935446002, now seen corresponding path program 1 times [2020-10-24 00:54:04,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:04,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2107012070] [2020-10-24 00:54:04,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:04,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:04,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:04,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:04,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:54:04,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2107012070] [2020-10-24 00:54:04,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:54:04,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:54:04,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989262240] [2020-10-24 00:54:04,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:54:04,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:04,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:54:04,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:54:04,980 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2020-10-24 00:54:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:05,341 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2020-10-24 00:54:05,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:54:05,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-10-24 00:54:05,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:05,345 INFO L225 Difference]: With dead ends: 79 [2020-10-24 00:54:05,345 INFO L226 Difference]: Without dead ends: 59 [2020-10-24 00:54:05,346 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:54:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-24 00:54:05,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2020-10-24 00:54:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-24 00:54:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-10-24 00:54:05,380 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 43 [2020-10-24 00:54:05,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:05,385 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-10-24 00:54:05,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:54:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-10-24 00:54:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:54:05,387 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:05,388 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:05,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:54:05,388 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:05,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:05,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1355534926, now seen corresponding path program 1 times [2020-10-24 00:54:05,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:05,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2139944657] [2020-10-24 00:54:05,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:05,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:05,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:05,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:05,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:54:05,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2139944657] [2020-10-24 00:54:05,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:54:05,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-24 00:54:05,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353373719] [2020-10-24 00:54:05,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:54:05,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:05,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:54:05,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:54:05,655 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2020-10-24 00:54:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:06,309 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2020-10-24 00:54:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:54:06,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2020-10-24 00:54:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:06,312 INFO L225 Difference]: With dead ends: 85 [2020-10-24 00:54:06,312 INFO L226 Difference]: Without dead ends: 65 [2020-10-24 00:54:06,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:54:06,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-24 00:54:06,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2020-10-24 00:54:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-24 00:54:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2020-10-24 00:54:06,332 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 43 [2020-10-24 00:54:06,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:06,333 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2020-10-24 00:54:06,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:54:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2020-10-24 00:54:06,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:54:06,334 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:06,334 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:06,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:54:06,335 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:06,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:06,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1484823182, now seen corresponding path program 1 times [2020-10-24 00:54:06,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:06,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [733817640] [2020-10-24 00:54:06,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:06,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:06,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:06,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:06,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:54:06,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [733817640] [2020-10-24 00:54:06,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:06,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:54:06,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294511618] [2020-10-24 00:54:06,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:54:06,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:06,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:54:06,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:54:06,643 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 12 states. [2020-10-24 00:54:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:07,726 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2020-10-24 00:54:07,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 00:54:07,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2020-10-24 00:54:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:07,729 INFO L225 Difference]: With dead ends: 73 [2020-10-24 00:54:07,729 INFO L226 Difference]: Without dead ends: 67 [2020-10-24 00:54:07,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:54:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-24 00:54:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2020-10-24 00:54:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-24 00:54:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2020-10-24 00:54:07,757 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 43 [2020-10-24 00:54:07,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:07,758 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2020-10-24 00:54:07,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:54:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-10-24 00:54:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-24 00:54:07,759 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:07,759 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:07,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:54:07,760 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:07,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:07,760 INFO L82 PathProgramCache]: Analyzing trace with hash 334598913, now seen corresponding path program 1 times [2020-10-24 00:54:07,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:07,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1030562019] [2020-10-24 00:54:07,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:07,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:07,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:07,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:07,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:07,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:08,025 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-24 00:54:08,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1030562019] [2020-10-24 00:54:08,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:54:08,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-24 00:54:08,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905820436] [2020-10-24 00:54:08,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:54:08,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:08,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:54:08,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:54:08,032 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 9 states. [2020-10-24 00:54:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:08,722 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2020-10-24 00:54:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:54:08,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2020-10-24 00:54:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:08,725 INFO L225 Difference]: With dead ends: 93 [2020-10-24 00:54:08,725 INFO L226 Difference]: Without dead ends: 71 [2020-10-24 00:54:08,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:54:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-24 00:54:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2020-10-24 00:54:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-24 00:54:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2020-10-24 00:54:08,746 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 52 [2020-10-24 00:54:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:08,747 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2020-10-24 00:54:08,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:54:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-10-24 00:54:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-24 00:54:08,748 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:08,749 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:08,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:54:08,749 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:08,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:08,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1956382015, now seen corresponding path program 1 times [2020-10-24 00:54:08,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:08,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1421679845] [2020-10-24 00:54:08,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:08,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:08,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:08,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:08,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:08,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-24 00:54:09,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1421679845] [2020-10-24 00:54:09,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:09,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:54:09,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603981112] [2020-10-24 00:54:09,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:54:09,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:09,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:54:09,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:54:09,019 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 12 states. [2020-10-24 00:54:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:10,015 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2020-10-24 00:54:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 00:54:10,017 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2020-10-24 00:54:10,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:10,019 INFO L225 Difference]: With dead ends: 101 [2020-10-24 00:54:10,019 INFO L226 Difference]: Without dead ends: 79 [2020-10-24 00:54:10,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:54:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-24 00:54:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2020-10-24 00:54:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-24 00:54:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2020-10-24 00:54:10,053 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 52 [2020-10-24 00:54:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:10,054 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2020-10-24 00:54:10,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:54:10,054 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2020-10-24 00:54:10,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 00:54:10,055 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:10,055 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:10,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:54:10,056 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:10,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:10,056 INFO L82 PathProgramCache]: Analyzing trace with hash 519376963, now seen corresponding path program 2 times [2020-10-24 00:54:10,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:10,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [284346848] [2020-10-24 00:54:10,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:10,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:10,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:10,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:10,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:10,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:10,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-24 00:54:10,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [284346848] [2020-10-24 00:54:10,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:10,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:54:10,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23130095] [2020-10-24 00:54:10,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:54:10,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:10,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:54:10,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:54:10,396 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 12 states. [2020-10-24 00:54:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:11,383 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2020-10-24 00:54:11,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 00:54:11,383 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-10-24 00:54:11,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:11,384 INFO L225 Difference]: With dead ends: 90 [2020-10-24 00:54:11,384 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:54:11,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:54:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:54:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:54:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:54:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:54:11,387 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2020-10-24 00:54:11,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:11,387 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:54:11,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:54:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:54:11,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:54:11,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:54:11,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:54:12,133 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2020-10-24 00:54:12,406 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 17 [2020-10-24 00:54:12,542 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 17 [2020-10-24 00:54:12,813 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 24 [2020-10-24 00:54:13,139 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 24 [2020-10-24 00:54:13,471 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 17 [2020-10-24 00:54:13,628 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 17 [2020-10-24 00:54:13,637 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-10-24 00:54:13,637 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-10-24 00:54:13,637 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:54:13,638 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-10-24 00:54:13,638 INFO L277 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-10-24 00:54:13,638 INFO L277 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-10-24 00:54:13,638 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:54:13,638 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:54:13,638 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:54:13,639 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:54:13,639 INFO L277 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-10-24 00:54:13,639 INFO L277 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-10-24 00:54:13,639 INFO L277 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-10-24 00:54:13,639 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:54:13,639 INFO L270 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1))) [2020-10-24 00:54:13,639 INFO L270 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= 3 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0))) [2020-10-24 00:54:13,640 INFO L270 CegarLoopResult]: At program point id2FINAL(lines 16 21) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= |id2_#res| 1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= 2 |id2_#res|) (<= |id2_#res| 2)) (and (<= |id2_#res| 0) (<= 0 |id2_#res|))) [2020-10-24 00:54:13,640 INFO L277 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-10-24 00:54:13,642 INFO L270 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (<= 3 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) [2020-10-24 00:54:13,642 INFO L277 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-10-24 00:54:13,642 INFO L270 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (or (and (<= 0 |id2_#t~ret8|) (<= |id2_#t~ret8| 0)) (and (<= 2 |id2_#t~ret8|) (<= |id2_#t~ret8| 2)) (and (<= |id2_#t~ret8| 1) (<= 1 |id2_#t~ret8|))) [2020-10-24 00:54:13,642 INFO L277 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-10-24 00:54:13,642 INFO L270 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (or (and (<= 0 |id2_#t~ret8|) (<= 1 id2_~ret~1) (<= |id2_#t~ret8| 0) (<= id2_~ret~1 1)) (and (<= 3 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0) (<= |id2_#t~ret8| 2) (<= 2 |id2_#t~ret8|)) (and (<= id2_~ret~1 2) (<= |id2_#t~ret8| 1) (<= 1 |id2_#t~ret8|) (<= 2 id2_~ret~1))) [2020-10-24 00:54:13,642 INFO L270 CegarLoopResult]: At program point id2EXIT(lines 16 21) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= |id2_#res| 1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= 2 |id2_#res|) (<= |id2_#res| 2)) (and (<= |id2_#res| 0) (<= 0 |id2_#res|))) [2020-10-24 00:54:13,643 INFO L277 CegarLoopResult]: At program point id2ENTRY(lines 16 21) the Hoare annotation is: true [2020-10-24 00:54:13,643 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:54:13,643 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:54:13,643 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:54:13,643 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:54:13,643 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 23 29) the Hoare annotation is: true [2020-10-24 00:54:13,643 INFO L270 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: false [2020-10-24 00:54:13,643 INFO L270 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: (and (<= main_~result~0 2) (< 0 (+ (div main_~result~0 4294967296) 1))) [2020-10-24 00:54:13,644 INFO L270 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: false [2020-10-24 00:54:13,644 INFO L277 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-10-24 00:54:13,644 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 23 29) the Hoare annotation is: true [2020-10-24 00:54:13,644 INFO L277 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-10-24 00:54:13,644 INFO L270 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (or (and (<= |main_#t~ret10| 2) (<= 2 |main_#t~ret10|)) (= |main_#t~ret10| 0) (and (<= |main_#t~ret10| 1) (<= 1 |main_#t~ret10|))) [2020-10-24 00:54:13,644 INFO L277 CegarLoopResult]: At program point L26-2(lines 23 29) the Hoare annotation is: true [2020-10-24 00:54:13,644 INFO L270 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div main_~result~0 4294967296) 1)))) (or (and (<= |main_#t~ret10| 1) (<= 1 |main_#t~ret10|) (<= main_~result~0 1) .cse0) (and (= main_~result~0 0) (= |main_#t~ret10| 0)) (and (<= main_~result~0 2) (<= |main_#t~ret10| 2) (<= 2 |main_#t~ret10|) .cse0))) [2020-10-24 00:54:13,645 INFO L270 CegarLoopResult]: At program point idFINAL(lines 9 14) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= 2 |id_#res|) (<= |id_#res| 2))) [2020-10-24 00:54:13,645 INFO L270 CegarLoopResult]: At program point idEXIT(lines 9 14) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= 2 |id_#res|) (<= |id_#res| 2))) [2020-10-24 00:54:13,645 INFO L277 CegarLoopResult]: At program point idENTRY(lines 9 14) the Hoare annotation is: true [2020-10-24 00:54:13,645 INFO L270 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (or (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-10-24 00:54:13,645 INFO L270 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: (or (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= 3 id_~ret~0) (<= (div id_~ret~0 4294967296) 0)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-10-24 00:54:13,645 INFO L277 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-10-24 00:54:13,645 INFO L277 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-10-24 00:54:13,645 INFO L277 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-10-24 00:54:13,646 INFO L270 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (or (and (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|)) (and (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|)) (and (<= 0 |id_#t~ret7|) (<= |id_#t~ret7| 0))) [2020-10-24 00:54:13,646 INFO L277 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: true [2020-10-24 00:54:13,646 INFO L270 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (or (and (<= 3 id_~ret~0) (<= (div id_~ret~0 4294967296) 0) (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|)) (and (<= id_~ret~0 2) (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 id_~ret~0)) (and (<= 0 |id_#t~ret7|) (<= id_~ret~0 1) (<= |id_#t~ret7| 0) (<= 1 id_~ret~0))) [2020-10-24 00:54:13,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:54:13 BoogieIcfgContainer [2020-10-24 00:54:13,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:54:13,670 INFO L168 Benchmark]: Toolchain (without parser) took 12216.60 ms. Allocated memory was 151.0 MB in the beginning and 280.0 MB in the end (delta: 129.0 MB). Free memory was 127.9 MB in the beginning and 253.0 MB in the end (delta: -125.1 MB). Peak memory consumption was 157.9 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:13,670 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 125.0 MB in the end (delta: 107.4 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:54:13,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.44 ms. Allocated memory is still 151.0 MB. Free memory was 127.3 MB in the beginning and 118.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:13,672 INFO L168 Benchmark]: Boogie Preprocessor took 33.67 ms. Allocated memory is still 151.0 MB. Free memory was 118.1 MB in the beginning and 116.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:13,673 INFO L168 Benchmark]: RCFGBuilder took 401.44 ms. Allocated memory is still 151.0 MB. Free memory was 116.6 MB in the beginning and 101.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:13,674 INFO L168 Benchmark]: TraceAbstraction took 11466.17 ms. Allocated memory was 151.0 MB in the beginning and 280.0 MB in the end (delta: 129.0 MB). Free memory was 101.7 MB in the beginning and 253.0 MB in the end (delta: -151.3 MB). Peak memory consumption was 131.7 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:13,677 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.24 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 125.0 MB in the end (delta: 107.4 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 297.44 ms. Allocated memory is still 151.0 MB. Free memory was 127.3 MB in the beginning and 118.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 33.67 ms. Allocated memory is still 151.0 MB. Free memory was 118.1 MB in the beginning and 116.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 401.44 ms. Allocated memory is still 151.0 MB. Free memory was 116.6 MB in the beginning and 101.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 11466.17 ms. Allocated memory was 151.0 MB in the beginning and 280.0 MB in the end (delta: 129.0 MB). Free memory was 101.7 MB in the beginning and 253.0 MB in the end (delta: -151.3 MB). Peak memory consumption was 131.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for id2 Derived contract for procedure id2: ((((1 <= ret && \result <= 1) && ret <= 1) && 1 <= \result) || (2 <= \result && \result <= 2)) || (\result <= 0 && 0 <= \result) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for id Derived contract for procedure id: ((((\result <= 1 && ret <= 1) && 1 <= \result) && 1 <= ret) || (0 <= \result && \result <= 0)) || (2 <= \result && \result <= 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.0s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 388 SDtfs, 359 SDslu, 889 SDs, 0 SdLazy, 2129 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 29 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 50 LocationsWithAnnotation, 93 PreInvPairs, 196 NumberOfFragments, 462 HoareAnnotationTreeSize, 93 FomulaSimplifications, 26519 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 50 FomulaSimplificationsInter, 3047 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 378 ConstructedInterpolants, 0 QuantifiedInterpolants, 57180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 52/64 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...