/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 20:31:13,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 20:31:13,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 20:31:13,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 20:31:13,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 20:31:13,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 20:31:13,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 20:31:13,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 20:31:13,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 20:31:13,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 20:31:13,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 20:31:14,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 20:31:14,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 20:31:14,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 20:31:14,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 20:31:14,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 20:31:14,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 20:31:14,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 20:31:14,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 20:31:14,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 20:31:14,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 20:31:14,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 20:31:14,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 20:31:14,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 20:31:14,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 20:31:14,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 20:31:14,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 20:31:14,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 20:31:14,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 20:31:14,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 20:31:14,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 20:31:14,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 20:31:14,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 20:31:14,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 20:31:14,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 20:31:14,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 20:31:14,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 20:31:14,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 20:31:14,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 20:31:14,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 20:31:14,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 20:31:14,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-23 20:31:14,062 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 20:31:14,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 20:31:14,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 20:31:14,065 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 20:31:14,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 20:31:14,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 20:31:14,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 20:31:14,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 20:31:14,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 20:31:14,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 20:31:14,066 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 20:31:14,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 20:31:14,067 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 20:31:14,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 20:31:14,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 20:31:14,067 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 20:31:14,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 20:31:14,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 20:31:14,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:31:14,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 20:31:14,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 20:31:14,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 20:31:14,069 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 [2020-10-23 20:31:14,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 20:31:14,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 20:31:14,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 20:31:14,522 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 20:31:14,523 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 20:31:14,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2020-10-23 20:31:14,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7125858b/5e0a89e4e87f4231b77e2f19058aa89c/FLAG975881e73 [2020-10-23 20:31:15,299 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 20:31:15,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2020-10-23 20:31:15,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7125858b/5e0a89e4e87f4231b77e2f19058aa89c/FLAG975881e73 [2020-10-23 20:31:15,671 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7125858b/5e0a89e4e87f4231b77e2f19058aa89c [2020-10-23 20:31:15,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 20:31:15,682 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 20:31:15,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 20:31:15,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 20:31:15,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 20:31:15,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:31:15" (1/1) ... [2020-10-23 20:31:15,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600e84fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:15, skipping insertion in model container [2020-10-23 20:31:15,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:31:15" (1/1) ... [2020-10-23 20:31:15,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 20:31:15,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 20:31:15,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:31:15,905 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 20:31:15,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:31:15,973 INFO L208 MainTranslator]: Completed translation [2020-10-23 20:31:15,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:15 WrapperNode [2020-10-23 20:31:15,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 20:31:15,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 20:31:15,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 20:31:15,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 20:31:15,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:15" (1/1) ... [2020-10-23 20:31:15,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:15" (1/1) ... [2020-10-23 20:31:16,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:15" (1/1) ... [2020-10-23 20:31:16,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:15" (1/1) ... [2020-10-23 20:31:16,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:15" (1/1) ... [2020-10-23 20:31:16,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:15" (1/1) ... [2020-10-23 20:31:16,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:15" (1/1) ... [2020-10-23 20:31:16,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 20:31:16,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 20:31:16,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 20:31:16,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 20:31:16,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:15" (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-23 20:31:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 20:31:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 20:31:16,100 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 20:31:16,101 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 20:31:16,101 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 20:31:16,101 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 20:31:16,101 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 20:31:16,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 20:31:16,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 20:31:16,102 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 20:31:16,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 20:31:16,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 20:31:16,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 20:31:16,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 20:31:16,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 20:31:16,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 20:31:16,591 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 20:31:16,591 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-23 20:31:16,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:31:16 BoogieIcfgContainer [2020-10-23 20:31:16,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 20:31:16,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 20:31:16,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 20:31:16,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 20:31:16,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:31:15" (1/3) ... [2020-10-23 20:31:16,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9674c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:31:16, skipping insertion in model container [2020-10-23 20:31:16,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:15" (2/3) ... [2020-10-23 20:31:16,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9674c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:31:16, skipping insertion in model container [2020-10-23 20:31:16,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:31:16" (3/3) ... [2020-10-23 20:31:16,604 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2020-10-23 20:31:16,620 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 20:31:16,626 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 20:31:16,642 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 20:31:16,680 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 20:31:16,681 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 20:31:16,682 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 20:31:16,684 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 20:31:16,684 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 20:31:16,684 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 20:31:16,684 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 20:31:16,684 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 20:31:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2020-10-23 20:31:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-23 20:31:16,729 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:16,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:16,731 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:16,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:16,746 INFO L82 PathProgramCache]: Analyzing trace with hash -598530795, now seen corresponding path program 1 times [2020-10-23 20:31:16,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:16,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1450432722] [2020-10-23 20:31:16,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:16,861 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:17,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:17,202 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-23 20:31:17,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1450432722] [2020-10-23 20:31:17,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:17,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:17,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053115783] [2020-10-23 20:31:17,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:17,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:17,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:17,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:17,230 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2020-10-23 20:31:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:17,633 INFO L93 Difference]: Finished difference Result 159 states and 212 transitions. [2020-10-23 20:31:17,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:17,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-10-23 20:31:17,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:17,648 INFO L225 Difference]: With dead ends: 159 [2020-10-23 20:31:17,649 INFO L226 Difference]: Without dead ends: 104 [2020-10-23 20:31:17,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-23 20:31:17,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-23 20:31:17,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2020-10-23 20:31:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-23 20:31:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2020-10-23 20:31:17,736 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 52 [2020-10-23 20:31:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:17,737 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2020-10-23 20:31:17,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2020-10-23 20:31:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-23 20:31:17,739 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:17,739 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:17,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 20:31:17,740 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:17,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:17,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1160567619, now seen corresponding path program 1 times [2020-10-23 20:31:17,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:17,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1900737249] [2020-10-23 20:31:17,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:17,745 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:17,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:17,843 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-23 20:31:17,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1900737249] [2020-10-23 20:31:17,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:17,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:17,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717759420] [2020-10-23 20:31:17,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:17,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:17,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:17,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:17,847 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. Second operand 4 states. [2020-10-23 20:31:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:18,068 INFO L93 Difference]: Finished difference Result 125 states and 158 transitions. [2020-10-23 20:31:18,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:18,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-10-23 20:31:18,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:18,071 INFO L225 Difference]: With dead ends: 125 [2020-10-23 20:31:18,071 INFO L226 Difference]: Without dead ends: 122 [2020-10-23 20:31:18,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-23 20:31:18,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-23 20:31:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2020-10-23 20:31:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-23 20:31:18,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2020-10-23 20:31:18,099 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 53 [2020-10-23 20:31:18,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:18,100 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2020-10-23 20:31:18,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2020-10-23 20:31:18,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-23 20:31:18,102 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:18,102 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:18,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 20:31:18,103 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:18,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:18,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1366976914, now seen corresponding path program 1 times [2020-10-23 20:31:18,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:18,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1942220789] [2020-10-23 20:31:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:18,107 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:18,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:18,193 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-23 20:31:18,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1942220789] [2020-10-23 20:31:18,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:18,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:18,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004571812] [2020-10-23 20:31:18,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:18,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:18,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:18,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:18,197 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand 4 states. [2020-10-23 20:31:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:18,437 INFO L93 Difference]: Finished difference Result 235 states and 309 transitions. [2020-10-23 20:31:18,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:18,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-10-23 20:31:18,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:18,441 INFO L225 Difference]: With dead ends: 235 [2020-10-23 20:31:18,441 INFO L226 Difference]: Without dead ends: 165 [2020-10-23 20:31:18,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-23 20:31:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-10-23 20:31:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2020-10-23 20:31:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-10-23 20:31:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 209 transitions. [2020-10-23 20:31:18,486 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 209 transitions. Word has length 53 [2020-10-23 20:31:18,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:18,486 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 209 transitions. [2020-10-23 20:31:18,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2020-10-23 20:31:18,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-23 20:31:18,489 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:18,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:18,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 20:31:18,489 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:18,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:18,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1329559813, now seen corresponding path program 1 times [2020-10-23 20:31:18,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:18,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1118255615] [2020-10-23 20:31:18,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:18,493 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:18,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:18,569 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-23 20:31:18,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1118255615] [2020-10-23 20:31:18,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:18,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:18,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424867866] [2020-10-23 20:31:18,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:18,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:18,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:18,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:18,572 INFO L87 Difference]: Start difference. First operand 164 states and 209 transitions. Second operand 4 states. [2020-10-23 20:31:18,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:18,777 INFO L93 Difference]: Finished difference Result 200 states and 256 transitions. [2020-10-23 20:31:18,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:18,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-10-23 20:31:18,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:18,780 INFO L225 Difference]: With dead ends: 200 [2020-10-23 20:31:18,780 INFO L226 Difference]: Without dead ends: 197 [2020-10-23 20:31:18,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-23 20:31:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-10-23 20:31:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 164. [2020-10-23 20:31:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-10-23 20:31:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 207 transitions. [2020-10-23 20:31:18,825 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 207 transitions. Word has length 54 [2020-10-23 20:31:18,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:18,826 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 207 transitions. [2020-10-23 20:31:18,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 207 transitions. [2020-10-23 20:31:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-23 20:31:18,827 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:18,827 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:18,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 20:31:18,828 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:18,829 INFO L82 PathProgramCache]: Analyzing trace with hash 581008705, now seen corresponding path program 1 times [2020-10-23 20:31:18,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:18,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [742375552] [2020-10-23 20:31:18,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:18,831 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:18,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:18,904 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-23 20:31:18,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [742375552] [2020-10-23 20:31:18,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:18,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:18,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104409266] [2020-10-23 20:31:18,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:18,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:18,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:18,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:18,907 INFO L87 Difference]: Start difference. First operand 164 states and 207 transitions. Second operand 4 states. [2020-10-23 20:31:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:19,152 INFO L93 Difference]: Finished difference Result 412 states and 538 transitions. [2020-10-23 20:31:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:19,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-10-23 20:31:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:19,154 INFO L225 Difference]: With dead ends: 412 [2020-10-23 20:31:19,155 INFO L226 Difference]: Without dead ends: 281 [2020-10-23 20:31:19,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-23 20:31:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-10-23 20:31:19,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2020-10-23 20:31:19,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-10-23 20:31:19,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 355 transitions. [2020-10-23 20:31:19,213 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 355 transitions. Word has length 54 [2020-10-23 20:31:19,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:19,214 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 355 transitions. [2020-10-23 20:31:19,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 355 transitions. [2020-10-23 20:31:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-10-23 20:31:19,216 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:19,216 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:19,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 20:31:19,216 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:19,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:19,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1214087345, now seen corresponding path program 1 times [2020-10-23 20:31:19,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:19,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1630374919] [2020-10-23 20:31:19,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:19,220 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:19,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:19,294 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-23 20:31:19,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1630374919] [2020-10-23 20:31:19,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:19,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:19,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051057545] [2020-10-23 20:31:19,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:19,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:19,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:19,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:19,297 INFO L87 Difference]: Start difference. First operand 280 states and 355 transitions. Second operand 4 states. [2020-10-23 20:31:19,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:19,540 INFO L93 Difference]: Finished difference Result 340 states and 430 transitions. [2020-10-23 20:31:19,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:19,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-10-23 20:31:19,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:19,543 INFO L225 Difference]: With dead ends: 340 [2020-10-23 20:31:19,543 INFO L226 Difference]: Without dead ends: 337 [2020-10-23 20:31:19,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-23 20:31:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-10-23 20:31:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 280. [2020-10-23 20:31:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-10-23 20:31:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 351 transitions. [2020-10-23 20:31:19,604 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 351 transitions. Word has length 55 [2020-10-23 20:31:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:19,604 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 351 transitions. [2020-10-23 20:31:19,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 351 transitions. [2020-10-23 20:31:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-10-23 20:31:19,606 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:19,606 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:19,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 20:31:19,606 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:19,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:19,607 INFO L82 PathProgramCache]: Analyzing trace with hash 839032282, now seen corresponding path program 1 times [2020-10-23 20:31:19,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:19,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [600826624] [2020-10-23 20:31:19,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:19,612 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:19,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:19,722 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-23 20:31:19,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [600826624] [2020-10-23 20:31:19,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:19,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:19,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153839006] [2020-10-23 20:31:19,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:19,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:19,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:19,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:19,726 INFO L87 Difference]: Start difference. First operand 280 states and 351 transitions. Second operand 4 states. [2020-10-23 20:31:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:19,979 INFO L93 Difference]: Finished difference Result 748 states and 954 transitions. [2020-10-23 20:31:19,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:19,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-10-23 20:31:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:19,983 INFO L225 Difference]: With dead ends: 748 [2020-10-23 20:31:19,983 INFO L226 Difference]: Without dead ends: 501 [2020-10-23 20:31:19,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-23 20:31:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2020-10-23 20:31:20,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 500. [2020-10-23 20:31:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-10-23 20:31:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 619 transitions. [2020-10-23 20:31:20,091 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 619 transitions. Word has length 55 [2020-10-23 20:31:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:20,092 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 619 transitions. [2020-10-23 20:31:20,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 619 transitions. [2020-10-23 20:31:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-10-23 20:31:20,093 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:20,094 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:20,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 20:31:20,094 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:20,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:20,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1929396601, now seen corresponding path program 1 times [2020-10-23 20:31:20,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:20,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1965306436] [2020-10-23 20:31:20,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:20,097 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:20,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:20,159 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-23 20:31:20,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1965306436] [2020-10-23 20:31:20,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:20,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:20,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222461315] [2020-10-23 20:31:20,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:20,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:20,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:20,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:20,162 INFO L87 Difference]: Start difference. First operand 500 states and 619 transitions. Second operand 4 states. [2020-10-23 20:31:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:20,408 INFO L93 Difference]: Finished difference Result 600 states and 734 transitions. [2020-10-23 20:31:20,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:20,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-10-23 20:31:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:20,412 INFO L225 Difference]: With dead ends: 600 [2020-10-23 20:31:20,413 INFO L226 Difference]: Without dead ends: 597 [2020-10-23 20:31:20,413 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-23 20:31:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-10-23 20:31:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 500. [2020-10-23 20:31:20,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-10-23 20:31:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 611 transitions. [2020-10-23 20:31:20,528 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 611 transitions. Word has length 56 [2020-10-23 20:31:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:20,528 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 611 transitions. [2020-10-23 20:31:20,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:20,529 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 611 transitions. [2020-10-23 20:31:20,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-10-23 20:31:20,530 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:20,530 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:20,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 20:31:20,531 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:20,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:20,531 INFO L82 PathProgramCache]: Analyzing trace with hash 247840109, now seen corresponding path program 1 times [2020-10-23 20:31:20,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:20,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1086621101] [2020-10-23 20:31:20,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:20,534 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:20,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:20,593 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-23 20:31:20,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1086621101] [2020-10-23 20:31:20,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:20,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:20,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046706907] [2020-10-23 20:31:20,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:20,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:20,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:20,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:20,596 INFO L87 Difference]: Start difference. First operand 500 states and 611 transitions. Second operand 4 states. [2020-10-23 20:31:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:20,937 INFO L93 Difference]: Finished difference Result 1383 states and 1701 transitions. [2020-10-23 20:31:20,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:20,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-10-23 20:31:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:20,941 INFO L225 Difference]: With dead ends: 1383 [2020-10-23 20:31:20,942 INFO L226 Difference]: Without dead ends: 500 [2020-10-23 20:31:20,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-23 20:31:20,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-10-23 20:31:21,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2020-10-23 20:31:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-10-23 20:31:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 579 transitions. [2020-10-23 20:31:21,020 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 579 transitions. Word has length 56 [2020-10-23 20:31:21,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:21,021 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 579 transitions. [2020-10-23 20:31:21,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 579 transitions. [2020-10-23 20:31:21,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-23 20:31:21,022 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:21,022 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:21,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 20:31:21,023 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:21,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1665831771, now seen corresponding path program 1 times [2020-10-23 20:31:21,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:21,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [209490472] [2020-10-23 20:31:21,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:21,026 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:21,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:21,086 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-23 20:31:21,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [209490472] [2020-10-23 20:31:21,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:21,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:21,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702522821] [2020-10-23 20:31:21,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:21,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:21,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:21,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:21,089 INFO L87 Difference]: Start difference. First operand 500 states and 579 transitions. Second operand 4 states. [2020-10-23 20:31:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:21,272 INFO L93 Difference]: Finished difference Result 500 states and 579 transitions. [2020-10-23 20:31:21,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:21,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2020-10-23 20:31:21,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:21,274 INFO L225 Difference]: With dead ends: 500 [2020-10-23 20:31:21,274 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 20:31:21,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:21,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 20:31:21,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 20:31:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 20:31:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 20:31:21,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2020-10-23 20:31:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:21,277 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 20:31:21,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 20:31:21,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 20:31:21,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 20:31:21,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 20:31:21,506 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 34 [2020-10-23 20:31:21,682 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 39 [2020-10-23 20:31:22,096 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-23 20:31:22,374 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 31 [2020-10-23 20:31:23,393 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-10-23 20:31:23,733 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-23 20:31:24,206 WARN L193 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-23 20:31:24,764 WARN L193 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-10-23 20:31:24,872 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-10-23 20:31:26,003 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-23 20:31:26,206 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-23 20:31:26,415 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-10-23 20:31:26,623 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-23 20:31:27,193 WARN L193 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-10-23 20:31:27,701 WARN L193 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-23 20:31:27,922 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-10-23 20:31:28,380 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-10-23 20:31:28,878 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-23 20:31:28,882 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-23 20:31:28,883 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-23 20:31:28,883 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:31:28,883 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-23 20:31:28,883 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-23 20:31:28,884 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-23 20:31:28,884 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:31:28,884 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-23 20:31:28,884 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-23 20:31:28,884 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:31:28,885 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-23 20:31:28,885 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-23 20:31:28,885 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-23 20:31:28,885 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:31:28,885 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:31:28,885 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:31:28,885 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 20:31:28,886 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-23 20:31:28,886 INFO L270 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: false [2020-10-23 20:31:28,886 INFO L270 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-10-23 20:31:28,886 INFO L277 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-10-23 20:31:28,886 INFO L277 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-10-23 20:31:28,886 INFO L277 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: true [2020-10-23 20:31:28,887 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 6 95) the Hoare annotation is: true [2020-10-23 20:31:28,887 INFO L270 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-10-23 20:31:28,887 INFO L277 CegarLoopResult]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2020-10-23 20:31:28,887 INFO L270 CegarLoopResult]: At program point L77(line 77) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse1 .cse4 .cse3) (and .cse0 .cse1 .cse4))) [2020-10-23 20:31:28,887 INFO L277 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-10-23 20:31:28,887 INFO L277 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-10-23 20:31:28,888 INFO L277 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-10-23 20:31:28,888 INFO L277 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: true [2020-10-23 20:31:28,888 INFO L270 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: false [2020-10-23 20:31:28,888 INFO L277 CegarLoopResult]: At program point L28(lines 28 30) the Hoare annotation is: true [2020-10-23 20:31:28,888 INFO L270 CegarLoopResult]: At program point L86(line 86) the Hoare annotation is: (= main_~lk5~0 1) [2020-10-23 20:31:28,888 INFO L270 CegarLoopResult]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2020-10-23 20:31:28,888 INFO L277 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-10-23 20:31:28,889 INFO L277 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-10-23 20:31:28,889 INFO L277 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-10-23 20:31:28,889 INFO L277 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-10-23 20:31:28,889 INFO L277 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-10-23 20:31:28,889 INFO L270 CegarLoopResult]: At program point L70-1(lines 26 90) the Hoare annotation is: (let ((.cse1 (= main_~p3~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse1 .cse5 .cse4) (and .cse1 .cse2 .cse5) (and .cse0 .cse1 .cse4) (and .cse3 .cse5 .cse4) (and .cse3 .cse2 .cse5) (and .cse0 .cse3 .cse2))) [2020-10-23 20:31:28,889 INFO L270 CegarLoopResult]: At program point L87(line 87) the Hoare annotation is: (= main_~lk5~0 1) [2020-10-23 20:31:28,889 INFO L277 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-10-23 20:31:28,890 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 6 95) the Hoare annotation is: true [2020-10-23 20:31:28,890 INFO L270 CegarLoopResult]: At program point L71(line 71) the Hoare annotation is: (let ((.cse6 (= main_~p5~0 0)) (.cse5 (= main_~lk3~0 1)) (.cse2 (= main_~p4~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse0 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse4 .cse0 .cse6 .cse1) (and .cse4 .cse5 .cse6 .cse1) (and .cse5 .cse6 .cse1 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse3))) [2020-10-23 20:31:28,890 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2020-10-23 20:31:28,890 INFO L270 CegarLoopResult]: At program point L55-1(lines 26 90) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-10-23 20:31:28,890 INFO L270 CegarLoopResult]: At program point L80-1(lines 26 90) the Hoare annotation is: (or (= main_~p5~0 0) (= main_~lk5~0 1)) [2020-10-23 20:31:28,891 INFO L277 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-10-23 20:31:28,891 INFO L270 CegarLoopResult]: At program point L47-1(lines 26 90) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-10-23 20:31:28,891 INFO L277 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-10-23 20:31:28,891 INFO L277 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-10-23 20:31:28,891 INFO L270 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse6 (= main_~p5~0 0)) (.cse5 (= main_~lk3~0 1)) (.cse2 (= main_~p4~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse0 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse4 .cse0 .cse6 .cse1) (and .cse4 .cse5 .cse6 .cse1) (and .cse5 .cse6 .cse1 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse3))) [2020-10-23 20:31:28,891 INFO L277 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-10-23 20:31:28,891 INFO L277 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-10-23 20:31:28,892 INFO L270 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-10-23 20:31:28,892 INFO L270 CegarLoopResult]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1))) (or (and .cse0 (= main_~lk5~0 1)) (and .cse0 (= main_~p5~0 0)))) [2020-10-23 20:31:28,892 INFO L270 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-10-23 20:31:28,892 INFO L277 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-10-23 20:31:28,892 INFO L270 CegarLoopResult]: At program point L65-1(lines 26 90) the Hoare annotation is: (let ((.cse6 (= main_~lk3~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk2~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse1 (= main_~p3~0 0)) (.cse7 (= main_~p5~0 0)) (.cse5 (= main_~p4~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse2) (and .cse0 .cse6 .cse7 .cse4) (and .cse6 .cse4 .cse5 .cse2) (and .cse0 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse7 .cse3) (and .cse6 .cse7 .cse5 .cse3) (and .cse0 .cse6 .cse4 .cse2) (and .cse1 .cse7 .cse4 .cse5) (and .cse6 .cse5 .cse2 .cse3) (and .cse0 .cse6 .cse7 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse0 .cse1 .cse7 .cse4) (and .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse4 .cse2) (and .cse1 .cse7 .cse5 .cse3))) [2020-10-23 20:31:28,893 INFO L277 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-10-23 20:31:28,893 INFO L270 CegarLoopResult]: At program point L82(line 82) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1))) (or (and .cse0 (= main_~lk5~0 1)) (and .cse0 (= main_~p5~0 0)))) [2020-10-23 20:31:28,893 INFO L277 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-10-23 20:31:28,893 INFO L277 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-10-23 20:31:28,893 INFO L270 CegarLoopResult]: At program point L66(line 66) the Hoare annotation is: (let ((.cse7 (= main_~p5~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse6 (= main_~p2~0 0)) (.cse5 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse7 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse7 .cse6 .cse4) (and .cse5 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse7 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse7 .cse1 .cse4) (and .cse8 .cse5 .cse7 .cse6 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse8 .cse5 .cse3 .cse6 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4))) [2020-10-23 20:31:28,894 INFO L277 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-10-23 20:31:28,894 INFO L277 CegarLoopResult]: At program point L91(lines 7 95) the Hoare annotation is: true [2020-10-23 20:31:28,894 INFO L277 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-10-23 20:31:28,894 INFO L277 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-10-23 20:31:28,894 INFO L277 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-10-23 20:31:28,894 INFO L270 CegarLoopResult]: At program point L75-1(lines 26 90) the Hoare annotation is: (let ((.cse1 (= main_~lk5~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~p5~0 0)) (.cse0 (= main_~p4~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse3 .cse0))) [2020-10-23 20:31:28,894 INFO L277 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-10-23 20:31:28,895 INFO L270 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse7 (= main_~p5~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse6 (= main_~p2~0 0)) (.cse5 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse7 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse7 .cse6 .cse4) (and .cse5 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse7 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse7 .cse1 .cse4) (and .cse8 .cse5 .cse7 .cse6 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse8 .cse5 .cse3 .cse6 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4))) [2020-10-23 20:31:28,895 INFO L270 CegarLoopResult]: At program point L59-1(lines 26 90) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-10-23 20:31:28,895 INFO L277 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-10-23 20:31:28,896 INFO L270 CegarLoopResult]: At program point L51-1(lines 26 90) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-10-23 20:31:28,896 INFO L270 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse1 .cse4 .cse3) (and .cse0 .cse1 .cse4))) [2020-10-23 20:31:28,896 INFO L277 CegarLoopResult]: At program point L43(lines 43 45) the Hoare annotation is: true [2020-10-23 20:31:28,896 INFO L270 CegarLoopResult]: At program point L43-2(lines 26 90) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-10-23 20:31:28,896 INFO L277 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-10-23 20:31:28,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:31:28 BoogieIcfgContainer [2020-10-23 20:31:28,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 20:31:28,917 INFO L168 Benchmark]: Toolchain (without parser) took 13239.56 ms. Allocated memory was 151.0 MB in the beginning and 317.7 MB in the end (delta: 166.7 MB). Free memory was 127.0 MB in the beginning and 175.0 MB in the end (delta: -47.9 MB). Peak memory consumption was 188.9 MB. Max. memory is 8.0 GB. [2020-10-23 20:31:28,917 INFO L168 Benchmark]: CDTParser took 1.05 ms. Allocated memory is still 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 20:31:28,921 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.86 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 117.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:31:28,922 INFO L168 Benchmark]: Boogie Preprocessor took 44.69 ms. Allocated memory is still 151.0 MB. Free memory was 117.0 MB in the beginning and 115.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 20:31:28,922 INFO L168 Benchmark]: RCFGBuilder took 572.95 ms. Allocated memory is still 151.0 MB. Free memory was 115.4 MB in the beginning and 133.0 MB in the end (delta: -17.6 MB). Peak memory consumption was 21.5 MB. Max. memory is 8.0 GB. [2020-10-23 20:31:28,926 INFO L168 Benchmark]: TraceAbstraction took 12319.60 ms. Allocated memory was 151.0 MB in the beginning and 317.7 MB in the end (delta: 166.7 MB). Free memory was 132.7 MB in the beginning and 175.0 MB in the end (delta: -42.3 MB). Peak memory consumption was 194.7 MB. Max. memory is 8.0 GB. [2020-10-23 20:31:28,930 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05 ms. Allocated memory is still 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 288.86 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 117.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 44.69 ms. Allocated memory is still 151.0 MB. Free memory was 117.0 MB in the beginning and 115.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 572.95 ms. Allocated memory is still 151.0 MB. Free memory was 115.4 MB in the beginning and 133.0 MB in the end (delta: -17.6 MB). Peak memory consumption was 21.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 12319.60 ms. Allocated memory was 151.0 MB in the beginning and 317.7 MB in the end (delta: 166.7 MB). Free memory was 132.7 MB in the beginning and 175.0 MB in the end (delta: -42.3 MB). Peak memory consumption was 194.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.6s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1046 SDtfs, 1143 SDslu, 171 SDs, 0 SdLazy, 745 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=500occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 210 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 80 LocationsWithAnnotation, 116 PreInvPairs, 1004 NumberOfFragments, 2420 HoareAnnotationTreeSize, 116 FomulaSimplifications, 129125 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 80 FomulaSimplificationsInter, 6608 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...