./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_12.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fbb7e06bf350f46f725ea0ddc5d1215829061b3a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 19:39:00,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 19:39:00,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 19:39:00,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 19:39:00,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 19:39:00,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 19:39:00,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 19:39:00,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 19:39:00,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 19:39:00,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 19:39:00,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 19:39:00,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 19:39:00,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 19:39:00,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 19:39:00,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 19:39:00,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 19:39:00,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 19:39:00,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 19:39:00,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 19:39:00,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 19:39:00,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 19:39:00,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 19:39:00,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 19:39:00,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 19:39:00,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 19:39:00,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 19:39:00,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 19:39:00,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 19:39:00,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 19:39:00,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 19:39:00,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 19:39:00,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 19:39:00,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 19:39:00,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 19:39:00,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 19:39:00,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 19:39:00,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 19:39:00,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 19:39:00,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 19:39:00,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 19:39:00,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 19:39:00,210 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 19:39:00,238 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 19:39:00,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 19:39:00,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 19:39:00,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 19:39:00,241 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 19:39:00,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 19:39:00,242 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 19:39:00,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 19:39:00,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 19:39:00,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 19:39:00,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 19:39:00,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 19:39:00,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 19:39:00,243 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 19:39:00,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 19:39:00,244 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 19:39:00,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 19:39:00,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 19:39:00,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 19:39:00,245 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 19:39:00,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 19:39:00,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:39:00,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 19:39:00,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 19:39:00,246 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 19:39:00,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 19:39:00,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 19:39:00,247 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 19:39:00,247 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 19:39:00,247 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fbb7e06bf350f46f725ea0ddc5d1215829061b3a [2020-10-25 19:39:00,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 19:39:00,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 19:39:00,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 19:39:00,669 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 19:39:00,670 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 19:39:00,671 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2020-10-25 19:39:00,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5989603e8/e79bf2b54e7e4cdcb65e7561cc88f9fc/FLAG5da0425e7 [2020-10-25 19:39:01,364 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 19:39:01,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2020-10-25 19:39:01,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5989603e8/e79bf2b54e7e4cdcb65e7561cc88f9fc/FLAG5da0425e7 [2020-10-25 19:39:01,724 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5989603e8/e79bf2b54e7e4cdcb65e7561cc88f9fc [2020-10-25 19:39:01,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 19:39:01,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 19:39:01,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 19:39:01,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 19:39:01,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 19:39:01,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:39:01" (1/1) ... [2020-10-25 19:39:01,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37475e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:01, skipping insertion in model container [2020-10-25 19:39:01,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:39:01" (1/1) ... [2020-10-25 19:39:01,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 19:39:01,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 19:39:01,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:39:01,997 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 19:39:02,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:39:02,047 INFO L208 MainTranslator]: Completed translation [2020-10-25 19:39:02,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02 WrapperNode [2020-10-25 19:39:02,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 19:39:02,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 19:39:02,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 19:39:02,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 19:39:02,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 19:39:02,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 19:39:02,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 19:39:02,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 19:39:02,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... [2020-10-25 19:39:02,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 19:39:02,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 19:39:02,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 19:39:02,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 19:39:02,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:39:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 19:39:02,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 19:39:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 19:39:02,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 19:39:02,725 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 19:39:02,725 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-25 19:39:02,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:39:02 BoogieIcfgContainer [2020-10-25 19:39:02,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 19:39:02,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 19:39:02,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 19:39:02,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 19:39:02,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 07:39:01" (1/3) ... [2020-10-25 19:39:02,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e08274a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:39:02, skipping insertion in model container [2020-10-25 19:39:02,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:39:02" (2/3) ... [2020-10-25 19:39:02,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e08274a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:39:02, skipping insertion in model container [2020-10-25 19:39:02,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:39:02" (3/3) ... [2020-10-25 19:39:02,738 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2020-10-25 19:39:02,751 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 19:39:02,756 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 19:39:02,770 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 19:39:02,810 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 19:39:02,811 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 19:39:02,811 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 19:39:02,811 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 19:39:02,811 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 19:39:02,811 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 19:39:02,811 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 19:39:02,812 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 19:39:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-10-25 19:39:02,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-25 19:39:02,836 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:02,837 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:02,837 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:02,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:02,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1341605783, now seen corresponding path program 1 times [2020-10-25 19:39:02,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:02,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368106095] [2020-10-25 19:39:02,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:03,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:03,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368106095] [2020-10-25 19:39:03,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:03,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:03,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052003905] [2020-10-25 19:39:03,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:03,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:03,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:03,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,180 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2020-10-25 19:39:03,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:03,234 INFO L93 Difference]: Finished difference Result 96 states and 170 transitions. [2020-10-25 19:39:03,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:03,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-25 19:39:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:03,250 INFO L225 Difference]: With dead ends: 96 [2020-10-25 19:39:03,250 INFO L226 Difference]: Without dead ends: 81 [2020-10-25 19:39:03,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-25 19:39:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2020-10-25 19:39:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-25 19:39:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 102 transitions. [2020-10-25 19:39:03,299 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 102 transitions. Word has length 19 [2020-10-25 19:39:03,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:03,300 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 102 transitions. [2020-10-25 19:39:03,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 102 transitions. [2020-10-25 19:39:03,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-25 19:39:03,301 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:03,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:03,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 19:39:03,302 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:03,303 INFO L82 PathProgramCache]: Analyzing trace with hash 61742105, now seen corresponding path program 1 times [2020-10-25 19:39:03,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:03,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583782915] [2020-10-25 19:39:03,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:03,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583782915] [2020-10-25 19:39:03,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:03,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:03,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64504172] [2020-10-25 19:39:03,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:03,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:03,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:03,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,379 INFO L87 Difference]: Start difference. First operand 55 states and 102 transitions. Second operand 3 states. [2020-10-25 19:39:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:03,408 INFO L93 Difference]: Finished difference Result 134 states and 249 transitions. [2020-10-25 19:39:03,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:03,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-25 19:39:03,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:03,410 INFO L225 Difference]: With dead ends: 134 [2020-10-25 19:39:03,411 INFO L226 Difference]: Without dead ends: 81 [2020-10-25 19:39:03,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-25 19:39:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2020-10-25 19:39:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-25 19:39:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 146 transitions. [2020-10-25 19:39:03,434 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 146 transitions. Word has length 19 [2020-10-25 19:39:03,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:03,435 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 146 transitions. [2020-10-25 19:39:03,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:03,435 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 146 transitions. [2020-10-25 19:39:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-25 19:39:03,436 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:03,436 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] [2020-10-25 19:39:03,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 19:39:03,437 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:03,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1359680987, now seen corresponding path program 1 times [2020-10-25 19:39:03,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:03,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690827651] [2020-10-25 19:39:03,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:03,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690827651] [2020-10-25 19:39:03,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:03,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:03,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50979308] [2020-10-25 19:39:03,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:03,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:03,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:03,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,506 INFO L87 Difference]: Start difference. First operand 79 states and 146 transitions. Second operand 3 states. [2020-10-25 19:39:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:03,529 INFO L93 Difference]: Finished difference Result 123 states and 222 transitions. [2020-10-25 19:39:03,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:03,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-25 19:39:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:03,531 INFO L225 Difference]: With dead ends: 123 [2020-10-25 19:39:03,532 INFO L226 Difference]: Without dead ends: 84 [2020-10-25 19:39:03,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-25 19:39:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2020-10-25 19:39:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-25 19:39:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 148 transitions. [2020-10-25 19:39:03,546 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 148 transitions. Word has length 20 [2020-10-25 19:39:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:03,546 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 148 transitions. [2020-10-25 19:39:03,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 148 transitions. [2020-10-25 19:39:03,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-25 19:39:03,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:03,548 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] [2020-10-25 19:39:03,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 19:39:03,548 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:03,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:03,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1914217955, now seen corresponding path program 1 times [2020-10-25 19:39:03,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:03,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096147864] [2020-10-25 19:39:03,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:03,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096147864] [2020-10-25 19:39:03,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:03,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:03,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525437932] [2020-10-25 19:39:03,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:03,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:03,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:03,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,612 INFO L87 Difference]: Start difference. First operand 82 states and 148 transitions. Second operand 3 states. [2020-10-25 19:39:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:03,640 INFO L93 Difference]: Finished difference Result 157 states and 285 transitions. [2020-10-25 19:39:03,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:03,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-25 19:39:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:03,643 INFO L225 Difference]: With dead ends: 157 [2020-10-25 19:39:03,643 INFO L226 Difference]: Without dead ends: 155 [2020-10-25 19:39:03,644 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-25 19:39:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2020-10-25 19:39:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-25 19:39:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 197 transitions. [2020-10-25 19:39:03,660 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 197 transitions. Word has length 20 [2020-10-25 19:39:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:03,661 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 197 transitions. [2020-10-25 19:39:03,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 197 transitions. [2020-10-25 19:39:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-25 19:39:03,663 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:03,663 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] [2020-10-25 19:39:03,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 19:39:03,664 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:03,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:03,665 INFO L82 PathProgramCache]: Analyzing trace with hash 634354277, now seen corresponding path program 1 times [2020-10-25 19:39:03,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:03,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846089880] [2020-10-25 19:39:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:03,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846089880] [2020-10-25 19:39:03,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:03,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:03,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843963092] [2020-10-25 19:39:03,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:03,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:03,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:03,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,748 INFO L87 Difference]: Start difference. First operand 109 states and 197 transitions. Second operand 3 states. [2020-10-25 19:39:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:03,773 INFO L93 Difference]: Finished difference Result 261 states and 475 transitions. [2020-10-25 19:39:03,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:03,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-25 19:39:03,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:03,776 INFO L225 Difference]: With dead ends: 261 [2020-10-25 19:39:03,776 INFO L226 Difference]: Without dead ends: 157 [2020-10-25 19:39:03,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-25 19:39:03,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2020-10-25 19:39:03,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-10-25 19:39:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 279 transitions. [2020-10-25 19:39:03,796 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 279 transitions. Word has length 20 [2020-10-25 19:39:03,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:03,796 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 279 transitions. [2020-10-25 19:39:03,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 279 transitions. [2020-10-25 19:39:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-25 19:39:03,798 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:03,798 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] [2020-10-25 19:39:03,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 19:39:03,798 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:03,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:03,799 INFO L82 PathProgramCache]: Analyzing trace with hash -788572498, now seen corresponding path program 1 times [2020-10-25 19:39:03,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:03,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311170538] [2020-10-25 19:39:03,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:03,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311170538] [2020-10-25 19:39:03,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:03,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:03,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485852400] [2020-10-25 19:39:03,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:03,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:03,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:03,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,893 INFO L87 Difference]: Start difference. First operand 155 states and 279 transitions. Second operand 3 states. [2020-10-25 19:39:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:03,921 INFO L93 Difference]: Finished difference Result 234 states and 418 transitions. [2020-10-25 19:39:03,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:03,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-25 19:39:03,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:03,923 INFO L225 Difference]: With dead ends: 234 [2020-10-25 19:39:03,923 INFO L226 Difference]: Without dead ends: 159 [2020-10-25 19:39:03,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-10-25 19:39:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2020-10-25 19:39:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-10-25 19:39:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2020-10-25 19:39:03,941 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 21 [2020-10-25 19:39:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:03,942 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2020-10-25 19:39:03,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2020-10-25 19:39:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-25 19:39:03,944 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:03,944 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] [2020-10-25 19:39:03,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 19:39:03,944 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:03,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:03,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1809640852, now seen corresponding path program 1 times [2020-10-25 19:39:03,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:03,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553233487] [2020-10-25 19:39:03,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:03,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:03,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553233487] [2020-10-25 19:39:03,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:03,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:03,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639346327] [2020-10-25 19:39:03,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:03,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:03,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:03,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:03,988 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand 3 states. [2020-10-25 19:39:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,018 INFO L93 Difference]: Finished difference Result 453 states and 809 transitions. [2020-10-25 19:39:04,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-25 19:39:04,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,022 INFO L225 Difference]: With dead ends: 453 [2020-10-25 19:39:04,022 INFO L226 Difference]: Without dead ends: 303 [2020-10-25 19:39:04,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-25 19:39:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2020-10-25 19:39:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-10-25 19:39:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 531 transitions. [2020-10-25 19:39:04,051 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 531 transitions. Word has length 21 [2020-10-25 19:39:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,051 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 531 transitions. [2020-10-25 19:39:04,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 531 transitions. [2020-10-25 19:39:04,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-25 19:39:04,054 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,054 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] [2020-10-25 19:39:04,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 19:39:04,054 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,055 INFO L82 PathProgramCache]: Analyzing trace with hash -529777174, now seen corresponding path program 1 times [2020-10-25 19:39:04,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162760204] [2020-10-25 19:39:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,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-10-25 19:39:04,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162760204] [2020-10-25 19:39:04,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814709437] [2020-10-25 19:39:04,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,108 INFO L87 Difference]: Start difference. First operand 301 states and 531 transitions. Second operand 3 states. [2020-10-25 19:39:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,128 INFO L93 Difference]: Finished difference Result 385 states and 685 transitions. [2020-10-25 19:39:04,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-25 19:39:04,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,131 INFO L225 Difference]: With dead ends: 385 [2020-10-25 19:39:04,132 INFO L226 Difference]: Without dead ends: 383 [2020-10-25 19:39:04,132 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2020-10-25 19:39:04,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 301. [2020-10-25 19:39:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-10-25 19:39:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 527 transitions. [2020-10-25 19:39:04,171 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 527 transitions. Word has length 21 [2020-10-25 19:39:04,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,172 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 527 transitions. [2020-10-25 19:39:04,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,172 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 527 transitions. [2020-10-25 19:39:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-25 19:39:04,174 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,174 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] [2020-10-25 19:39:04,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 19:39:04,174 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,177 INFO L82 PathProgramCache]: Analyzing trace with hash -264078182, now seen corresponding path program 1 times [2020-10-25 19:39:04,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137751416] [2020-10-25 19:39:04,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:04,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137751416] [2020-10-25 19:39:04,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371292173] [2020-10-25 19:39:04,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,248 INFO L87 Difference]: Start difference. First operand 301 states and 527 transitions. Second operand 3 states. [2020-10-25 19:39:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,273 INFO L93 Difference]: Finished difference Result 565 states and 1001 transitions. [2020-10-25 19:39:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-10-25 19:39:04,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,286 INFO L225 Difference]: With dead ends: 565 [2020-10-25 19:39:04,287 INFO L226 Difference]: Without dead ends: 563 [2020-10-25 19:39:04,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-10-25 19:39:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 417. [2020-10-25 19:39:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-10-25 19:39:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 719 transitions. [2020-10-25 19:39:04,305 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 719 transitions. Word has length 22 [2020-10-25 19:39:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,305 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 719 transitions. [2020-10-25 19:39:04,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,306 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 719 transitions. [2020-10-25 19:39:04,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-25 19:39:04,307 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,308 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] [2020-10-25 19:39:04,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 19:39:04,308 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1543941860, now seen corresponding path program 1 times [2020-10-25 19:39:04,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775183723] [2020-10-25 19:39:04,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:04,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775183723] [2020-10-25 19:39:04,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303197091] [2020-10-25 19:39:04,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,355 INFO L87 Difference]: Start difference. First operand 417 states and 719 transitions. Second operand 3 states. [2020-10-25 19:39:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,389 INFO L93 Difference]: Finished difference Result 997 states and 1729 transitions. [2020-10-25 19:39:04,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-10-25 19:39:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,399 INFO L225 Difference]: With dead ends: 997 [2020-10-25 19:39:04,399 INFO L226 Difference]: Without dead ends: 587 [2020-10-25 19:39:04,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-10-25 19:39:04,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2020-10-25 19:39:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2020-10-25 19:39:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1003 transitions. [2020-10-25 19:39:04,419 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1003 transitions. Word has length 22 [2020-10-25 19:39:04,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,420 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 1003 transitions. [2020-10-25 19:39:04,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1003 transitions. [2020-10-25 19:39:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-25 19:39:04,421 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,421 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] [2020-10-25 19:39:04,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 19:39:04,422 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,422 INFO L82 PathProgramCache]: Analyzing trace with hash 403724673, now seen corresponding path program 1 times [2020-10-25 19:39:04,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313557885] [2020-10-25 19:39:04,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:04,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313557885] [2020-10-25 19:39:04,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430878413] [2020-10-25 19:39:04,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,454 INFO L87 Difference]: Start difference. First operand 585 states and 1003 transitions. Second operand 3 states. [2020-10-25 19:39:04,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,488 INFO L93 Difference]: Finished difference Result 885 states and 1513 transitions. [2020-10-25 19:39:04,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-10-25 19:39:04,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,493 INFO L225 Difference]: With dead ends: 885 [2020-10-25 19:39:04,493 INFO L226 Difference]: Without dead ends: 599 [2020-10-25 19:39:04,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-10-25 19:39:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2020-10-25 19:39:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2020-10-25 19:39:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1011 transitions. [2020-10-25 19:39:04,511 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1011 transitions. Word has length 23 [2020-10-25 19:39:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,511 INFO L481 AbstractCegarLoop]: Abstraction has 597 states and 1011 transitions. [2020-10-25 19:39:04,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1011 transitions. [2020-10-25 19:39:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-25 19:39:04,513 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,513 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] [2020-10-25 19:39:04,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 19:39:04,514 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,514 INFO L82 PathProgramCache]: Analyzing trace with hash -617343681, now seen corresponding path program 1 times [2020-10-25 19:39:04,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172601973] [2020-10-25 19:39:04,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:04,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172601973] [2020-10-25 19:39:04,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786025450] [2020-10-25 19:39:04,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,554 INFO L87 Difference]: Start difference. First operand 597 states and 1011 transitions. Second operand 3 states. [2020-10-25 19:39:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,580 INFO L93 Difference]: Finished difference Result 1097 states and 1885 transitions. [2020-10-25 19:39:04,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-10-25 19:39:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,586 INFO L225 Difference]: With dead ends: 1097 [2020-10-25 19:39:04,587 INFO L226 Difference]: Without dead ends: 1095 [2020-10-25 19:39:04,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2020-10-25 19:39:04,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 837. [2020-10-25 19:39:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2020-10-25 19:39:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1387 transitions. [2020-10-25 19:39:04,618 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1387 transitions. Word has length 23 [2020-10-25 19:39:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,619 INFO L481 AbstractCegarLoop]: Abstraction has 837 states and 1387 transitions. [2020-10-25 19:39:04,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1387 transitions. [2020-10-25 19:39:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-25 19:39:04,620 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,621 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] [2020-10-25 19:39:04,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 19:39:04,621 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1897207359, now seen corresponding path program 1 times [2020-10-25 19:39:04,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578290053] [2020-10-25 19:39:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:04,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578290053] [2020-10-25 19:39:04,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76618952] [2020-10-25 19:39:04,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,653 INFO L87 Difference]: Start difference. First operand 837 states and 1387 transitions. Second operand 3 states. [2020-10-25 19:39:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,688 INFO L93 Difference]: Finished difference Result 1977 states and 3293 transitions. [2020-10-25 19:39:04,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-10-25 19:39:04,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,695 INFO L225 Difference]: With dead ends: 1977 [2020-10-25 19:39:04,696 INFO L226 Difference]: Without dead ends: 1159 [2020-10-25 19:39:04,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2020-10-25 19:39:04,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2020-10-25 19:39:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2020-10-25 19:39:04,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1907 transitions. [2020-10-25 19:39:04,730 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1907 transitions. Word has length 23 [2020-10-25 19:39:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,731 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1907 transitions. [2020-10-25 19:39:04,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1907 transitions. [2020-10-25 19:39:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 19:39:04,735 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,735 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] [2020-10-25 19:39:04,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 19:39:04,735 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1957570863, now seen corresponding path program 1 times [2020-10-25 19:39:04,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883930593] [2020-10-25 19:39:04,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:04,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883930593] [2020-10-25 19:39:04,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290198020] [2020-10-25 19:39:04,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,770 INFO L87 Difference]: Start difference. First operand 1157 states and 1907 transitions. Second operand 3 states. [2020-10-25 19:39:04,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,814 INFO L93 Difference]: Finished difference Result 1737 states and 2853 transitions. [2020-10-25 19:39:04,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-25 19:39:04,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,821 INFO L225 Difference]: With dead ends: 1737 [2020-10-25 19:39:04,821 INFO L226 Difference]: Without dead ends: 1175 [2020-10-25 19:39:04,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-10-25 19:39:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1173. [2020-10-25 19:39:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2020-10-25 19:39:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1907 transitions. [2020-10-25 19:39:04,852 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1907 transitions. Word has length 24 [2020-10-25 19:39:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:04,852 INFO L481 AbstractCegarLoop]: Abstraction has 1173 states and 1907 transitions. [2020-10-25 19:39:04,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1907 transitions. [2020-10-25 19:39:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 19:39:04,855 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:04,855 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] [2020-10-25 19:39:04,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 19:39:04,856 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:04,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:04,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1316328079, now seen corresponding path program 1 times [2020-10-25 19:39:04,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:04,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088017438] [2020-10-25 19:39:04,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:04,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088017438] [2020-10-25 19:39:04,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:04,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:04,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127436628] [2020-10-25 19:39:04,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:04,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:04,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:04,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,894 INFO L87 Difference]: Start difference. First operand 1173 states and 1907 transitions. Second operand 3 states. [2020-10-25 19:39:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:04,932 INFO L93 Difference]: Finished difference Result 2121 states and 3509 transitions. [2020-10-25 19:39:04,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:04,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-25 19:39:04,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:04,943 INFO L225 Difference]: With dead ends: 2121 [2020-10-25 19:39:04,943 INFO L226 Difference]: Without dead ends: 2119 [2020-10-25 19:39:04,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2020-10-25 19:39:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1669. [2020-10-25 19:39:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2020-10-25 19:39:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2643 transitions. [2020-10-25 19:39:05,021 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2643 transitions. Word has length 24 [2020-10-25 19:39:05,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:05,022 INFO L481 AbstractCegarLoop]: Abstraction has 1669 states and 2643 transitions. [2020-10-25 19:39:05,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:05,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2643 transitions. [2020-10-25 19:39:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 19:39:05,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:05,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:05,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 19:39:05,028 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:05,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:05,031 INFO L82 PathProgramCache]: Analyzing trace with hash 36464401, now seen corresponding path program 1 times [2020-10-25 19:39:05,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:05,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852868317] [2020-10-25 19:39:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:05,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852868317] [2020-10-25 19:39:05,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:05,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:05,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300934712] [2020-10-25 19:39:05,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:05,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:05,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:05,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,088 INFO L87 Difference]: Start difference. First operand 1669 states and 2643 transitions. Second operand 3 states. [2020-10-25 19:39:05,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:05,135 INFO L93 Difference]: Finished difference Result 3913 states and 6229 transitions. [2020-10-25 19:39:05,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:05,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-25 19:39:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:05,147 INFO L225 Difference]: With dead ends: 3913 [2020-10-25 19:39:05,148 INFO L226 Difference]: Without dead ends: 2279 [2020-10-25 19:39:05,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2020-10-25 19:39:05,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2277. [2020-10-25 19:39:05,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2020-10-25 19:39:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3587 transitions. [2020-10-25 19:39:05,238 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3587 transitions. Word has length 24 [2020-10-25 19:39:05,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:05,238 INFO L481 AbstractCegarLoop]: Abstraction has 2277 states and 3587 transitions. [2020-10-25 19:39:05,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3587 transitions. [2020-10-25 19:39:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 19:39:05,241 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:05,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:05,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 19:39:05,242 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:05,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:05,243 INFO L82 PathProgramCache]: Analyzing trace with hash -2143288106, now seen corresponding path program 1 times [2020-10-25 19:39:05,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:05,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050824023] [2020-10-25 19:39:05,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:05,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050824023] [2020-10-25 19:39:05,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:05,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:05,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695504073] [2020-10-25 19:39:05,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:05,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:05,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:05,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,272 INFO L87 Difference]: Start difference. First operand 2277 states and 3587 transitions. Second operand 3 states. [2020-10-25 19:39:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:05,313 INFO L93 Difference]: Finished difference Result 3417 states and 5365 transitions. [2020-10-25 19:39:05,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:05,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-10-25 19:39:05,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:05,326 INFO L225 Difference]: With dead ends: 3417 [2020-10-25 19:39:05,326 INFO L226 Difference]: Without dead ends: 2311 [2020-10-25 19:39:05,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2020-10-25 19:39:05,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2309. [2020-10-25 19:39:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2309 states. [2020-10-25 19:39:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3587 transitions. [2020-10-25 19:39:05,428 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3587 transitions. Word has length 25 [2020-10-25 19:39:05,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:05,429 INFO L481 AbstractCegarLoop]: Abstraction has 2309 states and 3587 transitions. [2020-10-25 19:39:05,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:05,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3587 transitions. [2020-10-25 19:39:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 19:39:05,433 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:05,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:05,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 19:39:05,433 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:05,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:05,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1130610836, now seen corresponding path program 1 times [2020-10-25 19:39:05,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:05,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70526769] [2020-10-25 19:39:05,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:05,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70526769] [2020-10-25 19:39:05,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:05,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:05,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049277560] [2020-10-25 19:39:05,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:05,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:05,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:05,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,486 INFO L87 Difference]: Start difference. First operand 2309 states and 3587 transitions. Second operand 3 states. [2020-10-25 19:39:05,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:05,550 INFO L93 Difference]: Finished difference Result 4105 states and 6501 transitions. [2020-10-25 19:39:05,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:05,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-10-25 19:39:05,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:05,572 INFO L225 Difference]: With dead ends: 4105 [2020-10-25 19:39:05,573 INFO L226 Difference]: Without dead ends: 4103 [2020-10-25 19:39:05,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2020-10-25 19:39:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 3333. [2020-10-25 19:39:05,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3333 states. [2020-10-25 19:39:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 5027 transitions. [2020-10-25 19:39:05,696 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 5027 transitions. Word has length 25 [2020-10-25 19:39:05,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:05,697 INFO L481 AbstractCegarLoop]: Abstraction has 3333 states and 5027 transitions. [2020-10-25 19:39:05,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:05,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 5027 transitions. [2020-10-25 19:39:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 19:39:05,702 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:05,702 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:05,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-25 19:39:05,703 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:05,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:05,703 INFO L82 PathProgramCache]: Analyzing trace with hash -149252842, now seen corresponding path program 1 times [2020-10-25 19:39:05,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:05,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927153924] [2020-10-25 19:39:05,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:05,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927153924] [2020-10-25 19:39:05,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:05,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:05,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169598046] [2020-10-25 19:39:05,731 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:05,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:05,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:05,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,732 INFO L87 Difference]: Start difference. First operand 3333 states and 5027 transitions. Second operand 3 states. [2020-10-25 19:39:05,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:05,803 INFO L93 Difference]: Finished difference Result 7753 states and 11749 transitions. [2020-10-25 19:39:05,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:05,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-10-25 19:39:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:05,825 INFO L225 Difference]: With dead ends: 7753 [2020-10-25 19:39:05,825 INFO L226 Difference]: Without dead ends: 4487 [2020-10-25 19:39:05,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2020-10-25 19:39:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2020-10-25 19:39:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4485 states. [2020-10-25 19:39:05,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6723 transitions. [2020-10-25 19:39:05,989 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6723 transitions. Word has length 25 [2020-10-25 19:39:05,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:05,989 INFO L481 AbstractCegarLoop]: Abstraction has 4485 states and 6723 transitions. [2020-10-25 19:39:05,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:05,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6723 transitions. [2020-10-25 19:39:05,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-25 19:39:05,995 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:05,995 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] [2020-10-25 19:39:05,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-25 19:39:05,995 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:05,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:05,996 INFO L82 PathProgramCache]: Analyzing trace with hash 689412294, now seen corresponding path program 1 times [2020-10-25 19:39:05,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:05,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881435825] [2020-10-25 19:39:05,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:06,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881435825] [2020-10-25 19:39:06,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:06,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:06,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463741866] [2020-10-25 19:39:06,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:06,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:06,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:06,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:06,042 INFO L87 Difference]: Start difference. First operand 4485 states and 6723 transitions. Second operand 3 states. [2020-10-25 19:39:06,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:06,141 INFO L93 Difference]: Finished difference Result 6729 states and 10053 transitions. [2020-10-25 19:39:06,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:06,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-10-25 19:39:06,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:06,165 INFO L225 Difference]: With dead ends: 6729 [2020-10-25 19:39:06,165 INFO L226 Difference]: Without dead ends: 4551 [2020-10-25 19:39:06,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2020-10-25 19:39:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 4549. [2020-10-25 19:39:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4549 states. [2020-10-25 19:39:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 6723 transitions. [2020-10-25 19:39:06,327 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 6723 transitions. Word has length 26 [2020-10-25 19:39:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:06,328 INFO L481 AbstractCegarLoop]: Abstraction has 4549 states and 6723 transitions. [2020-10-25 19:39:06,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 6723 transitions. [2020-10-25 19:39:06,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-25 19:39:06,334 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:06,334 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] [2020-10-25 19:39:06,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-25 19:39:06,334 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:06,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:06,335 INFO L82 PathProgramCache]: Analyzing trace with hash -331656060, now seen corresponding path program 1 times [2020-10-25 19:39:06,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:06,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606207939] [2020-10-25 19:39:06,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:06,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606207939] [2020-10-25 19:39:06,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:06,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:06,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197757341] [2020-10-25 19:39:06,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:06,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:06,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:06,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:06,367 INFO L87 Difference]: Start difference. First operand 4549 states and 6723 transitions. Second operand 3 states. [2020-10-25 19:39:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:06,484 INFO L93 Difference]: Finished difference Result 7945 states and 11973 transitions. [2020-10-25 19:39:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:06,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-10-25 19:39:06,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:06,504 INFO L225 Difference]: With dead ends: 7945 [2020-10-25 19:39:06,505 INFO L226 Difference]: Without dead ends: 7943 [2020-10-25 19:39:06,509 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2020-10-25 19:39:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 6661. [2020-10-25 19:39:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6661 states. [2020-10-25 19:39:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 9539 transitions. [2020-10-25 19:39:06,726 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 9539 transitions. Word has length 26 [2020-10-25 19:39:06,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:06,726 INFO L481 AbstractCegarLoop]: Abstraction has 6661 states and 9539 transitions. [2020-10-25 19:39:06,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:06,726 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 9539 transitions. [2020-10-25 19:39:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-25 19:39:06,736 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:06,736 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] [2020-10-25 19:39:06,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-25 19:39:06,737 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:06,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:06,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1611519738, now seen corresponding path program 1 times [2020-10-25 19:39:06,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:06,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598216149] [2020-10-25 19:39:06,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:06,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598216149] [2020-10-25 19:39:06,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:06,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:06,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863217574] [2020-10-25 19:39:06,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:06,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:06,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:06,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:06,766 INFO L87 Difference]: Start difference. First operand 6661 states and 9539 transitions. Second operand 3 states. [2020-10-25 19:39:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:06,957 INFO L93 Difference]: Finished difference Result 15369 states and 22085 transitions. [2020-10-25 19:39:06,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:06,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-10-25 19:39:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:06,977 INFO L225 Difference]: With dead ends: 15369 [2020-10-25 19:39:06,978 INFO L226 Difference]: Without dead ends: 8839 [2020-10-25 19:39:06,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:07,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2020-10-25 19:39:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 8837. [2020-10-25 19:39:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8837 states. [2020-10-25 19:39:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 12547 transitions. [2020-10-25 19:39:07,277 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 12547 transitions. Word has length 26 [2020-10-25 19:39:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:07,277 INFO L481 AbstractCegarLoop]: Abstraction has 8837 states and 12547 transitions. [2020-10-25 19:39:07,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 12547 transitions. [2020-10-25 19:39:07,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-25 19:39:07,287 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:07,287 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] [2020-10-25 19:39:07,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-25 19:39:07,288 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:07,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:07,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1691188181, now seen corresponding path program 1 times [2020-10-25 19:39:07,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:07,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881961177] [2020-10-25 19:39:07,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:07,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881961177] [2020-10-25 19:39:07,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:07,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:07,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467392426] [2020-10-25 19:39:07,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:07,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:07,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:07,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:07,328 INFO L87 Difference]: Start difference. First operand 8837 states and 12547 transitions. Second operand 3 states. [2020-10-25 19:39:07,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:07,503 INFO L93 Difference]: Finished difference Result 13257 states and 18757 transitions. [2020-10-25 19:39:07,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:07,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-10-25 19:39:07,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:07,522 INFO L225 Difference]: With dead ends: 13257 [2020-10-25 19:39:07,522 INFO L226 Difference]: Without dead ends: 8967 [2020-10-25 19:39:07,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8967 states. [2020-10-25 19:39:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8967 to 8965. [2020-10-25 19:39:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8965 states. [2020-10-25 19:39:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8965 states to 8965 states and 12547 transitions. [2020-10-25 19:39:07,828 INFO L78 Accepts]: Start accepts. Automaton has 8965 states and 12547 transitions. Word has length 27 [2020-10-25 19:39:07,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:07,828 INFO L481 AbstractCegarLoop]: Abstraction has 8965 states and 12547 transitions. [2020-10-25 19:39:07,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 8965 states and 12547 transitions. [2020-10-25 19:39:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-25 19:39:07,838 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:07,838 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] [2020-10-25 19:39:07,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-25 19:39:07,838 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:07,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:07,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1582710761, now seen corresponding path program 1 times [2020-10-25 19:39:07,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:07,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382153691] [2020-10-25 19:39:07,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:07,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382153691] [2020-10-25 19:39:07,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:07,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:07,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911185442] [2020-10-25 19:39:07,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:07,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:07,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:07,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:07,882 INFO L87 Difference]: Start difference. First operand 8965 states and 12547 transitions. Second operand 3 states. [2020-10-25 19:39:08,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:08,054 INFO L93 Difference]: Finished difference Result 15369 states and 21893 transitions. [2020-10-25 19:39:08,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:08,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-10-25 19:39:08,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:08,084 INFO L225 Difference]: With dead ends: 15369 [2020-10-25 19:39:08,085 INFO L226 Difference]: Without dead ends: 15367 [2020-10-25 19:39:08,091 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15367 states. [2020-10-25 19:39:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15367 to 13317. [2020-10-25 19:39:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13317 states. [2020-10-25 19:39:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13317 states to 13317 states and 18051 transitions. [2020-10-25 19:39:08,448 INFO L78 Accepts]: Start accepts. Automaton has 13317 states and 18051 transitions. Word has length 27 [2020-10-25 19:39:08,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:08,449 INFO L481 AbstractCegarLoop]: Abstraction has 13317 states and 18051 transitions. [2020-10-25 19:39:08,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:08,449 INFO L276 IsEmpty]: Start isEmpty. Operand 13317 states and 18051 transitions. [2020-10-25 19:39:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-25 19:39:08,467 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:08,467 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] [2020-10-25 19:39:08,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-25 19:39:08,468 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:08,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:08,468 INFO L82 PathProgramCache]: Analyzing trace with hash 302847083, now seen corresponding path program 1 times [2020-10-25 19:39:08,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:08,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654233977] [2020-10-25 19:39:08,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:08,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654233977] [2020-10-25 19:39:08,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:08,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:08,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517665167] [2020-10-25 19:39:08,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:08,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:08,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:08,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:08,500 INFO L87 Difference]: Start difference. First operand 13317 states and 18051 transitions. Second operand 3 states. [2020-10-25 19:39:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:08,708 INFO L93 Difference]: Finished difference Result 30473 states and 41349 transitions. [2020-10-25 19:39:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:08,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-10-25 19:39:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:08,743 INFO L225 Difference]: With dead ends: 30473 [2020-10-25 19:39:08,744 INFO L226 Difference]: Without dead ends: 17415 [2020-10-25 19:39:08,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:08,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2020-10-25 19:39:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 17413. [2020-10-25 19:39:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17413 states. [2020-10-25 19:39:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17413 states to 17413 states and 23299 transitions. [2020-10-25 19:39:09,317 INFO L78 Accepts]: Start accepts. Automaton has 17413 states and 23299 transitions. Word has length 27 [2020-10-25 19:39:09,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:09,317 INFO L481 AbstractCegarLoop]: Abstraction has 17413 states and 23299 transitions. [2020-10-25 19:39:09,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 17413 states and 23299 transitions. [2020-10-25 19:39:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-25 19:39:09,339 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:09,339 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:09,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-25 19:39:09,340 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:09,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:09,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1819608763, now seen corresponding path program 1 times [2020-10-25 19:39:09,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:09,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843196749] [2020-10-25 19:39:09,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:09,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843196749] [2020-10-25 19:39:09,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:09,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:09,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51096851] [2020-10-25 19:39:09,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:09,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:09,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:09,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:09,382 INFO L87 Difference]: Start difference. First operand 17413 states and 23299 transitions. Second operand 3 states. [2020-10-25 19:39:09,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:09,650 INFO L93 Difference]: Finished difference Result 26121 states and 34821 transitions. [2020-10-25 19:39:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:09,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-10-25 19:39:09,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:09,689 INFO L225 Difference]: With dead ends: 26121 [2020-10-25 19:39:09,689 INFO L226 Difference]: Without dead ends: 17671 [2020-10-25 19:39:09,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:09,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17671 states. [2020-10-25 19:39:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17671 to 17669. [2020-10-25 19:39:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17669 states. [2020-10-25 19:39:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17669 states to 17669 states and 23299 transitions. [2020-10-25 19:39:10,311 INFO L78 Accepts]: Start accepts. Automaton has 17669 states and 23299 transitions. Word has length 28 [2020-10-25 19:39:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:10,311 INFO L481 AbstractCegarLoop]: Abstraction has 17669 states and 23299 transitions. [2020-10-25 19:39:10,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 17669 states and 23299 transitions. [2020-10-25 19:39:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-25 19:39:10,331 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:10,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:10,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-25 19:39:10,332 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:10,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:10,333 INFO L82 PathProgramCache]: Analyzing trace with hash 798540409, now seen corresponding path program 1 times [2020-10-25 19:39:10,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:10,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227985182] [2020-10-25 19:39:10,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:10,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227985182] [2020-10-25 19:39:10,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:10,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:10,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708776046] [2020-10-25 19:39:10,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:10,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:10,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:10,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:10,360 INFO L87 Difference]: Start difference. First operand 17669 states and 23299 transitions. Second operand 3 states. [2020-10-25 19:39:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:10,809 INFO L93 Difference]: Finished difference Result 29705 states and 39685 transitions. [2020-10-25 19:39:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:10,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-10-25 19:39:10,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:10,867 INFO L225 Difference]: With dead ends: 29705 [2020-10-25 19:39:10,867 INFO L226 Difference]: Without dead ends: 29703 [2020-10-25 19:39:10,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29703 states. [2020-10-25 19:39:11,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29703 to 26629. [2020-10-25 19:39:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26629 states. [2020-10-25 19:39:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26629 states to 26629 states and 34051 transitions. [2020-10-25 19:39:11,468 INFO L78 Accepts]: Start accepts. Automaton has 26629 states and 34051 transitions. Word has length 28 [2020-10-25 19:39:11,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:11,469 INFO L481 AbstractCegarLoop]: Abstraction has 26629 states and 34051 transitions. [2020-10-25 19:39:11,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:11,469 INFO L276 IsEmpty]: Start isEmpty. Operand 26629 states and 34051 transitions. [2020-10-25 19:39:11,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-25 19:39:11,496 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:11,496 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:39:11,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-25 19:39:11,497 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:11,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:11,497 INFO L82 PathProgramCache]: Analyzing trace with hash -481323269, now seen corresponding path program 1 times [2020-10-25 19:39:11,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:11,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831239296] [2020-10-25 19:39:11,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:11,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831239296] [2020-10-25 19:39:11,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:11,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:11,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372265176] [2020-10-25 19:39:11,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:11,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:11,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:11,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:11,518 INFO L87 Difference]: Start difference. First operand 26629 states and 34051 transitions. Second operand 3 states. [2020-10-25 19:39:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:12,165 INFO L93 Difference]: Finished difference Result 60425 states and 77061 transitions. [2020-10-25 19:39:12,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:12,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-10-25 19:39:12,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:12,229 INFO L225 Difference]: With dead ends: 60425 [2020-10-25 19:39:12,229 INFO L226 Difference]: Without dead ends: 34311 [2020-10-25 19:39:12,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34311 states. [2020-10-25 19:39:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34311 to 34309. [2020-10-25 19:39:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34309 states. [2020-10-25 19:39:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34309 states to 34309 states and 43011 transitions. [2020-10-25 19:39:13,171 INFO L78 Accepts]: Start accepts. Automaton has 34309 states and 43011 transitions. Word has length 28 [2020-10-25 19:39:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:13,171 INFO L481 AbstractCegarLoop]: Abstraction has 34309 states and 43011 transitions. [2020-10-25 19:39:13,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 34309 states and 43011 transitions. [2020-10-25 19:39:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-25 19:39:13,197 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:13,197 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] [2020-10-25 19:39:13,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-25 19:39:13,198 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:13,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:13,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1014835328, now seen corresponding path program 1 times [2020-10-25 19:39:13,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:13,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149358075] [2020-10-25 19:39:13,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:13,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149358075] [2020-10-25 19:39:13,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:13,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:13,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275532895] [2020-10-25 19:39:13,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:13,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:13,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:13,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:13,230 INFO L87 Difference]: Start difference. First operand 34309 states and 43011 transitions. Second operand 3 states. [2020-10-25 19:39:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:13,710 INFO L93 Difference]: Finished difference Result 51465 states and 64261 transitions. [2020-10-25 19:39:13,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:13,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-10-25 19:39:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:13,754 INFO L225 Difference]: With dead ends: 51465 [2020-10-25 19:39:13,754 INFO L226 Difference]: Without dead ends: 34823 [2020-10-25 19:39:13,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34823 states. [2020-10-25 19:39:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34823 to 34821. [2020-10-25 19:39:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34821 states. [2020-10-25 19:39:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 43011 transitions. [2020-10-25 19:39:14,629 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 43011 transitions. Word has length 29 [2020-10-25 19:39:14,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:14,630 INFO L481 AbstractCegarLoop]: Abstraction has 34821 states and 43011 transitions. [2020-10-25 19:39:14,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 43011 transitions. [2020-10-25 19:39:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-25 19:39:14,823 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:14,828 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] [2020-10-25 19:39:14,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-25 19:39:14,829 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:14,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:14,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2035903682, now seen corresponding path program 1 times [2020-10-25 19:39:14,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:14,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183545350] [2020-10-25 19:39:14,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:14,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-10-25 19:39:14,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183545350] [2020-10-25 19:39:14,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:14,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:14,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772782243] [2020-10-25 19:39:14,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:14,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:14,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:14,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:14,862 INFO L87 Difference]: Start difference. First operand 34821 states and 43011 transitions. Second operand 3 states. [2020-10-25 19:39:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:15,422 INFO L93 Difference]: Finished difference Result 101385 states and 122885 transitions. [2020-10-25 19:39:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:15,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-10-25 19:39:15,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:15,684 INFO L225 Difference]: With dead ends: 101385 [2020-10-25 19:39:15,685 INFO L226 Difference]: Without dead ends: 67591 [2020-10-25 19:39:15,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67591 states. [2020-10-25 19:39:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67591 to 67589. [2020-10-25 19:39:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67589 states. [2020-10-25 19:39:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 79875 transitions. [2020-10-25 19:39:17,038 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 79875 transitions. Word has length 29 [2020-10-25 19:39:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:17,038 INFO L481 AbstractCegarLoop]: Abstraction has 67589 states and 79875 transitions. [2020-10-25 19:39:17,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 79875 transitions. [2020-10-25 19:39:17,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-25 19:39:17,369 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:17,369 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] [2020-10-25 19:39:17,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-25 19:39:17,370 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash -756040004, now seen corresponding path program 1 times [2020-10-25 19:39:17,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:17,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639504448] [2020-10-25 19:39:17,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:17,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639504448] [2020-10-25 19:39:17,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:17,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:17,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148326943] [2020-10-25 19:39:17,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:17,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:17,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:17,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:17,430 INFO L87 Difference]: Start difference. First operand 67589 states and 79875 transitions. Second operand 3 states. [2020-10-25 19:39:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:18,180 INFO L93 Difference]: Finished difference Result 71689 states and 86021 transitions. [2020-10-25 19:39:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:18,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-10-25 19:39:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:18,249 INFO L225 Difference]: With dead ends: 71689 [2020-10-25 19:39:18,250 INFO L226 Difference]: Without dead ends: 71687 [2020-10-25 19:39:18,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71687 states. [2020-10-25 19:39:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71687 to 67589. [2020-10-25 19:39:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67589 states. [2020-10-25 19:39:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 78851 transitions. [2020-10-25 19:39:19,627 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 78851 transitions. Word has length 29 [2020-10-25 19:39:19,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:19,627 INFO L481 AbstractCegarLoop]: Abstraction has 67589 states and 78851 transitions. [2020-10-25 19:39:19,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:19,627 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 78851 transitions. [2020-10-25 19:39:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 19:39:19,662 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:19,662 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] [2020-10-25 19:39:19,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-25 19:39:19,662 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:19,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:19,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1311711408, now seen corresponding path program 1 times [2020-10-25 19:39:19,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:19,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069459094] [2020-10-25 19:39:19,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:19,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069459094] [2020-10-25 19:39:19,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:19,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:19,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130057583] [2020-10-25 19:39:19,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:19,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:19,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:19,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:19,689 INFO L87 Difference]: Start difference. First operand 67589 states and 78851 transitions. Second operand 3 states. [2020-10-25 19:39:20,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:20,762 INFO L93 Difference]: Finished difference Result 109575 states and 126980 transitions. [2020-10-25 19:39:20,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:20,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-10-25 19:39:20,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:20,893 INFO L225 Difference]: With dead ends: 109575 [2020-10-25 19:39:20,894 INFO L226 Difference]: Without dead ends: 109573 [2020-10-25 19:39:20,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:20,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109573 states. [2020-10-25 19:39:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109573 to 105477. [2020-10-25 19:39:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105477 states. [2020-10-25 19:39:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105477 states to 105477 states and 120835 transitions. [2020-10-25 19:39:22,925 INFO L78 Accepts]: Start accepts. Automaton has 105477 states and 120835 transitions. Word has length 30 [2020-10-25 19:39:22,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:22,925 INFO L481 AbstractCegarLoop]: Abstraction has 105477 states and 120835 transitions. [2020-10-25 19:39:22,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 105477 states and 120835 transitions. [2020-10-25 19:39:23,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 19:39:23,000 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:39:23,000 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] [2020-10-25 19:39:23,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-25 19:39:23,001 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:39:23,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:39:23,002 INFO L82 PathProgramCache]: Analyzing trace with hash 31847730, now seen corresponding path program 1 times [2020-10-25 19:39:23,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:39:23,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916750413] [2020-10-25 19:39:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:39:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:39:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:39:23,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916750413] [2020-10-25 19:39:23,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:39:23,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:39:23,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528297755] [2020-10-25 19:39:23,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:39:23,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:39:23,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:39:23,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:23,029 INFO L87 Difference]: Start difference. First operand 105477 states and 120835 transitions. Second operand 3 states. [2020-10-25 19:39:25,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:39:25,110 INFO L93 Difference]: Finished difference Result 236549 states and 268291 transitions. [2020-10-25 19:39:25,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:39:25,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-10-25 19:39:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:39:25,111 INFO L225 Difference]: With dead ends: 236549 [2020-10-25 19:39:25,111 INFO L226 Difference]: Without dead ends: 0 [2020-10-25 19:39:25,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:39:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-25 19:39:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-25 19:39:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-25 19:39:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-25 19:39:25,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2020-10-25 19:39:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:39:25,220 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-25 19:39:25,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:39:25,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-25 19:39:25,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-25 19:39:25,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-25 19:39:25,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-25 19:39:25,270 INFO L274 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2020-10-25 19:39:25,270 INFO L270 CegarLoopResult]: At program point L184-1(lines 7 193) the Hoare annotation is: false [2020-10-25 19:39:25,270 INFO L274 CegarLoopResult]: For program point L118-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,270 INFO L274 CegarLoopResult]: For program point L168-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,270 INFO L274 CegarLoopResult]: For program point L102-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,271 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-25 19:39:25,271 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-25 19:39:25,271 INFO L274 CegarLoopResult]: For program point L86-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,271 INFO L274 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2020-10-25 19:39:25,271 INFO L274 CegarLoopResult]: For program point L153-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,271 INFO L274 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2020-10-25 19:39:25,271 INFO L274 CegarLoopResult]: For program point L138-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,271 INFO L274 CegarLoopResult]: For program point L122-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,271 INFO L274 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2020-10-25 19:39:25,271 INFO L274 CegarLoopResult]: For program point L106-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,272 INFO L277 CegarLoopResult]: At program point L189(lines 7 193) the Hoare annotation is: true [2020-10-25 19:39:25,272 INFO L274 CegarLoopResult]: For program point L90-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,272 INFO L274 CegarLoopResult]: For program point L173-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,272 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-25 19:39:25,272 INFO L274 CegarLoopResult]: For program point L174(line 174) no Hoare annotation was computed. [2020-10-25 19:39:25,272 INFO L274 CegarLoopResult]: For program point L158-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,272 INFO L277 CegarLoopResult]: At program point L192(lines 6 193) the Hoare annotation is: true [2020-10-25 19:39:25,272 INFO L274 CegarLoopResult]: For program point L159(line 159) no Hoare annotation was computed. [2020-10-25 19:39:25,272 INFO L274 CegarLoopResult]: For program point L143-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,272 INFO L274 CegarLoopResult]: For program point L110-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,272 INFO L274 CegarLoopResult]: For program point L94-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,273 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-25 19:39:25,273 INFO L274 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2020-10-25 19:39:25,273 INFO L274 CegarLoopResult]: For program point L78(lines 78 80) no Hoare annotation was computed. [2020-10-25 19:39:25,273 INFO L274 CegarLoopResult]: For program point L78-2(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,273 INFO L274 CegarLoopResult]: For program point L128-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,274 INFO L274 CegarLoopResult]: For program point L178-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,274 INFO L274 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2020-10-25 19:39:25,274 INFO L274 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2020-10-25 19:39:25,275 INFO L274 CegarLoopResult]: For program point L163-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,275 INFO L274 CegarLoopResult]: For program point L114-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,275 INFO L274 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2020-10-25 19:39:25,275 INFO L274 CegarLoopResult]: For program point L98-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,275 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-25 19:39:25,276 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-25 19:39:25,276 INFO L274 CegarLoopResult]: For program point L148-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,276 INFO L274 CegarLoopResult]: For program point L49(lines 49 51) no Hoare annotation was computed. [2020-10-25 19:39:25,276 INFO L274 CegarLoopResult]: For program point L82-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,276 INFO L274 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-10-25 19:39:25,276 INFO L274 CegarLoopResult]: For program point L133-1(lines 47 188) no Hoare annotation was computed. [2020-10-25 19:39:25,277 INFO L277 CegarLoopResult]: At program point L183-1(lines 47 188) the Hoare annotation is: true [2020-10-25 19:39:25,277 INFO L274 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-10-25 19:39:25,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 07:39:25 BoogieIcfgContainer [2020-10-25 19:39:25,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 19:39:25,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 19:39:25,292 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 19:39:25,292 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 19:39:25,293 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:39:02" (3/4) ... [2020-10-25 19:39:25,296 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-25 19:39:25,312 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-25 19:39:25,313 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-25 19:39:25,313 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 19:39:25,314 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 19:39:25,400 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 19:39:25,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 19:39:25,403 INFO L168 Benchmark]: Toolchain (without parser) took 23672.75 ms. Allocated memory was 41.9 MB in the beginning and 12.6 GB in the end (delta: 12.6 GB). Free memory was 20.0 MB in the beginning and 11.4 GB in the end (delta: -11.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 16.1 GB. [2020-10-25 19:39:25,403 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 41.9 MB. Free memory was 22.6 MB in the beginning and 22.5 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:39:25,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.93 ms. Allocated memory is still 41.9 MB. Free memory was 19.4 MB in the beginning and 18.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:25,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.16 ms. Allocated memory is still 41.9 MB. Free memory was 18.2 MB in the beginning and 16.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:25,404 INFO L168 Benchmark]: Boogie Preprocessor took 44.11 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 16.4 MB in the beginning and 37.2 MB in the end (delta: -20.8 MB). Peak memory consumption was 3.0 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:25,405 INFO L168 Benchmark]: RCFGBuilder took 584.04 ms. Allocated memory is still 52.4 MB. Free memory was 37.2 MB in the beginning and 27.7 MB in the end (delta: 9.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:25,405 INFO L168 Benchmark]: TraceAbstraction took 22561.63 ms. Allocated memory was 52.4 MB in the beginning and 12.6 GB in the end (delta: 12.6 GB). Free memory was 27.3 MB in the beginning and 11.4 GB in the end (delta: -11.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 16.1 GB. [2020-10-25 19:39:25,406 INFO L168 Benchmark]: Witness Printer took 109.04 ms. Allocated memory is still 12.6 GB. Free memory was 11.4 GB in the beginning and 11.4 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 19:39:25,409 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.36 ms. Allocated memory is still 41.9 MB. Free memory was 22.6 MB in the beginning and 22.5 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 311.93 ms. Allocated memory is still 41.9 MB. Free memory was 19.4 MB in the beginning and 18.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.16 ms. Allocated memory is still 41.9 MB. Free memory was 18.2 MB in the beginning and 16.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.11 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 16.4 MB in the beginning and 37.2 MB in the end (delta: -20.8 MB). Peak memory consumption was 3.0 MB. Max. memory is 16.1 GB. * RCFGBuilder took 584.04 ms. Allocated memory is still 52.4 MB. Free memory was 37.2 MB in the beginning and 27.7 MB in the end (delta: 9.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 22561.63 ms. Allocated memory was 52.4 MB in the beginning and 12.6 GB in the end (delta: 12.6 GB). Free memory was 27.3 MB in the beginning and 11.4 GB in the end (delta: -11.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 16.1 GB. * Witness Printer took 109.04 ms. Allocated memory is still 12.6 GB. Free memory was 11.4 GB in the beginning and 11.4 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 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: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 22.4s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3231 SDtfs, 1629 SDslu, 2174 SDs, 0 SdLazy, 175 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105477occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4105 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 811 NumberOfCodeBlocks, 811 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 778 ConstructedInterpolants, 0 QuantifiedInterpolants, 40508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...