./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-2.i --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/forester-heap/sll-01-2.i -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 2ea18b6ba0d977117db11fbdff34c486def646c3 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 22:07:29,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 22:07:29,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 22:07:29,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 22:07:29,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 22:07:29,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 22:07:29,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 22:07:29,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 22:07:29,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 22:07:29,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 22:07:29,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 22:07:29,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 22:07:29,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 22:07:29,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 22:07:29,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 22:07:29,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 22:07:29,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 22:07:29,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 22:07:29,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 22:07:29,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 22:07:29,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 22:07:29,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 22:07:29,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 22:07:29,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 22:07:29,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 22:07:29,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 22:07:29,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 22:07:29,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 22:07:29,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 22:07:29,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 22:07:29,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 22:07:29,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 22:07:29,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 22:07:29,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 22:07:29,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 22:07:29,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 22:07:29,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 22:07:29,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 22:07:29,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 22:07:29,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 22:07:29,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 22:07:29,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 22:07:29,386 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 22:07:29,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 22:07:29,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 22:07:29,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 22:07:29,390 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 22:07:29,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 22:07:29,391 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 22:07:29,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 22:07:29,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 22:07:29,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 22:07:29,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 22:07:29,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 22:07:29,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 22:07:29,393 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 22:07:29,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 22:07:29,394 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 22:07:29,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 22:07:29,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 22:07:29,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 22:07:29,395 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 22:07:29,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 22:07:29,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:07:29,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 22:07:29,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 22:07:29,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 22:07:29,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 22:07:29,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 22:07:29,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 22:07:29,398 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 22:07:29,398 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 -> 2ea18b6ba0d977117db11fbdff34c486def646c3 [2020-10-25 22:07:29,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 22:07:29,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 22:07:29,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 22:07:29,924 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 22:07:29,925 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 22:07:29,926 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2020-10-25 22:07:30,020 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b49d4abc/9cb7b55c2e4443de8f175a708ef5495e/FLAG3f93dca38 [2020-10-25 22:07:30,659 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 22:07:30,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2020-10-25 22:07:30,678 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b49d4abc/9cb7b55c2e4443de8f175a708ef5495e/FLAG3f93dca38 [2020-10-25 22:07:30,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b49d4abc/9cb7b55c2e4443de8f175a708ef5495e [2020-10-25 22:07:30,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 22:07:30,958 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 22:07:30,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 22:07:30,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 22:07:30,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 22:07:30,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:07:30" (1/1) ... [2020-10-25 22:07:30,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b559629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:07:30, skipping insertion in model container [2020-10-25 22:07:30,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:07:30" (1/1) ... [2020-10-25 22:07:30,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 22:07:31,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 22:07:31,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:07:31,500 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 22:07:31,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:07:31,630 INFO L208 MainTranslator]: Completed translation [2020-10-25 22:07:31,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:07:31 WrapperNode [2020-10-25 22:07:31,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 22:07:31,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 22:07:31,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 22:07:31,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 22:07:31,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:07:31" (1/1) ... [2020-10-25 22:07:31,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:07:31" (1/1) ... [2020-10-25 22:07:31,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 22:07:31,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 22:07:31,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 22:07:31,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 22:07:31,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:07:31" (1/1) ... [2020-10-25 22:07:31,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:07:31" (1/1) ... [2020-10-25 22:07:31,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:07:31" (1/1) ... [2020-10-25 22:07:31,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:07:31" (1/1) ... [2020-10-25 22:07:31,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:07:31" (1/1) ... [2020-10-25 22:07:31,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:07:31" (1/1) ... [2020-10-25 22:07:31,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:07:31" (1/1) ... [2020-10-25 22:07:31,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 22:07:31,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 22:07:31,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 22:07:31,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 22:07:31,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:07:31" (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 22:07:31,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-25 22:07:31,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-25 22:07:31,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 22:07:31,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-25 22:07:31,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-25 22:07:31,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 22:07:31,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 22:07:31,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 22:07:32,639 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 22:07:32,641 INFO L298 CfgBuilder]: Removed 60 assume(true) statements. [2020-10-25 22:07:32,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:07:32 BoogieIcfgContainer [2020-10-25 22:07:32,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 22:07:32,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 22:07:32,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 22:07:32,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 22:07:32,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 10:07:30" (1/3) ... [2020-10-25 22:07:32,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34920fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:07:32, skipping insertion in model container [2020-10-25 22:07:32,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:07:31" (2/3) ... [2020-10-25 22:07:32,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34920fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:07:32, skipping insertion in model container [2020-10-25 22:07:32,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:07:32" (3/3) ... [2020-10-25 22:07:32,654 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2020-10-25 22:07:32,668 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 22:07:32,674 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-10-25 22:07:32,689 INFO L253 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-10-25 22:07:32,728 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 22:07:32,728 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 22:07:32,728 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 22:07:32,728 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 22:07:32,728 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 22:07:32,728 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 22:07:32,728 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 22:07:32,729 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 22:07:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2020-10-25 22:07:32,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-25 22:07:32,754 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:32,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-25 22:07:32,756 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:32,762 INFO L82 PathProgramCache]: Analyzing trace with hash 28696838, now seen corresponding path program 1 times [2020-10-25 22:07:32,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:32,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223163046] [2020-10-25 22:07:32,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:32,961 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 22:07:32,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223163046] [2020-10-25 22:07:32,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:32,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:07:32,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466566081] [2020-10-25 22:07:32,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:07:32,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:32,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:07:32,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:07:32,982 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 3 states. [2020-10-25 22:07:33,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:33,069 INFO L93 Difference]: Finished difference Result 223 states and 369 transitions. [2020-10-25 22:07:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:07:33,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-25 22:07:33,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:33,083 INFO L225 Difference]: With dead ends: 223 [2020-10-25 22:07:33,083 INFO L226 Difference]: Without dead ends: 111 [2020-10-25 22:07:33,087 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 22:07:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-25 22:07:33,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2020-10-25 22:07:33,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-25 22:07:33,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2020-10-25 22:07:33,160 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 5 [2020-10-25 22:07:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:33,160 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2020-10-25 22:07:33,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:07:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2020-10-25 22:07:33,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 22:07:33,162 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:33,162 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:07:33,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 22:07:33,163 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:33,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:33,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1244560352, now seen corresponding path program 1 times [2020-10-25 22:07:33,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:33,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471026675] [2020-10-25 22:07:33,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:33,264 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 22:07:33,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471026675] [2020-10-25 22:07:33,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:33,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:07:33,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989781049] [2020-10-25 22:07:33,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:07:33,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:33,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:07:33,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:07:33,268 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 3 states. [2020-10-25 22:07:33,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:33,294 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2020-10-25 22:07:33,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:07:33,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-25 22:07:33,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:33,296 INFO L225 Difference]: With dead ends: 94 [2020-10-25 22:07:33,297 INFO L226 Difference]: Without dead ends: 91 [2020-10-25 22:07:33,298 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 22:07:33,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-25 22:07:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-10-25 22:07:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-25 22:07:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2020-10-25 22:07:33,308 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 11 [2020-10-25 22:07:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:33,308 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2020-10-25 22:07:33,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:07:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2020-10-25 22:07:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 22:07:33,309 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:33,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:07:33,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 22:07:33,310 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:33,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1244619934, now seen corresponding path program 1 times [2020-10-25 22:07:33,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:33,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038514205] [2020-10-25 22:07:33,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:33,410 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 22:07:33,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038514205] [2020-10-25 22:07:33,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:33,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:07:33,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782429781] [2020-10-25 22:07:33,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:07:33,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:33,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:07:33,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:07:33,413 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 4 states. [2020-10-25 22:07:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:33,491 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2020-10-25 22:07:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:07:33,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-25 22:07:33,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:33,493 INFO L225 Difference]: With dead ends: 92 [2020-10-25 22:07:33,494 INFO L226 Difference]: Without dead ends: 89 [2020-10-25 22:07:33,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:07:33,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-25 22:07:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2020-10-25 22:07:33,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-25 22:07:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2020-10-25 22:07:33,503 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 11 [2020-10-25 22:07:33,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:33,504 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2020-10-25 22:07:33,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:07:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2020-10-25 22:07:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-25 22:07:33,505 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:33,505 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:07:33,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 22:07:33,505 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:33,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:33,506 INFO L82 PathProgramCache]: Analyzing trace with hash -394307937, now seen corresponding path program 1 times [2020-10-25 22:07:33,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:33,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318298839] [2020-10-25 22:07:33,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:33,599 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 22:07:33,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318298839] [2020-10-25 22:07:33,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:33,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:07:33,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266408090] [2020-10-25 22:07:33,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:07:33,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:33,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:07:33,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:07:33,603 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 3 states. [2020-10-25 22:07:33,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:33,662 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2020-10-25 22:07:33,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:07:33,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-25 22:07:33,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:33,664 INFO L225 Difference]: With dead ends: 90 [2020-10-25 22:07:33,664 INFO L226 Difference]: Without dead ends: 84 [2020-10-25 22:07:33,665 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 22:07:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-25 22:07:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2020-10-25 22:07:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-25 22:07:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2020-10-25 22:07:33,681 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 16 [2020-10-25 22:07:33,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:33,682 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2020-10-25 22:07:33,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:07:33,682 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2020-10-25 22:07:33,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-25 22:07:33,683 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:33,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:07:33,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 22:07:33,684 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:33,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:33,685 INFO L82 PathProgramCache]: Analyzing trace with hash 662126649, now seen corresponding path program 1 times [2020-10-25 22:07:33,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:33,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523785637] [2020-10-25 22:07:33,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:33,763 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 22:07:33,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523785637] [2020-10-25 22:07:33,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:33,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:07:33,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668394263] [2020-10-25 22:07:33,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:07:33,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:33,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:07:33,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:07:33,766 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 4 states. [2020-10-25 22:07:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:33,870 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2020-10-25 22:07:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:07:33,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-25 22:07:33,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:33,872 INFO L225 Difference]: With dead ends: 151 [2020-10-25 22:07:33,872 INFO L226 Difference]: Without dead ends: 127 [2020-10-25 22:07:33,873 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:07:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-25 22:07:33,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 79. [2020-10-25 22:07:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-25 22:07:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2020-10-25 22:07:33,881 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 17 [2020-10-25 22:07:33,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:33,881 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2020-10-25 22:07:33,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:07:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2020-10-25 22:07:33,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-25 22:07:33,882 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:33,883 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 22:07:33,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 22:07:33,883 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:33,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:33,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1970937841, now seen corresponding path program 1 times [2020-10-25 22:07:33,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:33,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206526045] [2020-10-25 22:07:33,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:33,946 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 22:07:33,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206526045] [2020-10-25 22:07:33,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:33,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:07:33,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538638676] [2020-10-25 22:07:33,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:07:33,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:33,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:07:33,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:07:33,951 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 3 states. [2020-10-25 22:07:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:33,987 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2020-10-25 22:07:33,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:07:33,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-25 22:07:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:33,989 INFO L225 Difference]: With dead ends: 155 [2020-10-25 22:07:33,989 INFO L226 Difference]: Without dead ends: 106 [2020-10-25 22:07:33,991 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 22:07:33,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-25 22:07:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2020-10-25 22:07:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-25 22:07:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2020-10-25 22:07:34,011 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 21 [2020-10-25 22:07:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:34,012 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2020-10-25 22:07:34,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:07:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2020-10-25 22:07:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-25 22:07:34,013 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:34,013 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 22:07:34,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 22:07:34,014 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:34,014 INFO L82 PathProgramCache]: Analyzing trace with hash 968549259, now seen corresponding path program 1 times [2020-10-25 22:07:34,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:34,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845216680] [2020-10-25 22:07:34,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:34,096 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 22:07:34,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845216680] [2020-10-25 22:07:34,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:34,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:07:34,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239903704] [2020-10-25 22:07:34,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:07:34,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:34,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:07:34,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:07:34,099 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 3 states. [2020-10-25 22:07:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:34,117 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2020-10-25 22:07:34,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:07:34,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-10-25 22:07:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:34,118 INFO L225 Difference]: With dead ends: 82 [2020-10-25 22:07:34,118 INFO L226 Difference]: Without dead ends: 79 [2020-10-25 22:07:34,119 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 22:07:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-25 22:07:34,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-25 22:07:34,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-25 22:07:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2020-10-25 22:07:34,125 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 22 [2020-10-25 22:07:34,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:34,125 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2020-10-25 22:07:34,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:07:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2020-10-25 22:07:34,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 22:07:34,126 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:34,126 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 22:07:34,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 22:07:34,127 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:34,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:34,127 INFO L82 PathProgramCache]: Analyzing trace with hash -800273617, now seen corresponding path program 1 times [2020-10-25 22:07:34,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:34,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607622681] [2020-10-25 22:07:34,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:34,170 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 22:07:34,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607622681] [2020-10-25 22:07:34,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:34,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:07:34,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571788591] [2020-10-25 22:07:34,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:07:34,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:34,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:07:34,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:07:34,172 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 3 states. [2020-10-25 22:07:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:34,187 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2020-10-25 22:07:34,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:07:34,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-25 22:07:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:34,188 INFO L225 Difference]: With dead ends: 83 [2020-10-25 22:07:34,188 INFO L226 Difference]: Without dead ends: 80 [2020-10-25 22:07:34,189 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 22:07:34,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-25 22:07:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-10-25 22:07:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-25 22:07:34,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2020-10-25 22:07:34,194 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 24 [2020-10-25 22:07:34,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:34,194 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2020-10-25 22:07:34,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:07:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2020-10-25 22:07:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 22:07:34,195 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:34,196 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 22:07:34,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 22:07:34,196 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:34,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:34,197 INFO L82 PathProgramCache]: Analyzing trace with hash -800214035, now seen corresponding path program 1 times [2020-10-25 22:07:34,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:34,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848352627] [2020-10-25 22:07:34,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:34,299 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 22:07:34,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848352627] [2020-10-25 22:07:34,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:34,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:07:34,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437638819] [2020-10-25 22:07:34,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:07:34,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:34,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:07:34,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:07:34,304 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 4 states. [2020-10-25 22:07:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:34,408 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2020-10-25 22:07:34,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:07:34,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-25 22:07:34,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:34,409 INFO L225 Difference]: With dead ends: 81 [2020-10-25 22:07:34,409 INFO L226 Difference]: Without dead ends: 78 [2020-10-25 22:07:34,413 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:07:34,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-25 22:07:34,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-10-25 22:07:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-25 22:07:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2020-10-25 22:07:34,422 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 24 [2020-10-25 22:07:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:34,423 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2020-10-25 22:07:34,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:07:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2020-10-25 22:07:34,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 22:07:34,425 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:34,425 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 22:07:34,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 22:07:34,426 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:34,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:34,426 INFO L82 PathProgramCache]: Analyzing trace with hash 785556314, now seen corresponding path program 1 times [2020-10-25 22:07:34,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:34,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252210334] [2020-10-25 22:07:34,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:34,772 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 22:07:34,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252210334] [2020-10-25 22:07:34,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:34,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-25 22:07:34,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038543056] [2020-10-25 22:07:34,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 22:07:34,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:34,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 22:07:34,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:07:34,775 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 7 states. [2020-10-25 22:07:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:35,348 INFO L93 Difference]: Finished difference Result 246 states and 273 transitions. [2020-10-25 22:07:35,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-25 22:07:35,349 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-10-25 22:07:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:35,352 INFO L225 Difference]: With dead ends: 246 [2020-10-25 22:07:35,352 INFO L226 Difference]: Without dead ends: 243 [2020-10-25 22:07:35,353 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-10-25 22:07:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-10-25 22:07:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 93. [2020-10-25 22:07:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-25 22:07:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2020-10-25 22:07:35,361 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 25 [2020-10-25 22:07:35,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:35,361 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2020-10-25 22:07:35,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 22:07:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2020-10-25 22:07:35,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 22:07:35,362 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:35,362 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 22:07:35,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 22:07:35,363 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:35,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:35,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1603204764, now seen corresponding path program 1 times [2020-10-25 22:07:35,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:35,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064499245] [2020-10-25 22:07:35,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:35,399 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 22:07:35,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064499245] [2020-10-25 22:07:35,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:35,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:07:35,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809410950] [2020-10-25 22:07:35,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:07:35,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:35,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:07:35,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:07:35,401 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 4 states. [2020-10-25 22:07:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:35,524 INFO L93 Difference]: Finished difference Result 216 states and 246 transitions. [2020-10-25 22:07:35,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:07:35,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-25 22:07:35,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:35,525 INFO L225 Difference]: With dead ends: 216 [2020-10-25 22:07:35,525 INFO L226 Difference]: Without dead ends: 148 [2020-10-25 22:07:35,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:07:35,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-10-25 22:07:35,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 93. [2020-10-25 22:07:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-25 22:07:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2020-10-25 22:07:35,532 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 25 [2020-10-25 22:07:35,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:35,532 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2020-10-25 22:07:35,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:07:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2020-10-25 22:07:35,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 22:07:35,533 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:35,534 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 22:07:35,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 22:07:35,534 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:35,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:35,535 INFO L82 PathProgramCache]: Analyzing trace with hash -390939942, now seen corresponding path program 1 times [2020-10-25 22:07:35,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:35,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365229411] [2020-10-25 22:07:35,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:35,615 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 22:07:35,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365229411] [2020-10-25 22:07:35,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:35,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:07:35,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707005754] [2020-10-25 22:07:35,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:07:35,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:35,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:07:35,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:07:35,619 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 6 states. [2020-10-25 22:07:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:35,912 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2020-10-25 22:07:35,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 22:07:35,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-25 22:07:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:35,915 INFO L225 Difference]: With dead ends: 223 [2020-10-25 22:07:35,915 INFO L226 Difference]: Without dead ends: 169 [2020-10-25 22:07:35,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-25 22:07:35,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-10-25 22:07:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 100. [2020-10-25 22:07:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-25 22:07:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2020-10-25 22:07:35,923 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 25 [2020-10-25 22:07:35,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:35,924 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2020-10-25 22:07:35,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:07:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2020-10-25 22:07:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-25 22:07:35,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:35,933 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 22:07:35,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 22:07:35,933 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:35,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:35,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1462211504, now seen corresponding path program 1 times [2020-10-25 22:07:35,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:35,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978998980] [2020-10-25 22:07:35,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:07:35,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978998980] [2020-10-25 22:07:35,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:35,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:07:35,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729173760] [2020-10-25 22:07:35,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:07:35,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:35,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:07:35,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:07:35,978 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 3 states. [2020-10-25 22:07:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:36,043 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2020-10-25 22:07:36,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:07:36,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-10-25 22:07:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:36,044 INFO L225 Difference]: With dead ends: 100 [2020-10-25 22:07:36,044 INFO L226 Difference]: Without dead ends: 97 [2020-10-25 22:07:36,045 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 22:07:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-25 22:07:36,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-25 22:07:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-25 22:07:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2020-10-25 22:07:36,055 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 27 [2020-10-25 22:07:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:36,056 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2020-10-25 22:07:36,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:07:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2020-10-25 22:07:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-25 22:07:36,061 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:36,061 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 22:07:36,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 22:07:36,062 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:36,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:36,063 INFO L82 PathProgramCache]: Analyzing trace with hash -443744732, now seen corresponding path program 1 times [2020-10-25 22:07:36,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:36,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181753938] [2020-10-25 22:07:36,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:36,303 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 22:07:36,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181753938] [2020-10-25 22:07:36,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:36,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-25 22:07:36,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285591858] [2020-10-25 22:07:36,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 22:07:36,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:36,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 22:07:36,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:07:36,308 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand 7 states. [2020-10-25 22:07:36,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:36,807 INFO L93 Difference]: Finished difference Result 245 states and 273 transitions. [2020-10-25 22:07:36,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-25 22:07:36,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-10-25 22:07:36,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:36,809 INFO L225 Difference]: With dead ends: 245 [2020-10-25 22:07:36,809 INFO L226 Difference]: Without dead ends: 242 [2020-10-25 22:07:36,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-10-25 22:07:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-10-25 22:07:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 100. [2020-10-25 22:07:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-25 22:07:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2020-10-25 22:07:36,818 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 28 [2020-10-25 22:07:36,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:36,818 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2020-10-25 22:07:36,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 22:07:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2020-10-25 22:07:36,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 22:07:36,819 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:36,820 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 22:07:36,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 22:07:36,820 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:36,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:36,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1509598737, now seen corresponding path program 1 times [2020-10-25 22:07:36,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:36,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271089732] [2020-10-25 22:07:36,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:07:36,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271089732] [2020-10-25 22:07:36,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:36,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:07:36,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784475822] [2020-10-25 22:07:36,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:07:36,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:36,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:07:36,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:07:36,911 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 6 states. [2020-10-25 22:07:37,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:37,200 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2020-10-25 22:07:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-25 22:07:37,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-10-25 22:07:37,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:37,202 INFO L225 Difference]: With dead ends: 216 [2020-10-25 22:07:37,202 INFO L226 Difference]: Without dead ends: 170 [2020-10-25 22:07:37,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-25 22:07:37,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-10-25 22:07:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 100. [2020-10-25 22:07:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-25 22:07:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2020-10-25 22:07:37,218 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 30 [2020-10-25 22:07:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:37,218 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2020-10-25 22:07:37,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:07:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2020-10-25 22:07:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 22:07:37,221 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:37,221 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 22:07:37,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 22:07:37,222 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:37,223 INFO L82 PathProgramCache]: Analyzing trace with hash -295839597, now seen corresponding path program 1 times [2020-10-25 22:07:37,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:37,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902351114] [2020-10-25 22:07:37,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:07:37,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902351114] [2020-10-25 22:07:37,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:37,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:07:37,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033658909] [2020-10-25 22:07:37,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:07:37,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:37,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:07:37,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:07:37,324 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 5 states. [2020-10-25 22:07:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:37,478 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2020-10-25 22:07:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 22:07:37,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-10-25 22:07:37,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:37,480 INFO L225 Difference]: With dead ends: 150 [2020-10-25 22:07:37,480 INFO L226 Difference]: Without dead ends: 132 [2020-10-25 22:07:37,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:07:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-25 22:07:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2020-10-25 22:07:37,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-25 22:07:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2020-10-25 22:07:37,490 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 30 [2020-10-25 22:07:37,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:37,491 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2020-10-25 22:07:37,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:07:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2020-10-25 22:07:37,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 22:07:37,492 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:37,492 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:07:37,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 22:07:37,493 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:37,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:37,493 INFO L82 PathProgramCache]: Analyzing trace with hash 303753301, now seen corresponding path program 1 times [2020-10-25 22:07:37,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:37,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605728548] [2020-10-25 22:07:37,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-25 22:07:37,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605728548] [2020-10-25 22:07:37,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:37,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:07:37,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436095073] [2020-10-25 22:07:37,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:07:37,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:37,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:07:37,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:07:37,541 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand 5 states. [2020-10-25 22:07:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:37,714 INFO L93 Difference]: Finished difference Result 285 states and 332 transitions. [2020-10-25 22:07:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 22:07:37,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-10-25 22:07:37,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:37,716 INFO L225 Difference]: With dead ends: 285 [2020-10-25 22:07:37,716 INFO L226 Difference]: Without dead ends: 192 [2020-10-25 22:07:37,717 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:07:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-10-25 22:07:37,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 121. [2020-10-25 22:07:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-25 22:07:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2020-10-25 22:07:37,728 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 30 [2020-10-25 22:07:37,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:37,728 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2020-10-25 22:07:37,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:07:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2020-10-25 22:07:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 22:07:37,729 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:37,729 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:07:37,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 22:07:37,730 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:37,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:37,730 INFO L82 PathProgramCache]: Analyzing trace with hash 163204691, now seen corresponding path program 1 times [2020-10-25 22:07:37,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:37,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970372540] [2020-10-25 22:07:37,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:07:37,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970372540] [2020-10-25 22:07:37,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186072020] [2020-10-25 22:07:37,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:07:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:37,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-25 22:07:37,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:07:37,989 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-25 22:07:37,989 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:07:38,107 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-10-25 22:07:38,110 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:07:38,116 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-25 22:07:38,117 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:07:38,126 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:07:38,126 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:07:38,128 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2020-10-25 22:07:38,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-25 22:07:38,174 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-10-25 22:07:38,175 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:07:38,189 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:07:38,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-25 22:07:38,197 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-10-25 22:07:38,199 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:07:38,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:07:38,214 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:07:38,215 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2020-10-25 22:07:38,304 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-10-25 22:07:38,308 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:07:38,382 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:07:38,418 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:07:38,418 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2020-10-25 22:07:38,441 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:07:38,479 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:07:38,479 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:07:38,479 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2020-10-25 22:07:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:07:38,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:07:38,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2020-10-25 22:07:38,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595280686] [2020-10-25 22:07:38,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-25 22:07:38,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:38,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-25 22:07:38,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-25 22:07:38,499 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand 8 states. [2020-10-25 22:07:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:38,967 INFO L93 Difference]: Finished difference Result 218 states and 250 transitions. [2020-10-25 22:07:38,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-25 22:07:38,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-10-25 22:07:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:38,969 INFO L225 Difference]: With dead ends: 218 [2020-10-25 22:07:38,969 INFO L226 Difference]: Without dead ends: 151 [2020-10-25 22:07:38,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-25 22:07:38,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-10-25 22:07:38,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 122. [2020-10-25 22:07:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-25 22:07:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2020-10-25 22:07:38,985 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 30 [2020-10-25 22:07:38,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:38,985 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2020-10-25 22:07:38,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-25 22:07:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2020-10-25 22:07:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-25 22:07:38,986 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:38,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:07:39,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-25 22:07:39,201 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:39,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:39,202 INFO L82 PathProgramCache]: Analyzing trace with hash 241363572, now seen corresponding path program 1 times [2020-10-25 22:07:39,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:39,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579913826] [2020-10-25 22:07:39,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:07:39,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579913826] [2020-10-25 22:07:39,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:07:39,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:07:39,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279348311] [2020-10-25 22:07:39,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:07:39,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:39,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:07:39,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:07:39,245 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand 3 states. [2020-10-25 22:07:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:39,275 INFO L93 Difference]: Finished difference Result 240 states and 282 transitions. [2020-10-25 22:07:39,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:07:39,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-10-25 22:07:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:39,277 INFO L225 Difference]: With dead ends: 240 [2020-10-25 22:07:39,277 INFO L226 Difference]: Without dead ends: 178 [2020-10-25 22:07:39,278 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 22:07:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-10-25 22:07:39,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 147. [2020-10-25 22:07:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-25 22:07:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 171 transitions. [2020-10-25 22:07:39,287 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 171 transitions. Word has length 33 [2020-10-25 22:07:39,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:39,287 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 171 transitions. [2020-10-25 22:07:39,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:07:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2020-10-25 22:07:39,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-25 22:07:39,288 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:39,288 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:07:39,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-25 22:07:39,289 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:39,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:39,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1703627734, now seen corresponding path program 1 times [2020-10-25 22:07:39,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:39,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874340786] [2020-10-25 22:07:39,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:07:39,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874340786] [2020-10-25 22:07:39,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736322122] [2020-10-25 22:07:39,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:07:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:07:39,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-25 22:07:39,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:07:39,453 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-25 22:07:39,453 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:07:39,460 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:07:39,464 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-25 22:07:39,465 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:07:39,472 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:07:39,472 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:07:39,473 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-10-25 22:07:39,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-25 22:07:39,486 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-10-25 22:07:39,487 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:07:39,499 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:07:39,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-25 22:07:39,506 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-10-25 22:07:39,507 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:07:39,518 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:07:39,518 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:07:39,519 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2020-10-25 22:07:39,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-25 22:07:39,565 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2020-10-25 22:07:39,567 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:07:39,577 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:07:39,583 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-25 22:07:39,583 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2020-10-25 22:07:39,585 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:07:39,590 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:07:39,591 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:07:39,591 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-10-25 22:07:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:07:39,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:07:39,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-10-25 22:07:39,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630384896] [2020-10-25 22:07:39,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 22:07:39,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:07:39,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 22:07:39,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:07:39,603 INFO L87 Difference]: Start difference. First operand 147 states and 171 transitions. Second operand 7 states. [2020-10-25 22:07:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:07:39,997 INFO L93 Difference]: Finished difference Result 274 states and 312 transitions. [2020-10-25 22:07:39,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-25 22:07:39,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-10-25 22:07:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:07:40,000 INFO L225 Difference]: With dead ends: 274 [2020-10-25 22:07:40,000 INFO L226 Difference]: Without dead ends: 240 [2020-10-25 22:07:40,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-25 22:07:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-10-25 22:07:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 176. [2020-10-25 22:07:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-25 22:07:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 211 transitions. [2020-10-25 22:07:40,013 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 211 transitions. Word has length 33 [2020-10-25 22:07:40,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:07:40,013 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 211 transitions. [2020-10-25 22:07:40,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 22:07:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 211 transitions. [2020-10-25 22:07:40,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-25 22:07:40,014 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:07:40,015 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:07:40,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:07:40,229 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:07:40,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:07:40,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1555502369, now seen corresponding path program 1 times [2020-10-25 22:07:40,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:07:40,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706091872] [2020-10-25 22:07:40,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:07:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 22:07:40,254 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 22:07:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 22:07:40,273 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 22:07:40,302 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 22:07:40,302 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 22:07:40,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-25 22:07:40,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 10:07:40 BoogieIcfgContainer [2020-10-25 22:07:40,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 22:07:40,382 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 22:07:40,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 22:07:40,383 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 22:07:40,383 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:07:32" (3/4) ... [2020-10-25 22:07:40,386 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 22:07:40,459 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 22:07:40,460 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 22:07:40,461 INFO L168 Benchmark]: Toolchain (without parser) took 9507.80 ms. Allocated memory was 46.1 MB in the beginning and 121.6 MB in the end (delta: 75.5 MB). Free memory was 21.6 MB in the beginning and 47.6 MB in the end (delta: -26.0 MB). Peak memory consumption was 51.1 MB. Max. memory is 16.1 GB. [2020-10-25 22:07:40,461 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 46.1 MB. Free memory was 27.9 MB in the beginning and 27.9 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:07:40,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.97 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 21.0 MB in the beginning and 30.3 MB in the end (delta: -9.3 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB. [2020-10-25 22:07:40,462 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.98 ms. Allocated memory is still 56.6 MB. Free memory was 30.1 MB in the beginning and 27.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 22:07:40,463 INFO L168 Benchmark]: Boogie Preprocessor took 48.99 ms. Allocated memory is still 56.6 MB. Free memory was 27.8 MB in the beginning and 25.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 22:07:40,463 INFO L168 Benchmark]: RCFGBuilder took 893.49 ms. Allocated memory is still 56.6 MB. Free memory was 25.4 MB in the beginning and 33.1 MB in the end (delta: -7.7 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB. [2020-10-25 22:07:40,463 INFO L168 Benchmark]: TraceAbstraction took 7735.64 ms. Allocated memory was 56.6 MB in the beginning and 121.6 MB in the end (delta: 65.0 MB). Free memory was 32.8 MB in the beginning and 50.8 MB in the end (delta: -18.0 MB). Peak memory consumption was 45.9 MB. Max. memory is 16.1 GB. [2020-10-25 22:07:40,464 INFO L168 Benchmark]: Witness Printer took 77.23 ms. Allocated memory is still 121.6 MB. Free memory was 50.8 MB in the beginning and 47.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 22:07:40,468 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.29 ms. Allocated memory is still 46.1 MB. Free memory was 27.9 MB in the beginning and 27.9 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 671.97 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 21.0 MB in the beginning and 30.3 MB in the end (delta: -9.3 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 65.98 ms. Allocated memory is still 56.6 MB. Free memory was 30.1 MB in the beginning and 27.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 48.99 ms. Allocated memory is still 56.6 MB. Free memory was 27.8 MB in the beginning and 25.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 893.49 ms. Allocated memory is still 56.6 MB. Free memory was 25.4 MB in the beginning and 33.1 MB in the end (delta: -7.7 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7735.64 ms. Allocated memory was 56.6 MB in the beginning and 121.6 MB in the end (delta: 65.0 MB). Free memory was 32.8 MB in the beginning and 50.8 MB in the end (delta: -18.0 MB). Peak memory consumption was 45.9 MB. Max. memory is 16.1 GB. * Witness Printer took 77.23 ms. Allocated memory is still 121.6 MB. Free memory was 50.8 MB in the beginning and 47.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 992]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) [L1004] COND FALSE !(!(list != ((void*)0))) [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) [L1004] EXPR list->inner [L1004] list->inner->next = ((void*)0) [L1004] EXPR list->inner [L1004] list->inner->inner = ((void*)0) [L1004] EXPR list->inner [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list [L1023] COND FALSE !(!(((void*)0) != end)) [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; [L1028] EXPR end->inner [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner [L1031] COND TRUE len == 0 [L1032] len = 1 [L1035] COND FALSE !(!(((void*)0) != inner)) [L1036] EXPR inner->inner [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner [L1038] inner = inner->inner [L1039] COND TRUE len == 1 [L1040] EXPR inner->inner [L1040] inner = inner->inner [L1029] COND TRUE ((void*)0) != inner [L1031] COND FALSE !(len == 0) [L1034] len = 2 [L1035] COND FALSE !(!(((void*)0) != inner)) [L1036] EXPR inner->inner [L1036] COND TRUE !(((void*)0) == inner->inner) [L992] COND FALSE !(0) [L992] __assert_fail ("0", "sll-01-2.c", 12, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 110 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.5s, OverallIterations: 21, TraceHistogramMax: 2, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1749 SDtfs, 1984 SDslu, 2722 SDs, 0 SdLazy, 1347 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 792 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 567 NumberOfCodeBlocks, 567 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 119370 SizeOfPredicates, 13 NumberOfNonLiveVariables, 242 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 11/16 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 incorrect! Received shutdown request...