/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-7d8eed3 [2020-11-07 00:46:36,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:46:36,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:46:36,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:46:36,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:46:36,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:46:36,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:46:36,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:46:36,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:46:36,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:46:36,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:46:36,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:46:36,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:46:36,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:46:36,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:46:36,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:46:36,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:46:36,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:46:36,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:46:36,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:46:36,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:46:36,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:46:36,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:46:36,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:46:36,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:46:36,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:46:36,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:46:36,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:46:36,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:46:36,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:46:36,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:46:36,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:46:36,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:46:36,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:46:36,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:46:36,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:46:36,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:46:36,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:46:36,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:46:36,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:46:36,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:46:36,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:46:36,885 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:46:36,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:46:36,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:46:36,890 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:46:36,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:46:36,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:46:36,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:46:36,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:46:36,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:46:36,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:46:36,893 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:46:36,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:46:36,893 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:46:36,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:46:36,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:46:36,894 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:46:36,894 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:46:36,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:46:36,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:46:36,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:46:36,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:46:36,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:46:36,896 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-11-07 00:46:37,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:46:37,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:46:37,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:46:37,384 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:46:37,385 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:46:37,386 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-11-07 00:46:37,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef32a4ac/a01d0f940bc842248cf8e9539df293bc/FLAG623caff8f [2020-11-07 00:46:38,121 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:46:38,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2020-11-07 00:46:38,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef32a4ac/a01d0f940bc842248cf8e9539df293bc/FLAG623caff8f [2020-11-07 00:46:38,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef32a4ac/a01d0f940bc842248cf8e9539df293bc [2020-11-07 00:46:38,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:46:38,480 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:46:38,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:46:38,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:46:38,489 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:46:38,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:46:38" (1/1) ... [2020-11-07 00:46:38,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@829c93b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:38, skipping insertion in model container [2020-11-07 00:46:38,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:46:38" (1/1) ... [2020-11-07 00:46:38,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:46:38,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:46:38,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:46:38,712 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:46:38,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:46:38,772 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:46:38,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:38 WrapperNode [2020-11-07 00:46:38,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:46:38,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:46:38,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:46:38,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:46:38,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:38" (1/1) ... [2020-11-07 00:46:38,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:38" (1/1) ... [2020-11-07 00:46:38,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:38" (1/1) ... [2020-11-07 00:46:38,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:38" (1/1) ... [2020-11-07 00:46:38,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:38" (1/1) ... [2020-11-07 00:46:38,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:38" (1/1) ... [2020-11-07 00:46:38,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:38" (1/1) ... [2020-11-07 00:46:38,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:46:38,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:46:38,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:46:38,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:46:38,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:46:38,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:46:38,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:46:38,950 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:46:38,950 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:46:38,950 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:46:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:46:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:46:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:46:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:46:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:46:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:46:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:46:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:46:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:46:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:46:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:46:39,621 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:46:39,622 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 00:46:39,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:46:39 BoogieIcfgContainer [2020-11-07 00:46:39,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:46:39,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:46:39,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:46:39,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:46:39,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:46:38" (1/3) ... [2020-11-07 00:46:39,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126376f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:46:39, skipping insertion in model container [2020-11-07 00:46:39,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:38" (2/3) ... [2020-11-07 00:46:39,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126376f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:46:39, skipping insertion in model container [2020-11-07 00:46:39,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:46:39" (3/3) ... [2020-11-07 00:46:39,634 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2020-11-07 00:46:39,651 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:46:39,655 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:46:39,671 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:46:39,698 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:46:39,699 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:46:39,699 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:46:39,699 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:46:39,699 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:46:39,699 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:46:39,700 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:46:39,700 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:46:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2020-11-07 00:46:39,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 00:46:39,733 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:39,734 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-11-07 00:46:39,734 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:39,741 INFO L82 PathProgramCache]: Analyzing trace with hash -598530795, now seen corresponding path program 1 times [2020-11-07 00:46:39,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:39,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [61324477] [2020-11-07 00:46:39,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:39,838 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:40,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:46:40,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [61324477] [2020-11-07 00:46:40,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:40,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:40,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62194650] [2020-11-07 00:46:40,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:40,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:40,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:40,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:40,171 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2020-11-07 00:46:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:40,621 INFO L93 Difference]: Finished difference Result 159 states and 212 transitions. [2020-11-07 00:46:40,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:40,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-11-07 00:46:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:40,642 INFO L225 Difference]: With dead ends: 159 [2020-11-07 00:46:40,643 INFO L226 Difference]: Without dead ends: 104 [2020-11-07 00:46:40,647 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-11-07 00:46:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-07 00:46:40,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2020-11-07 00:46:40,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-11-07 00:46:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2020-11-07 00:46:40,750 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 52 [2020-11-07 00:46:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:40,751 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2020-11-07 00:46:40,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2020-11-07 00:46:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-07 00:46:40,754 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:40,754 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-11-07 00:46:40,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:46:40,754 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:40,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:40,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1160567619, now seen corresponding path program 1 times [2020-11-07 00:46:40,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:40,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1913611065] [2020-11-07 00:46:40,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:40,760 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:40,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:46:40,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1913611065] [2020-11-07 00:46:40,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:40,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:40,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049051494] [2020-11-07 00:46:40,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:40,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:40,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:40,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:40,911 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. Second operand 4 states. [2020-11-07 00:46:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:41,164 INFO L93 Difference]: Finished difference Result 125 states and 158 transitions. [2020-11-07 00:46:41,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:41,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-11-07 00:46:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:41,167 INFO L225 Difference]: With dead ends: 125 [2020-11-07 00:46:41,167 INFO L226 Difference]: Without dead ends: 122 [2020-11-07 00:46:41,169 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-11-07 00:46:41,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-07 00:46:41,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2020-11-07 00:46:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-11-07 00:46:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2020-11-07 00:46:41,200 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 53 [2020-11-07 00:46:41,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:41,200 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2020-11-07 00:46:41,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:41,201 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2020-11-07 00:46:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-07 00:46:41,203 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:41,203 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-11-07 00:46:41,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:46:41,203 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:41,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:41,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1366976914, now seen corresponding path program 1 times [2020-11-07 00:46:41,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:41,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1629692276] [2020-11-07 00:46:41,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:41,208 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:41,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:46:41,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1629692276] [2020-11-07 00:46:41,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:41,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:41,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385889625] [2020-11-07 00:46:41,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:41,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:41,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:41,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:41,313 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand 4 states. [2020-11-07 00:46:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:41,658 INFO L93 Difference]: Finished difference Result 235 states and 309 transitions. [2020-11-07 00:46:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:41,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-11-07 00:46:41,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:41,666 INFO L225 Difference]: With dead ends: 235 [2020-11-07 00:46:41,666 INFO L226 Difference]: Without dead ends: 165 [2020-11-07 00:46:41,668 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-11-07 00:46:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-11-07 00:46:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2020-11-07 00:46:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-11-07 00:46:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 209 transitions. [2020-11-07 00:46:41,740 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 209 transitions. Word has length 53 [2020-11-07 00:46:41,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:41,742 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 209 transitions. [2020-11-07 00:46:41,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:41,743 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2020-11-07 00:46:41,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-07 00:46:41,753 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:41,754 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-11-07 00:46:41,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:46:41,754 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:41,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:41,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1329559813, now seen corresponding path program 1 times [2020-11-07 00:46:41,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:41,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [211172518] [2020-11-07 00:46:41,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:41,759 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:41,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:46:41,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [211172518] [2020-11-07 00:46:41,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:41,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:41,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114644169] [2020-11-07 00:46:41,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:41,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:41,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:41,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:41,857 INFO L87 Difference]: Start difference. First operand 164 states and 209 transitions. Second operand 4 states. [2020-11-07 00:46:42,134 WARN L194 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-07 00:46:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:42,249 INFO L93 Difference]: Finished difference Result 200 states and 256 transitions. [2020-11-07 00:46:42,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:42,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-11-07 00:46:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:42,254 INFO L225 Difference]: With dead ends: 200 [2020-11-07 00:46:42,254 INFO L226 Difference]: Without dead ends: 197 [2020-11-07 00:46:42,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 00:46:42,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-11-07 00:46:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 164. [2020-11-07 00:46:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-11-07 00:46:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 207 transitions. [2020-11-07 00:46:42,303 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 207 transitions. Word has length 54 [2020-11-07 00:46:42,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:42,306 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 207 transitions. [2020-11-07 00:46:42,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 207 transitions. [2020-11-07 00:46:42,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-07 00:46:42,309 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:42,310 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-11-07 00:46:42,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:46:42,310 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:42,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:42,311 INFO L82 PathProgramCache]: Analyzing trace with hash 581008705, now seen corresponding path program 1 times [2020-11-07 00:46:42,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:42,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1170757243] [2020-11-07 00:46:42,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:42,318 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:42,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:46:42,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1170757243] [2020-11-07 00:46:42,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:42,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:42,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741995085] [2020-11-07 00:46:42,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:42,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:42,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:42,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:42,410 INFO L87 Difference]: Start difference. First operand 164 states and 207 transitions. Second operand 4 states. [2020-11-07 00:46:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:42,675 INFO L93 Difference]: Finished difference Result 412 states and 538 transitions. [2020-11-07 00:46:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:42,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-11-07 00:46:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:42,679 INFO L225 Difference]: With dead ends: 412 [2020-11-07 00:46:42,679 INFO L226 Difference]: Without dead ends: 281 [2020-11-07 00:46:42,680 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-11-07 00:46:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-11-07 00:46:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2020-11-07 00:46:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-11-07 00:46:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 355 transitions. [2020-11-07 00:46:42,733 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 355 transitions. Word has length 54 [2020-11-07 00:46:42,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:42,733 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 355 transitions. [2020-11-07 00:46:42,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:42,733 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 355 transitions. [2020-11-07 00:46:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-07 00:46:42,734 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:42,734 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-11-07 00:46:42,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:46:42,735 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:42,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1214087345, now seen corresponding path program 1 times [2020-11-07 00:46:42,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:42,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2102711153] [2020-11-07 00:46:42,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:42,738 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:42,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:46:42,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2102711153] [2020-11-07 00:46:42,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:42,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:42,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988928764] [2020-11-07 00:46:42,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:42,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:42,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:42,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:42,817 INFO L87 Difference]: Start difference. First operand 280 states and 355 transitions. Second operand 4 states. [2020-11-07 00:46:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:43,058 INFO L93 Difference]: Finished difference Result 340 states and 430 transitions. [2020-11-07 00:46:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:43,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-11-07 00:46:43,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:43,061 INFO L225 Difference]: With dead ends: 340 [2020-11-07 00:46:43,061 INFO L226 Difference]: Without dead ends: 337 [2020-11-07 00:46:43,062 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-11-07 00:46:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-11-07 00:46:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 280. [2020-11-07 00:46:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-11-07 00:46:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 351 transitions. [2020-11-07 00:46:43,109 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 351 transitions. Word has length 55 [2020-11-07 00:46:43,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:43,110 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 351 transitions. [2020-11-07 00:46:43,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 351 transitions. [2020-11-07 00:46:43,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-07 00:46:43,111 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:43,111 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-11-07 00:46:43,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:46:43,112 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:43,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:43,112 INFO L82 PathProgramCache]: Analyzing trace with hash 839032282, now seen corresponding path program 1 times [2020-11-07 00:46:43,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:43,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1959616088] [2020-11-07 00:46:43,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:43,115 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:43,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:46:43,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1959616088] [2020-11-07 00:46:43,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:43,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:43,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512127965] [2020-11-07 00:46:43,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:43,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:43,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:43,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:43,198 INFO L87 Difference]: Start difference. First operand 280 states and 351 transitions. Second operand 4 states. [2020-11-07 00:46:43,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:43,469 INFO L93 Difference]: Finished difference Result 748 states and 954 transitions. [2020-11-07 00:46:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:43,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-11-07 00:46:43,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:43,474 INFO L225 Difference]: With dead ends: 748 [2020-11-07 00:46:43,474 INFO L226 Difference]: Without dead ends: 501 [2020-11-07 00:46:43,478 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-11-07 00:46:43,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2020-11-07 00:46:43,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 500. [2020-11-07 00:46:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-11-07 00:46:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 619 transitions. [2020-11-07 00:46:43,569 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 619 transitions. Word has length 55 [2020-11-07 00:46:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:43,570 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 619 transitions. [2020-11-07 00:46:43,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 619 transitions. [2020-11-07 00:46:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-07 00:46:43,571 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:43,571 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-11-07 00:46:43,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:46:43,572 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:43,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:43,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1929396601, now seen corresponding path program 1 times [2020-11-07 00:46:43,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:43,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1187963483] [2020-11-07 00:46:43,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:43,575 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:43,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:46:43,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1187963483] [2020-11-07 00:46:43,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:43,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:43,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442540239] [2020-11-07 00:46:43,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:43,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:43,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:43,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:43,651 INFO L87 Difference]: Start difference. First operand 500 states and 619 transitions. Second operand 4 states. [2020-11-07 00:46:43,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:43,920 INFO L93 Difference]: Finished difference Result 600 states and 734 transitions. [2020-11-07 00:46:43,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:43,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-11-07 00:46:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:43,924 INFO L225 Difference]: With dead ends: 600 [2020-11-07 00:46:43,925 INFO L226 Difference]: Without dead ends: 597 [2020-11-07 00:46:43,925 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-11-07 00:46:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-11-07 00:46:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 500. [2020-11-07 00:46:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-11-07 00:46:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 611 transitions. [2020-11-07 00:46:44,035 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 611 transitions. Word has length 56 [2020-11-07 00:46:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:44,035 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 611 transitions. [2020-11-07 00:46:44,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 611 transitions. [2020-11-07 00:46:44,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-07 00:46:44,037 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:44,037 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-11-07 00:46:44,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:46:44,037 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:44,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:44,038 INFO L82 PathProgramCache]: Analyzing trace with hash 247840109, now seen corresponding path program 1 times [2020-11-07 00:46:44,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:44,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [585476536] [2020-11-07 00:46:44,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:44,041 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:44,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:46:44,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [585476536] [2020-11-07 00:46:44,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:44,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:44,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236847558] [2020-11-07 00:46:44,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:44,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:44,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:44,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:44,107 INFO L87 Difference]: Start difference. First operand 500 states and 611 transitions. Second operand 4 states. [2020-11-07 00:46:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:44,464 INFO L93 Difference]: Finished difference Result 1383 states and 1701 transitions. [2020-11-07 00:46:44,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:44,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-11-07 00:46:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:44,469 INFO L225 Difference]: With dead ends: 1383 [2020-11-07 00:46:44,469 INFO L226 Difference]: Without dead ends: 500 [2020-11-07 00:46:44,471 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-11-07 00:46:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-11-07 00:46:44,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2020-11-07 00:46:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-11-07 00:46:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 579 transitions. [2020-11-07 00:46:44,561 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 579 transitions. Word has length 56 [2020-11-07 00:46:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:44,561 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 579 transitions. [2020-11-07 00:46:44,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 579 transitions. [2020-11-07 00:46:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 00:46:44,563 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:44,563 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-11-07 00:46:44,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:46:44,563 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:44,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:44,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1665831771, now seen corresponding path program 1 times [2020-11-07 00:46:44,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:44,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1112812806] [2020-11-07 00:46:44,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:44,567 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:44,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:46:44,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1112812806] [2020-11-07 00:46:44,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:44,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:44,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136669212] [2020-11-07 00:46:44,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:44,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:44,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:44,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:44,624 INFO L87 Difference]: Start difference. First operand 500 states and 579 transitions. Second operand 4 states. [2020-11-07 00:46:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:46:44,817 INFO L93 Difference]: Finished difference Result 500 states and 579 transitions. [2020-11-07 00:46:44,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:46:44,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2020-11-07 00:46:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:46:44,818 INFO L225 Difference]: With dead ends: 500 [2020-11-07 00:46:44,818 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:46:44,820 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-11-07 00:46:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:46:44,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:46:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:46:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:46:44,821 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2020-11-07 00:46:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:46:44,821 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:46:44,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:46:44,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:46:44,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:46:44,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:46:44,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:46:45,232 WARN L194 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 39 [2020-11-07 00:46:45,842 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 31 [2020-11-07 00:46:46,197 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 31 [2020-11-07 00:46:46,415 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 31 [2020-11-07 00:46:46,936 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 00:46:47,083 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 00:46:47,409 WARN L194 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 00:46:48,001 WARN L194 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 00:46:48,712 WARN L194 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 00:46:48,858 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 00:46:50,275 WARN L194 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 00:46:50,546 WARN L194 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 00:46:50,782 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 00:46:51,043 WARN L194 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 00:46:51,722 WARN L194 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 00:46:52,311 WARN L194 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 00:46:52,636 WARN L194 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 00:46:52,861 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-11-07 00:46:53,231 WARN L194 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 00:46:53,921 WARN L194 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 00:46:53,926 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 00:46:53,926 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 00:46:53,926 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:46:53,926 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 00:46:53,926 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 00:46:53,927 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 00:46:53,927 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:46:53,927 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 00:46:53,927 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:46:53,927 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:46:53,928 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |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-11-07 00:46:53,928 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 00:46:53,928 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 00:46:53,928 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:46:53,929 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:46:53,929 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:46:53,929 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:46:53,929 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:46:53,929 INFO L262 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: false [2020-11-07 00:46:53,929 INFO L262 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-11-07 00:46:53,930 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 00:46:53,930 INFO L269 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-11-07 00:46:53,930 INFO L269 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: true [2020-11-07 00:46:53,930 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 6 95) the Hoare annotation is: true [2020-11-07 00:46:53,930 INFO L262 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-11-07 00:46:53,930 INFO L269 CegarLoopResult]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2020-11-07 00:46:53,931 INFO L262 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-11-07 00:46:53,931 INFO L269 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-11-07 00:46:53,931 INFO L269 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-11-07 00:46:53,931 INFO L269 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-11-07 00:46:53,931 INFO L269 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: true [2020-11-07 00:46:53,931 INFO L262 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: false [2020-11-07 00:46:53,931 INFO L269 CegarLoopResult]: At program point L28(lines 28 30) the Hoare annotation is: true [2020-11-07 00:46:53,931 INFO L262 CegarLoopResult]: At program point L86(line 86) the Hoare annotation is: (= main_~lk5~0 1) [2020-11-07 00:46:53,931 INFO L262 CegarLoopResult]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2020-11-07 00:46:53,932 INFO L269 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-11-07 00:46:53,932 INFO L269 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-11-07 00:46:53,932 INFO L269 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-11-07 00:46:53,932 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 00:46:53,932 INFO L269 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-11-07 00:46:53,932 INFO L262 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-11-07 00:46:53,932 INFO L262 CegarLoopResult]: At program point L87(line 87) the Hoare annotation is: (= main_~lk5~0 1) [2020-11-07 00:46:53,932 INFO L269 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-11-07 00:46:53,932 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 6 95) the Hoare annotation is: true [2020-11-07 00:46:53,933 INFO L262 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-11-07 00:46:53,933 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2020-11-07 00:46:53,933 INFO L262 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-11-07 00:46:53,933 INFO L262 CegarLoopResult]: At program point L80-1(lines 26 90) the Hoare annotation is: (or (= main_~p5~0 0) (= main_~lk5~0 1)) [2020-11-07 00:46:53,933 INFO L269 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-11-07 00:46:53,933 INFO L262 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-11-07 00:46:53,933 INFO L269 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-11-07 00:46:53,933 INFO L269 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-11-07 00:46:53,934 INFO L262 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-11-07 00:46:53,934 INFO L269 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-11-07 00:46:53,934 INFO L269 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-11-07 00:46:53,934 INFO L262 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-11-07 00:46:53,934 INFO L262 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-11-07 00:46:53,934 INFO L262 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-11-07 00:46:53,935 INFO L269 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-11-07 00:46:53,935 INFO L262 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-11-07 00:46:53,935 INFO L269 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-11-07 00:46:53,935 INFO L262 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-11-07 00:46:53,935 INFO L269 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-11-07 00:46:53,935 INFO L269 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-11-07 00:46:53,936 INFO L262 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-11-07 00:46:53,936 INFO L269 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-11-07 00:46:53,936 INFO L269 CegarLoopResult]: At program point L91(lines 7 95) the Hoare annotation is: true [2020-11-07 00:46:53,936 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 00:46:53,936 INFO L269 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-11-07 00:46:53,936 INFO L269 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-11-07 00:46:53,936 INFO L262 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-11-07 00:46:53,936 INFO L269 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-11-07 00:46:53,937 INFO L262 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-11-07 00:46:53,937 INFO L262 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-11-07 00:46:53,937 INFO L269 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-11-07 00:46:53,937 INFO L262 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-11-07 00:46:53,938 INFO L262 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-11-07 00:46:53,938 INFO L269 CegarLoopResult]: At program point L43(lines 43 45) the Hoare annotation is: true [2020-11-07 00:46:53,938 INFO L262 CegarLoopResult]: At program point L43-2(lines 26 90) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-11-07 00:46:53,938 INFO L269 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-11-07 00:46:53,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:46:53 BoogieIcfgContainer [2020-11-07 00:46:53,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:46:53,954 INFO L168 Benchmark]: Toolchain (without parser) took 15479.60 ms. Allocated memory was 158.3 MB in the beginning and 331.4 MB in the end (delta: 173.0 MB). Free memory was 135.2 MB in the beginning and 284.5 MB in the end (delta: -149.3 MB). Peak memory consumption was 199.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:46:53,954 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 158.3 MB. Free memory is still 133.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:46:53,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.30 ms. Allocated memory is still 158.3 MB. Free memory was 134.6 MB in the beginning and 124.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:46:53,956 INFO L168 Benchmark]: Boogie Preprocessor took 68.79 ms. Allocated memory is still 158.3 MB. Free memory was 124.8 MB in the beginning and 123.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:46:53,956 INFO L168 Benchmark]: RCFGBuilder took 779.20 ms. Allocated memory is still 158.3 MB. Free memory was 123.2 MB in the beginning and 140.0 MB in the end (delta: -16.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:46:53,957 INFO L168 Benchmark]: TraceAbstraction took 14325.98 ms. Allocated memory was 158.3 MB in the beginning and 331.4 MB in the end (delta: 173.0 MB). Free memory was 139.5 MB in the beginning and 284.5 MB in the end (delta: -145.0 MB). Peak memory consumption was 204.2 MB. Max. memory is 8.0 GB. [2020-11-07 00:46:53,960 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 158.3 MB. Free memory is still 133.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 289.30 ms. Allocated memory is still 158.3 MB. Free memory was 134.6 MB in the beginning and 124.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 68.79 ms. Allocated memory is still 158.3 MB. Free memory was 124.8 MB in the beginning and 123.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 779.20 ms. Allocated memory is still 158.3 MB. Free memory was 123.2 MB in the beginning and 140.0 MB in the end (delta: -16.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 14325.98 ms. Allocated memory was 158.3 MB in the beginning and 331.4 MB in the end (delta: 173.0 MB). Free memory was 139.5 MB in the beginning and 284.5 MB in the end (delta: -145.0 MB). Peak memory consumption was 204.2 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: 5.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1046 SDtfs, 1143 SDslu, 171 SDs, 0 SdLazy, 745 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s 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.6s 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, 7.1s 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...