./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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/bitvector/byte_add_2-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 de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 21:52:22,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 21:52:22,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 21:52:22,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 21:52:22,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 21:52:22,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 21:52:22,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 21:52:22,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 21:52:22,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 21:52:22,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 21:52:22,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 21:52:22,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 21:52:22,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 21:52:22,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 21:52:22,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 21:52:22,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 21:52:22,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 21:52:22,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 21:52:22,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 21:52:22,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 21:52:22,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 21:52:22,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 21:52:22,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 21:52:22,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 21:52:22,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 21:52:22,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 21:52:22,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 21:52:22,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 21:52:22,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 21:52:22,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 21:52:22,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 21:52:22,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 21:52:22,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 21:52:22,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 21:52:22,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 21:52:22,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 21:52:22,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 21:52:22,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 21:52:22,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 21:52:22,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 21:52:22,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 21:52:22,362 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 21:52:22,394 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 21:52:22,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 21:52:22,395 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 21:52:22,395 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 21:52:22,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 21:52:22,396 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 21:52:22,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 21:52:22,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 21:52:22,397 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 21:52:22,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 21:52:22,398 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 21:52:22,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 21:52:22,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 21:52:22,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 21:52:22,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 21:52:22,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 21:52:22,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 21:52:22,399 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 21:52:22,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 21:52:22,400 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 21:52:22,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 21:52:22,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 21:52:22,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 21:52:22,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 21:52:22,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:52:22,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 21:52:22,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 21:52:22,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 21:52:22,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 21:52:22,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 21:52:22,410 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 21:52:22,410 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 21:52:22,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 21:52:22,411 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 -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2021-12-27 21:52:22,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 21:52:22,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 21:52:22,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 21:52:22,632 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 21:52:22,632 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 21:52:22,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2021-12-27 21:52:22,673 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1d5efa46/ffe502c2268e4ab2a971103b95ff10ac/FLAG1153cdfab [2021-12-27 21:52:23,053 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 21:52:23,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2021-12-27 21:52:23,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1d5efa46/ffe502c2268e4ab2a971103b95ff10ac/FLAG1153cdfab [2021-12-27 21:52:23,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1d5efa46/ffe502c2268e4ab2a971103b95ff10ac [2021-12-27 21:52:23,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 21:52:23,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 21:52:23,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 21:52:23,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 21:52:23,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 21:52:23,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:52:23" (1/1) ... [2021-12-27 21:52:23,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34447761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:23, skipping insertion in model container [2021-12-27 21:52:23,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:52:23" (1/1) ... [2021-12-27 21:52:23,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 21:52:23,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 21:52:23,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2021-12-27 21:52:23,643 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:52:23,648 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 21:52:23,655 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2021-12-27 21:52:23,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:52:23,676 INFO L208 MainTranslator]: Completed translation [2021-12-27 21:52:23,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:23 WrapperNode [2021-12-27 21:52:23,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 21:52:23,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 21:52:23,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 21:52:23,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 21:52:23,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:23" (1/1) ... [2021-12-27 21:52:23,686 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:23" (1/1) ... [2021-12-27 21:52:23,700 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2021-12-27 21:52:23,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 21:52:23,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 21:52:23,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 21:52:23,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 21:52:23,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:23" (1/1) ... [2021-12-27 21:52:23,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:23" (1/1) ... [2021-12-27 21:52:23,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:23" (1/1) ... [2021-12-27 21:52:23,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:23" (1/1) ... [2021-12-27 21:52:23,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:23" (1/1) ... [2021-12-27 21:52:23,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:23" (1/1) ... [2021-12-27 21:52:23,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:23" (1/1) ... [2021-12-27 21:52:23,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 21:52:23,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 21:52:23,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 21:52:23,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 21:52:23,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:23" (1/1) ... [2021-12-27 21:52:23,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:52:23,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:23,740 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-27 21:52:23,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-27 21:52:23,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 21:52:23,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 21:52:23,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 21:52:23,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 21:52:23,821 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 21:52:23,822 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 21:52:23,970 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 21:52:23,974 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 21:52:23,975 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-27 21:52:23,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:23 BoogieIcfgContainer [2021-12-27 21:52:23,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 21:52:23,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 21:52:23,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 21:52:23,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 21:52:23,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:52:23" (1/3) ... [2021-12-27 21:52:23,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f038815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:52:23, skipping insertion in model container [2021-12-27 21:52:23,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:23" (2/3) ... [2021-12-27 21:52:23,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f038815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:52:23, skipping insertion in model container [2021-12-27 21:52:23,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:23" (3/3) ... [2021-12-27 21:52:23,981 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2021-12-27 21:52:23,985 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 21:52:23,985 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 21:52:24,014 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 21:52:24,019 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 21:52:24,019 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 21:52:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-27 21:52:24,033 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:24,033 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:24,033 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:24,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:24,037 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2021-12-27 21:52:24,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:24,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404946377] [2021-12-27 21:52:24,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:24,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:24,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:24,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404946377] [2021-12-27 21:52:24,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404946377] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:24,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:24,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 21:52:24,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413698200] [2021-12-27 21:52:24,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:24,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 21:52:24,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:24,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 21:52:24,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 21:52:24,172 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:24,190 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2021-12-27 21:52:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 21:52:24,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-27 21:52:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:24,200 INFO L225 Difference]: With dead ends: 57 [2021-12-27 21:52:24,200 INFO L226 Difference]: Without dead ends: 38 [2021-12-27 21:52:24,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 21:52:24,209 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:24,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:24,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-27 21:52:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-27 21:52:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2021-12-27 21:52:24,239 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2021-12-27 21:52:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:24,241 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2021-12-27 21:52:24,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2021-12-27 21:52:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-27 21:52:24,243 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:24,243 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:24,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 21:52:24,243 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:24,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:24,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2021-12-27 21:52:24,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:24,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594767427] [2021-12-27 21:52:24,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:24,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:24,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:24,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594767427] [2021-12-27 21:52:24,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594767427] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:24,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:24,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:52:24,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827775454] [2021-12-27 21:52:24,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:24,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:52:24,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:24,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:52:24,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:24,349 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:24,455 INFO L93 Difference]: Finished difference Result 89 states and 156 transitions. [2021-12-27 21:52:24,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:52:24,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-27 21:52:24,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:24,457 INFO L225 Difference]: With dead ends: 89 [2021-12-27 21:52:24,458 INFO L226 Difference]: Without dead ends: 61 [2021-12-27 21:52:24,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:24,460 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:24,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-27 21:52:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2021-12-27 21:52:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 58 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2021-12-27 21:52:24,483 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 12 [2021-12-27 21:52:24,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:24,484 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2021-12-27 21:52:24,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2021-12-27 21:52:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-27 21:52:24,486 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:24,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:24,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-27 21:52:24,487 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1336656122, now seen corresponding path program 1 times [2021-12-27 21:52:24,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:24,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407637599] [2021-12-27 21:52:24,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:24,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:24,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 21:52:24,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:24,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407637599] [2021-12-27 21:52:24,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407637599] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:24,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:24,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:52:24,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127746735] [2021-12-27 21:52:24,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:24,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:52:24,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:24,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:52:24,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:52:24,598 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:24,739 INFO L93 Difference]: Finished difference Result 143 states and 218 transitions. [2021-12-27 21:52:24,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:52:24,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-27 21:52:24,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:24,740 INFO L225 Difference]: With dead ends: 143 [2021-12-27 21:52:24,741 INFO L226 Difference]: Without dead ends: 105 [2021-12-27 21:52:24,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:24,742 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 85 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:24,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 156 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-27 21:52:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2021-12-27 21:52:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 66 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2021-12-27 21:52:24,748 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 18 [2021-12-27 21:52:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:24,748 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2021-12-27 21:52:24,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,748 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2021-12-27 21:52:24,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-27 21:52:24,749 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:24,749 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:24,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-27 21:52:24,749 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:24,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:24,750 INFO L85 PathProgramCache]: Analyzing trace with hash -640429161, now seen corresponding path program 1 times [2021-12-27 21:52:24,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:24,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895989035] [2021-12-27 21:52:24,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:24,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 21:52:24,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:24,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895989035] [2021-12-27 21:52:24,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895989035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:24,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:24,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:52:24,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770986128] [2021-12-27 21:52:24,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:24,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:52:24,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:24,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:52:24,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:24,817 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:24,821 INFO L93 Difference]: Finished difference Result 104 states and 156 transitions. [2021-12-27 21:52:24,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:52:24,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-27 21:52:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:24,822 INFO L225 Difference]: With dead ends: 104 [2021-12-27 21:52:24,822 INFO L226 Difference]: Without dead ends: 52 [2021-12-27 21:52:24,822 INFO L932 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 [2021-12-27 21:52:24,823 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 55 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:24,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-27 21:52:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-12-27 21:52:24,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 51 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2021-12-27 21:52:24,827 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 19 [2021-12-27 21:52:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:24,828 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. [2021-12-27 21:52:24,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2021-12-27 21:52:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-27 21:52:24,828 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:24,829 INFO L514 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] [2021-12-27 21:52:24,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-27 21:52:24,829 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:24,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:24,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2021-12-27 21:52:24,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:24,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491116312] [2021-12-27 21:52:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:24,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:24,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:24,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491116312] [2021-12-27 21:52:24,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491116312] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:24,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:24,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:52:24,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707459121] [2021-12-27 21:52:24,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:24,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:52:24,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:24,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:52:24,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:24,892 INFO L87 Difference]: Start difference. First operand 52 states and 77 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:24,901 INFO L93 Difference]: Finished difference Result 73 states and 107 transitions. [2021-12-27 21:52:24,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:52:24,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-27 21:52:24,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:24,903 INFO L225 Difference]: With dead ends: 73 [2021-12-27 21:52:24,903 INFO L226 Difference]: Without dead ends: 62 [2021-12-27 21:52:24,904 INFO L932 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 [2021-12-27 21:52:24,910 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:24,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-27 21:52:24,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-12-27 21:52:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 61 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2021-12-27 21:52:24,924 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 25 [2021-12-27 21:52:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:24,925 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2021-12-27 21:52:24,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2021-12-27 21:52:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-27 21:52:24,927 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:24,927 INFO L514 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] [2021-12-27 21:52:24,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-27 21:52:24,927 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:24,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:24,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1738293938, now seen corresponding path program 1 times [2021-12-27 21:52:24,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:24,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760771370] [2021-12-27 21:52:24,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:24,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:25,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:25,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760771370] [2021-12-27 21:52:25,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760771370] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:25,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:25,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:52:25,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370262238] [2021-12-27 21:52:25,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:25,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:52:25,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:25,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:52:25,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:52:25,038 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:25,149 INFO L93 Difference]: Finished difference Result 169 states and 249 transitions. [2021-12-27 21:52:25,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:52:25,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-27 21:52:25,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:25,150 INFO L225 Difference]: With dead ends: 169 [2021-12-27 21:52:25,150 INFO L226 Difference]: Without dead ends: 121 [2021-12-27 21:52:25,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:25,151 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 82 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:25,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 150 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-27 21:52:25,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 67. [2021-12-27 21:52:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 66 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2021-12-27 21:52:25,157 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 25 [2021-12-27 21:52:25,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:25,157 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2021-12-27 21:52:25,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2021-12-27 21:52:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-27 21:52:25,158 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:25,158 INFO L514 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] [2021-12-27 21:52:25,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-27 21:52:25,158 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:25,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:25,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1125876944, now seen corresponding path program 1 times [2021-12-27 21:52:25,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:25,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117996099] [2021-12-27 21:52:25,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:25,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:25,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:25,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117996099] [2021-12-27 21:52:25,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117996099] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:25,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496550770] [2021-12-27 21:52:25,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:25,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:25,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:25,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 21:52:25,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-27 21:52:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:25,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-27 21:52:25,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:25,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:25,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:25,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496550770] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:25,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-27 21:52:25,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-27 21:52:25,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577359190] [2021-12-27 21:52:25,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:25,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:52:25,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:25,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:52:25,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:52:25,424 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:25,577 INFO L93 Difference]: Finished difference Result 153 states and 251 transitions. [2021-12-27 21:52:25,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:52:25,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-27 21:52:25,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:25,579 INFO L225 Difference]: With dead ends: 153 [2021-12-27 21:52:25,579 INFO L226 Difference]: Without dead ends: 119 [2021-12-27 21:52:25,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:52:25,579 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 37 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:25,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 59 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-27 21:52:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2021-12-27 21:52:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2021-12-27 21:52:25,585 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 26 [2021-12-27 21:52:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:25,585 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2021-12-27 21:52:25,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2021-12-27 21:52:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-27 21:52:25,586 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:25,586 INFO L514 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] [2021-12-27 21:52:25,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:25,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:25,803 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:25,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:25,803 INFO L85 PathProgramCache]: Analyzing trace with hash 801426209, now seen corresponding path program 1 times [2021-12-27 21:52:25,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:25,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201766205] [2021-12-27 21:52:25,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:25,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:25,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:25,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201766205] [2021-12-27 21:52:25,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201766205] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:25,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389003225] [2021-12-27 21:52:25,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:25,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:25,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:25,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 21:52:25,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-27 21:52:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:25,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-27 21:52:25,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 21:52:26,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:26,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389003225] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:26,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-27 21:52:26,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-27 21:52:26,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688805775] [2021-12-27 21:52:26,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:26,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:52:26,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:26,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:52:26,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:52:26,052 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:26,157 INFO L93 Difference]: Finished difference Result 244 states and 353 transitions. [2021-12-27 21:52:26,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:52:26,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-27 21:52:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:26,158 INFO L225 Difference]: With dead ends: 244 [2021-12-27 21:52:26,158 INFO L226 Difference]: Without dead ends: 161 [2021-12-27 21:52:26,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:52:26,159 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:26,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 89 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:26,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-27 21:52:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 132. [2021-12-27 21:52:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.297709923664122) internal successors, (170), 131 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:26,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 170 transitions. [2021-12-27 21:52:26,166 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 170 transitions. Word has length 32 [2021-12-27 21:52:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:26,166 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 170 transitions. [2021-12-27 21:52:26,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 170 transitions. [2021-12-27 21:52:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-27 21:52:26,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:26,167 INFO L514 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, 1] [2021-12-27 21:52:26,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:26,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-27 21:52:26,383 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:26,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:26,384 INFO L85 PathProgramCache]: Analyzing trace with hash 745678486, now seen corresponding path program 1 times [2021-12-27 21:52:26,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:26,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447268158] [2021-12-27 21:52:26,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:26,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-27 21:52:26,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:26,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447268158] [2021-12-27 21:52:26,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447268158] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:26,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836557162] [2021-12-27 21:52:26,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:26,478 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:26,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:26,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 21:52:26,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-27 21:52:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:26,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-27 21:52:26,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-27 21:52:26,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:26,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836557162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:26,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-27 21:52:26,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-27 21:52:26,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139357376] [2021-12-27 21:52:26,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:26,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:52:26,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:26,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:52:26,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:52:26,608 INFO L87 Difference]: Start difference. First operand 132 states and 170 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:26,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:26,736 INFO L93 Difference]: Finished difference Result 303 states and 418 transitions. [2021-12-27 21:52:26,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:52:26,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-27 21:52:26,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:26,737 INFO L225 Difference]: With dead ends: 303 [2021-12-27 21:52:26,737 INFO L226 Difference]: Without dead ends: 191 [2021-12-27 21:52:26,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:52:26,738 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:26,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 93 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:26,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-27 21:52:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2021-12-27 21:52:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.26875) internal successors, (203), 160 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 203 transitions. [2021-12-27 21:52:26,744 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 203 transitions. Word has length 38 [2021-12-27 21:52:26,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:26,744 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 203 transitions. [2021-12-27 21:52:26,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 203 transitions. [2021-12-27 21:52:26,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-27 21:52:26,745 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:26,745 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-12-27 21:52:26,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:26,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:26,948 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:26,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:26,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1650574969, now seen corresponding path program 1 times [2021-12-27 21:52:26,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:26,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841256939] [2021-12-27 21:52:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:26,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-27 21:52:27,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:27,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841256939] [2021-12-27 21:52:27,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841256939] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:27,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930916143] [2021-12-27 21:52:27,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:27,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:27,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:27,064 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 21:52:27,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-27 21:52:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:27,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-27 21:52:27,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-27 21:52:27,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:27,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930916143] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:27,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-27 21:52:27,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2021-12-27 21:52:27,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740519329] [2021-12-27 21:52:27,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:27,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:52:27,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:27,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:52:27,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:27,263 INFO L87 Difference]: Start difference. First operand 161 states and 203 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:27,335 INFO L93 Difference]: Finished difference Result 315 states and 407 transitions. [2021-12-27 21:52:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:52:27,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-27 21:52:27,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:27,336 INFO L225 Difference]: With dead ends: 315 [2021-12-27 21:52:27,336 INFO L226 Difference]: Without dead ends: 150 [2021-12-27 21:52:27,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:52:27,337 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 70 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:27,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 48 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-27 21:52:27,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2021-12-27 21:52:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 122 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. [2021-12-27 21:52:27,342 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 154 transitions. Word has length 44 [2021-12-27 21:52:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:27,343 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 154 transitions. [2021-12-27 21:52:27,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 154 transitions. [2021-12-27 21:52:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-27 21:52:27,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:27,344 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:27,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-27 21:52:27,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:27,559 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:27,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:27,560 INFO L85 PathProgramCache]: Analyzing trace with hash -564670639, now seen corresponding path program 1 times [2021-12-27 21:52:27,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:27,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126494870] [2021-12-27 21:52:27,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:27,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-27 21:52:27,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:27,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126494870] [2021-12-27 21:52:27,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126494870] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:27,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:27,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:52:27,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164313772] [2021-12-27 21:52:27,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:27,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:52:27,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:27,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:52:27,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:27,636 INFO L87 Difference]: Start difference. First operand 123 states and 154 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:27,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:27,800 INFO L93 Difference]: Finished difference Result 479 states and 594 transitions. [2021-12-27 21:52:27,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:52:27,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-27 21:52:27,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:27,802 INFO L225 Difference]: With dead ends: 479 [2021-12-27 21:52:27,802 INFO L226 Difference]: Without dead ends: 372 [2021-12-27 21:52:27,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:27,802 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 147 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:27,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 222 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:27,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-12-27 21:52:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 123. [2021-12-27 21:52:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 122 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. [2021-12-27 21:52:27,808 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 154 transitions. Word has length 65 [2021-12-27 21:52:27,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:27,808 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 154 transitions. [2021-12-27 21:52:27,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 154 transitions. [2021-12-27 21:52:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-27 21:52:27,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:27,809 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:27,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-27 21:52:27,809 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:27,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:27,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1543642426, now seen corresponding path program 1 times [2021-12-27 21:52:27,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:27,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550594893] [2021-12-27 21:52:27,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:27,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-27 21:52:27,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:27,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550594893] [2021-12-27 21:52:27,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550594893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:27,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:27,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:52:27,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356904791] [2021-12-27 21:52:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:27,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:52:27,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:27,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:52:27,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:27,895 INFO L87 Difference]: Start difference. First operand 123 states and 154 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:27,951 INFO L93 Difference]: Finished difference Result 384 states and 474 transitions. [2021-12-27 21:52:27,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:52:27,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-12-27 21:52:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:27,952 INFO L225 Difference]: With dead ends: 384 [2021-12-27 21:52:27,953 INFO L226 Difference]: Without dead ends: 277 [2021-12-27 21:52:27,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:27,953 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 114 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:27,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 138 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:27,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-12-27 21:52:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 185. [2021-12-27 21:52:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.266304347826087) internal successors, (233), 184 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2021-12-27 21:52:27,960 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 66 [2021-12-27 21:52:27,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:27,961 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2021-12-27 21:52:27,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:27,962 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2021-12-27 21:52:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-27 21:52:27,963 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:27,963 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:27,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-27 21:52:27,963 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:27,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1373754372, now seen corresponding path program 1 times [2021-12-27 21:52:27,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:27,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510359423] [2021-12-27 21:52:27,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:27,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-27 21:52:28,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:28,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510359423] [2021-12-27 21:52:28,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510359423] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:28,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:28,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 21:52:28,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581697966] [2021-12-27 21:52:28,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:28,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:52:28,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:28,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:52:28,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:28,055 INFO L87 Difference]: Start difference. First operand 185 states and 233 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:28,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:28,390 INFO L93 Difference]: Finished difference Result 942 states and 1171 transitions. [2021-12-27 21:52:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:52:28,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-12-27 21:52:28,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:28,393 INFO L225 Difference]: With dead ends: 942 [2021-12-27 21:52:28,393 INFO L226 Difference]: Without dead ends: 773 [2021-12-27 21:52:28,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:52:28,393 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 297 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:28,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 422 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:52:28,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2021-12-27 21:52:28,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 178. [2021-12-27 21:52:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.271186440677966) internal successors, (225), 177 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 225 transitions. [2021-12-27 21:52:28,402 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 225 transitions. Word has length 66 [2021-12-27 21:52:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:28,402 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 225 transitions. [2021-12-27 21:52:28,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 225 transitions. [2021-12-27 21:52:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-27 21:52:28,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:28,407 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:28,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-27 21:52:28,407 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:28,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1708732925, now seen corresponding path program 1 times [2021-12-27 21:52:28,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:28,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271755176] [2021-12-27 21:52:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:28,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-27 21:52:28,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:28,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271755176] [2021-12-27 21:52:28,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271755176] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:28,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393549249] [2021-12-27 21:52:28,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:28,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:28,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:28,488 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 21:52:28,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-27 21:52:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:28,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-27 21:52:28,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-27 21:52:28,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:28,868 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-27 21:52:28,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393549249] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:28,869 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:52:28,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-12-27 21:52:28,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418384426] [2021-12-27 21:52:28,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:28,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-27 21:52:28,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:28,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-27 21:52:28,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-27 21:52:28,870 INFO L87 Difference]: Start difference. First operand 178 states and 225 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:29,151 INFO L93 Difference]: Finished difference Result 848 states and 1116 transitions. [2021-12-27 21:52:29,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-27 21:52:29,151 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-12-27 21:52:29,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:29,153 INFO L225 Difference]: With dead ends: 848 [2021-12-27 21:52:29,153 INFO L226 Difference]: Without dead ends: 651 [2021-12-27 21:52:29,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:52:29,154 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 273 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:29,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 189 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:52:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2021-12-27 21:52:29,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 552. [2021-12-27 21:52:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.2885662431941924) internal successors, (710), 551 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 710 transitions. [2021-12-27 21:52:29,178 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 710 transitions. Word has length 68 [2021-12-27 21:52:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:29,179 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 710 transitions. [2021-12-27 21:52:29,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 710 transitions. [2021-12-27 21:52:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-27 21:52:29,180 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:29,180 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:29,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:29,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-27 21:52:29,397 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:29,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:29,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1373021230, now seen corresponding path program 1 times [2021-12-27 21:52:29,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:29,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178817161] [2021-12-27 21:52:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:29,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-27 21:52:29,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:29,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178817161] [2021-12-27 21:52:29,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178817161] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:29,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671084658] [2021-12-27 21:52:29,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:29,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:29,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:29,515 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 21:52:29,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-27 21:52:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:29,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-27 21:52:29,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-27 21:52:29,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-27 21:52:30,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671084658] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:30,022 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:52:30,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-12-27 21:52:30,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848814406] [2021-12-27 21:52:30,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:30,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-27 21:52:30,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:30,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-27 21:52:30,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:52:30,024 INFO L87 Difference]: Start difference. First operand 552 states and 710 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:30,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:30,242 INFO L93 Difference]: Finished difference Result 1269 states and 1592 transitions. [2021-12-27 21:52:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:52:30,243 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-12-27 21:52:30,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:30,245 INFO L225 Difference]: With dead ends: 1269 [2021-12-27 21:52:30,245 INFO L226 Difference]: Without dead ends: 740 [2021-12-27 21:52:30,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:52:30,246 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 195 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:30,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 301 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-12-27 21:52:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 497. [2021-12-27 21:52:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.2661290322580645) internal successors, (628), 496 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 628 transitions. [2021-12-27 21:52:30,271 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 628 transitions. Word has length 70 [2021-12-27 21:52:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:30,272 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 628 transitions. [2021-12-27 21:52:30,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 628 transitions. [2021-12-27 21:52:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-27 21:52:30,273 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:30,273 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:30,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-27 21:52:30,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-27 21:52:30,508 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:30,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:30,509 INFO L85 PathProgramCache]: Analyzing trace with hash 484210542, now seen corresponding path program 2 times [2021-12-27 21:52:30,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:30,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570676914] [2021-12-27 21:52:30,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:30,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-27 21:52:30,534 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-27 21:52:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-27 21:52:30,582 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-27 21:52:30,583 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-27 21:52:30,583 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-27 21:52:30,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-27 21:52:30,587 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:30,589 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-27 21:52:30,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:52:30 BoogieIcfgContainer [2021-12-27 21:52:30,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-27 21:52:30,697 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-27 21:52:30,697 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-27 21:52:30,697 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-27 21:52:30,698 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:23" (3/4) ... [2021-12-27 21:52:30,700 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-27 21:52:30,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-27 21:52:30,700 INFO L158 Benchmark]: Toolchain (without parser) took 7213.11ms. Allocated memory was 54.5MB in the beginning and 125.8MB in the end (delta: 71.3MB). Free memory was 31.5MB in the beginning and 103.5MB in the end (delta: -71.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 21:52:30,700 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 54.5MB. Free memory was 36.9MB in the beginning and 36.8MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 21:52:30,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.16ms. Allocated memory is still 54.5MB. Free memory was 31.4MB in the beginning and 33.4MB in the end (delta: -2.1MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2021-12-27 21:52:30,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.35ms. Allocated memory is still 54.5MB. Free memory was 33.4MB in the beginning and 31.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 21:52:30,701 INFO L158 Benchmark]: Boogie Preprocessor took 15.27ms. Allocated memory is still 54.5MB. Free memory was 31.6MB in the beginning and 30.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 21:52:30,701 INFO L158 Benchmark]: RCFGBuilder took 259.21ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 30.2MB in the beginning and 47.5MB in the end (delta: -17.3MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2021-12-27 21:52:30,702 INFO L158 Benchmark]: TraceAbstraction took 6719.75ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 47.0MB in the beginning and 103.5MB in the end (delta: -56.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2021-12-27 21:52:30,702 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 125.8MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 21:52:30,703 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.15ms. Allocated memory is still 54.5MB. Free memory was 36.9MB in the beginning and 36.8MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.16ms. Allocated memory is still 54.5MB. Free memory was 31.4MB in the beginning and 33.4MB in the end (delta: -2.1MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.35ms. Allocated memory is still 54.5MB. Free memory was 33.4MB in the beginning and 31.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.27ms. Allocated memory is still 54.5MB. Free memory was 31.6MB in the beginning and 30.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 259.21ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 30.2MB in the beginning and 47.5MB in the end (delta: -17.3MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6719.75ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 47.0MB in the beginning and 103.5MB in the end (delta: -56.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 125.8MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116, overapproximation of bitwiseAnd at line 96. Possible FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=356] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=356] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=356] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=356] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=20838, r0=234770790] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=20838, r0=234770790] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=20838, r0=234770790] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=20838, r0=234770790] [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=1, nb=4, partial_sum=20838, r0=234770790] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=234770790] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=234770790] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=234770790] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=234770790] [L91] COND TRUE i == (unsigned char)1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=234770790, r1=82] [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=82, r0=234770790, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=234770790, r1=82] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=234770790, r1=82] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=234770790, r1=82] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=234770790, r1=82] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=234770790, r1=82] [L92] COND TRUE i == (unsigned char)2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=234770790, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=254, r0=234770790, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=234770790, r1=82, r2=254] [L93] COND TRUE i == (unsigned char)3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=255, \old(b)=234770789, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\old(a)=255, \old(b)=234770789, \result=3, a=255, a0=-4294967041, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r=3, r0=234770790, r1=82, r2=254, r3=13] [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1456 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1456 mSDsluCounter, 2165 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1269 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2097 IncrementalHoareTripleChecker+Invalid, 2313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 896 mSDtfsCounter, 2097 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 429 SyntacticMatches, 11 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=14, InterpolantAutomatonStates: 80, 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, 15 MinimizatonAttempts, 1474 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 934 NumberOfCodeBlocks, 934 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 979 ConstructedInterpolants, 0 QuantifiedInterpolants, 3731 SizeOfPredicates, 14 NumberOfNonLiveVariables, 839 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 783/810 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 could not prove your program: unable to determine feasibility of some traces [2021-12-27 21:52:30,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/byte_add_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 21:52:32,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 21:52:32,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 21:52:32,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 21:52:32,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 21:52:32,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 21:52:32,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 21:52:32,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 21:52:32,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 21:52:32,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 21:52:32,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 21:52:32,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 21:52:32,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 21:52:32,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 21:52:32,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 21:52:32,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 21:52:32,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 21:52:32,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 21:52:32,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 21:52:32,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 21:52:32,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 21:52:32,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 21:52:32,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 21:52:32,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 21:52:32,387 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 21:52:32,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 21:52:32,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 21:52:32,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 21:52:32,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 21:52:32,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 21:52:32,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 21:52:32,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 21:52:32,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 21:52:32,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 21:52:32,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 21:52:32,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 21:52:32,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 21:52:32,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 21:52:32,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 21:52:32,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 21:52:32,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 21:52:32,398 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-27 21:52:32,422 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 21:52:32,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 21:52:32,423 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 21:52:32,423 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 21:52:32,424 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 21:52:32,424 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 21:52:32,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 21:52:32,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 21:52:32,425 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 21:52:32,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 21:52:32,426 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 21:52:32,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 21:52:32,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 21:52:32,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 21:52:32,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 21:52:32,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 21:52:32,427 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-27 21:52:32,427 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-27 21:52:32,427 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-27 21:52:32,427 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 21:52:32,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 21:52:32,428 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 21:52:32,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 21:52:32,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 21:52:32,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 21:52:32,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 21:52:32,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:52:32,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 21:52:32,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 21:52:32,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 21:52:32,429 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-27 21:52:32,429 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-27 21:52:32,429 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 21:52:32,430 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 21:52:32,430 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 21:52:32,430 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-27 21:52:32,430 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2021-12-27 21:52:32,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 21:52:32,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 21:52:32,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 21:52:32,720 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 21:52:32,720 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 21:52:32,721 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2021-12-27 21:52:32,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4359590f8/2cc0d556a4b346ca96c67e8e028563d2/FLAG117990e36 [2021-12-27 21:52:33,140 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 21:52:33,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2021-12-27 21:52:33,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4359590f8/2cc0d556a4b346ca96c67e8e028563d2/FLAG117990e36 [2021-12-27 21:52:33,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4359590f8/2cc0d556a4b346ca96c67e8e028563d2 [2021-12-27 21:52:33,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 21:52:33,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 21:52:33,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 21:52:33,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 21:52:33,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 21:52:33,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:52:33" (1/1) ... [2021-12-27 21:52:33,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51901b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:33, skipping insertion in model container [2021-12-27 21:52:33,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:52:33" (1/1) ... [2021-12-27 21:52:33,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 21:52:33,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 21:52:33,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2021-12-27 21:52:33,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:52:33,364 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 21:52:33,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2021-12-27 21:52:33,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:52:33,415 INFO L208 MainTranslator]: Completed translation [2021-12-27 21:52:33,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:33 WrapperNode [2021-12-27 21:52:33,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 21:52:33,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 21:52:33,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 21:52:33,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 21:52:33,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:33" (1/1) ... [2021-12-27 21:52:33,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:33" (1/1) ... [2021-12-27 21:52:33,454 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2021-12-27 21:52:33,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 21:52:33,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 21:52:33,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 21:52:33,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 21:52:33,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:33" (1/1) ... [2021-12-27 21:52:33,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:33" (1/1) ... [2021-12-27 21:52:33,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:33" (1/1) ... [2021-12-27 21:52:33,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:33" (1/1) ... [2021-12-27 21:52:33,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:33" (1/1) ... [2021-12-27 21:52:33,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:33" (1/1) ... [2021-12-27 21:52:33,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:33" (1/1) ... [2021-12-27 21:52:33,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 21:52:33,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 21:52:33,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 21:52:33,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 21:52:33,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:33" (1/1) ... [2021-12-27 21:52:33,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:52:33,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:33,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-27 21:52:33,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-27 21:52:33,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 21:52:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-27 21:52:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 21:52:33,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 21:52:33,605 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 21:52:33,606 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 21:52:33,822 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 21:52:33,827 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 21:52:33,827 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-27 21:52:33,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:33 BoogieIcfgContainer [2021-12-27 21:52:33,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 21:52:33,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 21:52:33,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 21:52:33,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 21:52:33,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:52:33" (1/3) ... [2021-12-27 21:52:33,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2067c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:52:33, skipping insertion in model container [2021-12-27 21:52:33,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:33" (2/3) ... [2021-12-27 21:52:33,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2067c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:52:33, skipping insertion in model container [2021-12-27 21:52:33,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:33" (3/3) ... [2021-12-27 21:52:33,839 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2021-12-27 21:52:33,842 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 21:52:33,843 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 21:52:33,882 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 21:52:33,891 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 21:52:33,891 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 21:52:33,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-27 21:52:33,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:33,909 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:33,910 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:33,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2021-12-27 21:52:33,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:33,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937305393] [2021-12-27 21:52:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:33,923 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:33,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:33,925 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:33,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-27 21:52:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:33,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-27 21:52:34,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:34,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:34,048 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:34,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937305393] [2021-12-27 21:52:34,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937305393] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:34,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:34,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 21:52:34,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122306474] [2021-12-27 21:52:34,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:34,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 21:52:34,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:34,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 21:52:34,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 21:52:34,080 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:34,092 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2021-12-27 21:52:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 21:52:34,095 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-27 21:52:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:34,106 INFO L225 Difference]: With dead ends: 57 [2021-12-27 21:52:34,106 INFO L226 Difference]: Without dead ends: 38 [2021-12-27 21:52:34,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 21:52:34,112 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:34,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-27 21:52:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-27 21:52:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2021-12-27 21:52:34,145 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2021-12-27 21:52:34,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:34,145 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2021-12-27 21:52:34,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:34,146 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2021-12-27 21:52:34,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-27 21:52:34,147 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:34,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:34,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-27 21:52:34,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:34,356 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:34,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:34,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2021-12-27 21:52:34,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:34,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093559071] [2021-12-27 21:52:34,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:34,358 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:34,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:34,359 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:34,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-27 21:52:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:34,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 21:52:34,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:34,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:34,442 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:34,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093559071] [2021-12-27 21:52:34,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093559071] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:34,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:34,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:52:34,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986327957] [2021-12-27 21:52:34,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:34,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:52:34,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:34,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:52:34,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:52:34,445 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:34,626 INFO L93 Difference]: Finished difference Result 116 states and 201 transitions. [2021-12-27 21:52:34,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:52:34,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-27 21:52:34,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:34,628 INFO L225 Difference]: With dead ends: 116 [2021-12-27 21:52:34,628 INFO L226 Difference]: Without dead ends: 88 [2021-12-27 21:52:34,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:52:34,629 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 66 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:34,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 152 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:52:34,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-27 21:52:34,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2021-12-27 21:52:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2021-12-27 21:52:34,637 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 12 [2021-12-27 21:52:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:34,637 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2021-12-27 21:52:34,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2021-12-27 21:52:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-27 21:52:34,638 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:34,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:34,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:34,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:34,845 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:34,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:34,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1087802014, now seen corresponding path program 1 times [2021-12-27 21:52:34,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:34,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582676242] [2021-12-27 21:52:34,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:34,846 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:34,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:34,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:34,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-27 21:52:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:34,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-27 21:52:34,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:34,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:34,924 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:34,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582676242] [2021-12-27 21:52:34,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582676242] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:34,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:34,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:52:34,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317790074] [2021-12-27 21:52:34,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:34,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:52:34,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:34,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:52:34,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:34,926 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:34,942 INFO L93 Difference]: Finished difference Result 86 states and 134 transitions. [2021-12-27 21:52:34,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:52:34,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-27 21:52:34,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:34,944 INFO L225 Difference]: With dead ends: 86 [2021-12-27 21:52:34,944 INFO L226 Difference]: Without dead ends: 55 [2021-12-27 21:52:34,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:34,945 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 55 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:34,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:34,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-27 21:52:34,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-12-27 21:52:34,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 54 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2021-12-27 21:52:34,959 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2021-12-27 21:52:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:34,959 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2021-12-27 21:52:34,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2021-12-27 21:52:34,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-27 21:52:34,961 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:34,962 INFO L514 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] [2021-12-27 21:52:34,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:35,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:35,162 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:35,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:35,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2021-12-27 21:52:35,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:35,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377993219] [2021-12-27 21:52:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:35,164 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:35,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:35,166 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:35,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-27 21:52:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:35,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 21:52:35,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:35,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:35,274 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:35,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377993219] [2021-12-27 21:52:35,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377993219] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:35,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:35,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:52:35,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504248555] [2021-12-27 21:52:35,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:35,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:52:35,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:35,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:52:35,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:52:35,276 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:35,382 INFO L93 Difference]: Finished difference Result 151 states and 219 transitions. [2021-12-27 21:52:35,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:52:35,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-27 21:52:35,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:35,383 INFO L225 Difference]: With dead ends: 151 [2021-12-27 21:52:35,383 INFO L226 Difference]: Without dead ends: 107 [2021-12-27 21:52:35,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:52:35,384 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 65 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:35,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 146 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:35,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-27 21:52:35,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 60. [2021-12-27 21:52:35,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2021-12-27 21:52:35,390 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 25 [2021-12-27 21:52:35,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:35,390 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2021-12-27 21:52:35,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2021-12-27 21:52:35,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-27 21:52:35,391 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:35,391 INFO L514 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] [2021-12-27 21:52:35,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:35,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:35,603 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:35,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1384042382, now seen corresponding path program 1 times [2021-12-27 21:52:35,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:35,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460271330] [2021-12-27 21:52:35,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:35,605 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:35,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:35,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:35,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-27 21:52:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:35,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-27 21:52:35,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:35,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:35,686 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:35,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460271330] [2021-12-27 21:52:35,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460271330] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:35,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:35,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:52:35,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90416718] [2021-12-27 21:52:35,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:35,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:52:35,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:35,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:52:35,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:35,688 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:35,759 INFO L93 Difference]: Finished difference Result 201 states and 290 transitions. [2021-12-27 21:52:35,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:52:35,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-27 21:52:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:35,760 INFO L225 Difference]: With dead ends: 201 [2021-12-27 21:52:35,760 INFO L226 Difference]: Without dead ends: 157 [2021-12-27 21:52:35,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:35,762 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 140 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:35,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 295 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-27 21:52:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 60. [2021-12-27 21:52:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2021-12-27 21:52:35,767 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 26 [2021-12-27 21:52:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:35,767 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2021-12-27 21:52:35,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2021-12-27 21:52:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-27 21:52:35,768 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:35,768 INFO L514 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] [2021-12-27 21:52:35,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:35,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:35,975 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:35,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1985045161, now seen corresponding path program 1 times [2021-12-27 21:52:35,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:35,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104047822] [2021-12-27 21:52:35,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:35,976 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:35,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:35,977 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:35,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-27 21:52:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:36,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-27 21:52:36,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:36,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:36,075 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:36,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104047822] [2021-12-27 21:52:36,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104047822] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:36,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:36,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 21:52:36,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191373324] [2021-12-27 21:52:36,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:36,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:52:36,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:36,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:52:36,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:36,077 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:36,430 INFO L93 Difference]: Finished difference Result 269 states and 387 transitions. [2021-12-27 21:52:36,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:52:36,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-27 21:52:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:36,432 INFO L225 Difference]: With dead ends: 269 [2021-12-27 21:52:36,432 INFO L226 Difference]: Without dead ends: 221 [2021-12-27 21:52:36,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:52:36,433 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 357 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:36,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 462 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:52:36,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-27 21:52:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 57. [2021-12-27 21:52:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2021-12-27 21:52:36,444 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 27 [2021-12-27 21:52:36,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:36,445 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2021-12-27 21:52:36,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2021-12-27 21:52:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-27 21:52:36,446 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:36,446 INFO L514 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] [2021-12-27 21:52:36,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:36,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:36,652 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:36,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash 221982208, now seen corresponding path program 1 times [2021-12-27 21:52:36,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:36,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184440697] [2021-12-27 21:52:36,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:36,653 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:36,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:36,654 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:36,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-27 21:52:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:36,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-27 21:52:36,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:36,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:36,782 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:36,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184440697] [2021-12-27 21:52:36,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184440697] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:36,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:36,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:52:36,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887994586] [2021-12-27 21:52:36,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:36,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:52:36,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:36,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:52:36,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:36,784 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:36,834 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2021-12-27 21:52:36,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:52:36,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-27 21:52:36,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:36,835 INFO L225 Difference]: With dead ends: 76 [2021-12-27 21:52:36,835 INFO L226 Difference]: Without dead ends: 60 [2021-12-27 21:52:36,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:36,836 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 56 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:36,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 62 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 49 Unchecked, 0.0s Time] [2021-12-27 21:52:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-27 21:52:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2021-12-27 21:52:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2021-12-27 21:52:36,840 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 29 [2021-12-27 21:52:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:36,840 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2021-12-27 21:52:36,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2021-12-27 21:52:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-27 21:52:36,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:36,841 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:36,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:37,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:37,047 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:37,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:37,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1944069515, now seen corresponding path program 1 times [2021-12-27 21:52:37,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:37,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132061331] [2021-12-27 21:52:37,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:37,049 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:37,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:37,050 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:37,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-27 21:52:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:37,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-27 21:52:37,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:37,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:37,196 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:37,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132061331] [2021-12-27 21:52:37,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132061331] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:37,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:37,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:52:37,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621759939] [2021-12-27 21:52:37,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:37,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:52:37,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:37,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:52:37,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:37,198 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:37,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:37,250 INFO L93 Difference]: Finished difference Result 140 states and 187 transitions. [2021-12-27 21:52:37,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:52:37,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-27 21:52:37,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:37,251 INFO L225 Difference]: With dead ends: 140 [2021-12-27 21:52:37,251 INFO L226 Difference]: Without dead ends: 82 [2021-12-27 21:52:37,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:52:37,255 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 30 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:37,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 118 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 85 Unchecked, 0.0s Time] [2021-12-27 21:52:37,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-27 21:52:37,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-12-27 21:52:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.308641975308642) internal successors, (106), 81 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2021-12-27 21:52:37,267 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 38 [2021-12-27 21:52:37,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:37,268 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2021-12-27 21:52:37,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2021-12-27 21:52:37,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-27 21:52:37,271 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:37,271 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:37,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:37,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:37,478 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:37,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:37,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1155801417, now seen corresponding path program 1 times [2021-12-27 21:52:37,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:37,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058959064] [2021-12-27 21:52:37,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:37,478 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:37,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:37,479 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:37,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-27 21:52:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:37,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-27 21:52:37,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:37,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:37,638 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:37,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058959064] [2021-12-27 21:52:37,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058959064] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:37,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:37,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:52:37,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613318259] [2021-12-27 21:52:37,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:37,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:52:37,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:37,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:52:37,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:52:37,640 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:37,680 INFO L93 Difference]: Finished difference Result 201 states and 268 transitions. [2021-12-27 21:52:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:52:37,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-27 21:52:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:37,681 INFO L225 Difference]: With dead ends: 201 [2021-12-27 21:52:37,682 INFO L226 Difference]: Without dead ends: 153 [2021-12-27 21:52:37,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:52:37,682 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 66 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:37,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 159 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 76 Unchecked, 0.0s Time] [2021-12-27 21:52:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-27 21:52:37,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 105. [2021-12-27 21:52:37,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2021-12-27 21:52:37,688 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 39 [2021-12-27 21:52:37,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:37,688 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2021-12-27 21:52:37,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2021-12-27 21:52:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-27 21:52:37,689 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:37,689 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:37,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:37,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:37,896 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:37,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:37,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1672266272, now seen corresponding path program 1 times [2021-12-27 21:52:37,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:37,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278069142] [2021-12-27 21:52:37,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:37,897 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:37,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:37,897 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:37,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-27 21:52:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:37,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-27 21:52:37,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:38,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:38,126 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:38,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278069142] [2021-12-27 21:52:38,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278069142] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:38,131 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:38,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-27 21:52:38,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321239365] [2021-12-27 21:52:38,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:38,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-27 21:52:38,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:38,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-27 21:52:38,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:52:38,138 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:38,299 INFO L93 Difference]: Finished difference Result 230 states and 327 transitions. [2021-12-27 21:52:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 21:52:38,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-27 21:52:38,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:38,300 INFO L225 Difference]: With dead ends: 230 [2021-12-27 21:52:38,300 INFO L226 Difference]: Without dead ends: 165 [2021-12-27 21:52:38,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:52:38,301 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 278 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:38,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 67 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-12-27 21:52:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 140. [2021-12-27 21:52:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.3453237410071943) internal successors, (187), 139 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 187 transitions. [2021-12-27 21:52:38,306 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 187 transitions. Word has length 40 [2021-12-27 21:52:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:38,306 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 187 transitions. [2021-12-27 21:52:38,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 187 transitions. [2021-12-27 21:52:38,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-27 21:52:38,308 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:38,308 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:38,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:38,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:38,514 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:38,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:38,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1114855792, now seen corresponding path program 1 times [2021-12-27 21:52:38,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:38,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817911042] [2021-12-27 21:52:38,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:38,515 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:38,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:38,516 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:38,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-27 21:52:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:38,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-27 21:52:38,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:38,665 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-27 21:52:38,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:38,791 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-27 21:52:38,791 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:38,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817911042] [2021-12-27 21:52:38,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817911042] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:38,791 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:38,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-27 21:52:38,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493016394] [2021-12-27 21:52:38,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:38,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-27 21:52:38,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:38,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-27 21:52:38,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:52:38,793 INFO L87 Difference]: Start difference. First operand 140 states and 187 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:38,956 INFO L93 Difference]: Finished difference Result 431 states and 586 transitions. [2021-12-27 21:52:38,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:52:38,957 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-12-27 21:52:38,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:38,958 INFO L225 Difference]: With dead ends: 431 [2021-12-27 21:52:38,958 INFO L226 Difference]: Without dead ends: 324 [2021-12-27 21:52:38,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:52:38,958 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 227 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:38,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 340 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-27 21:52:38,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 203. [2021-12-27 21:52:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.386138613861386) internal successors, (280), 202 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 280 transitions. [2021-12-27 21:52:38,965 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 280 transitions. Word has length 70 [2021-12-27 21:52:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:38,965 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 280 transitions. [2021-12-27 21:52:38,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 280 transitions. [2021-12-27 21:52:38,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-27 21:52:38,966 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:38,966 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-27 21:52:38,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:39,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:39,172 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:39,173 INFO L85 PathProgramCache]: Analyzing trace with hash 343661932, now seen corresponding path program 1 times [2021-12-27 21:52:39,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:39,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997108947] [2021-12-27 21:52:39,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:39,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:39,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:39,174 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:39,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-27 21:52:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:39,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-27 21:52:39,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-27 21:52:39,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-27 21:52:39,470 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:39,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997108947] [2021-12-27 21:52:39,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997108947] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:39,471 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:39,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-12-27 21:52:39,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358530466] [2021-12-27 21:52:39,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:39,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:52:39,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:39,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:52:39,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:52:39,472 INFO L87 Difference]: Start difference. First operand 203 states and 280 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:39,603 INFO L93 Difference]: Finished difference Result 519 states and 706 transitions. [2021-12-27 21:52:39,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:52:39,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-12-27 21:52:39,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:39,604 INFO L225 Difference]: With dead ends: 519 [2021-12-27 21:52:39,604 INFO L226 Difference]: Without dead ends: 349 [2021-12-27 21:52:39,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-12-27 21:52:39,605 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 265 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:39,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 265 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-12-27 21:52:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 206. [2021-12-27 21:52:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.3853658536585365) internal successors, (284), 205 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 284 transitions. [2021-12-27 21:52:39,614 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 284 transitions. Word has length 70 [2021-12-27 21:52:39,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:39,614 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 284 transitions. [2021-12-27 21:52:39,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:39,614 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 284 transitions. [2021-12-27 21:52:39,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-27 21:52:39,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:39,616 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:39,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:39,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:39,826 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:39,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:39,826 INFO L85 PathProgramCache]: Analyzing trace with hash 484210542, now seen corresponding path program 2 times [2021-12-27 21:52:39,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:39,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874537488] [2021-12-27 21:52:39,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 21:52:39,827 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:39,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:39,828 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:39,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-27 21:52:39,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 21:52:39,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:52:39,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-27 21:52:39,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:42,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:44,419 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:44,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874537488] [2021-12-27 21:52:44,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874537488] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:44,419 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:44,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2021-12-27 21:52:44,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482625598] [2021-12-27 21:52:44,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:44,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-27 21:52:44,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:44,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-27 21:52:44,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1750, Unknown=0, NotChecked=0, Total=1892 [2021-12-27 21:52:44,422 INFO L87 Difference]: Start difference. First operand 206 states and 284 transitions. Second operand has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:55,262 INFO L93 Difference]: Finished difference Result 2094 states and 2890 transitions. [2021-12-27 21:52:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-12-27 21:52:55,263 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-12-27 21:52:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:55,268 INFO L225 Difference]: With dead ends: 2094 [2021-12-27 21:52:55,268 INFO L226 Difference]: Without dead ends: 1909 [2021-12-27 21:52:55,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2416 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=2223, Invalid=10887, Unknown=0, NotChecked=0, Total=13110 [2021-12-27 21:52:55,272 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 2791 mSDsluCounter, 8276 mSDsCounter, 0 mSdLazyCounter, 4845 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2791 SdHoareTripleChecker+Valid, 8719 SdHoareTripleChecker+Invalid, 5339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 4845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:55,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2791 Valid, 8719 Invalid, 5339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 4845 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-12-27 21:52:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2021-12-27 21:52:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 842. [2021-12-27 21:52:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 1.4244946492271107) internal successors, (1198), 841 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1198 transitions. [2021-12-27 21:52:55,305 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1198 transitions. Word has length 70 [2021-12-27 21:52:55,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:55,305 INFO L470 AbstractCegarLoop]: Abstraction has 842 states and 1198 transitions. [2021-12-27 21:52:55,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1198 transitions. [2021-12-27 21:52:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-27 21:52:55,306 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:55,306 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:55,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:55,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:55,518 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:55,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:55,518 INFO L85 PathProgramCache]: Analyzing trace with hash 703065260, now seen corresponding path program 1 times [2021-12-27 21:52:55,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:55,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429343704] [2021-12-27 21:52:55,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:55,519 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:55,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:55,520 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:55,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-27 21:52:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:55,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-27 21:52:55,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-27 21:52:55,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-27 21:52:55,862 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:55,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429343704] [2021-12-27 21:52:55,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429343704] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:55,863 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:55,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-12-27 21:52:55,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425732754] [2021-12-27 21:52:55,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:55,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:52:55,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:55,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:52:55,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:55,864 INFO L87 Difference]: Start difference. First operand 842 states and 1198 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:56,006 INFO L93 Difference]: Finished difference Result 1711 states and 2443 transitions. [2021-12-27 21:52:56,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:52:56,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-12-27 21:52:56,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:56,014 INFO L225 Difference]: With dead ends: 1711 [2021-12-27 21:52:56,014 INFO L226 Difference]: Without dead ends: 908 [2021-12-27 21:52:56,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 132 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:56,015 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 33 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:56,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 85 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:56,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2021-12-27 21:52:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 738. [2021-12-27 21:52:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 1.383989145183175) internal successors, (1020), 737 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1020 transitions. [2021-12-27 21:52:56,056 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1020 transitions. Word has length 70 [2021-12-27 21:52:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:56,057 INFO L470 AbstractCegarLoop]: Abstraction has 738 states and 1020 transitions. [2021-12-27 21:52:56,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1020 transitions. [2021-12-27 21:52:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-27 21:52:56,059 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:56,060 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:56,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:56,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:56,266 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:56,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:56,266 INFO L85 PathProgramCache]: Analyzing trace with hash -247756884, now seen corresponding path program 1 times [2021-12-27 21:52:56,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:56,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516442764] [2021-12-27 21:52:56,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:56,267 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:56,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:56,269 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:56,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-27 21:52:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:56,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-27 21:52:56,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-27 21:52:56,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:56,439 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:56,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516442764] [2021-12-27 21:52:56,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516442764] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:56,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:56,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 21:52:56,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797991326] [2021-12-27 21:52:56,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:56,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:52:56,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:56,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:52:56,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:56,440 INFO L87 Difference]: Start difference. First operand 738 states and 1020 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:56,579 INFO L93 Difference]: Finished difference Result 1301 states and 1770 transitions. [2021-12-27 21:52:56,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 21:52:56,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-12-27 21:52:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:56,584 INFO L225 Difference]: With dead ends: 1301 [2021-12-27 21:52:56,585 INFO L226 Difference]: Without dead ends: 1131 [2021-12-27 21:52:56,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:56,587 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 149 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:56,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 432 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 82 Unchecked, 0.1s Time] [2021-12-27 21:52:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2021-12-27 21:52:56,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 732. [2021-12-27 21:52:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 1.387140902872777) internal successors, (1014), 731 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1014 transitions. [2021-12-27 21:52:56,622 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1014 transitions. Word has length 70 [2021-12-27 21:52:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:56,622 INFO L470 AbstractCegarLoop]: Abstraction has 732 states and 1014 transitions. [2021-12-27 21:52:56,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1014 transitions. [2021-12-27 21:52:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-27 21:52:56,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:56,623 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:56,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:56,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:56,830 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:56,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash 946149333, now seen corresponding path program 1 times [2021-12-27 21:52:56,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:56,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338392182] [2021-12-27 21:52:56,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:56,835 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:56,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:56,836 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:56,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-27 21:52:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:56,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-27 21:52:56,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-27 21:52:57,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-27 21:52:57,289 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:57,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338392182] [2021-12-27 21:52:57,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338392182] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:57,289 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:57,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-27 21:52:57,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958757629] [2021-12-27 21:52:57,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:57,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-27 21:52:57,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:57,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-27 21:52:57,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:52:57,290 INFO L87 Difference]: Start difference. First operand 732 states and 1014 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:57,431 INFO L93 Difference]: Finished difference Result 965 states and 1314 transitions. [2021-12-27 21:52:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:52:57,439 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-12-27 21:52:57,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:57,441 INFO L225 Difference]: With dead ends: 965 [2021-12-27 21:52:57,441 INFO L226 Difference]: Without dead ends: 795 [2021-12-27 21:52:57,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-12-27 21:52:57,442 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 83 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:57,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 170 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 167 Unchecked, 0.1s Time] [2021-12-27 21:52:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2021-12-27 21:52:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2021-12-27 21:52:57,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 1.3602015113350125) internal successors, (1080), 794 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1080 transitions. [2021-12-27 21:52:57,466 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1080 transitions. Word has length 72 [2021-12-27 21:52:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:57,467 INFO L470 AbstractCegarLoop]: Abstraction has 795 states and 1080 transitions. [2021-12-27 21:52:57,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1080 transitions. [2021-12-27 21:52:57,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-27 21:52:57,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:57,468 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:57,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-12-27 21:52:57,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:57,674 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:57,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:57,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1891529833, now seen corresponding path program 1 times [2021-12-27 21:52:57,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:57,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324737311] [2021-12-27 21:52:57,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:57,675 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:57,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:57,676 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:57,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-27 21:52:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:57,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-27 21:52:57,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-27 21:52:57,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-27 21:52:58,117 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:58,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324737311] [2021-12-27 21:52:58,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324737311] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:58,118 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:58,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-27 21:52:58,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707037193] [2021-12-27 21:52:58,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:58,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-27 21:52:58,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:58,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-27 21:52:58,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-27 21:52:58,120 INFO L87 Difference]: Start difference. First operand 795 states and 1080 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:58,308 INFO L93 Difference]: Finished difference Result 1307 states and 1765 transitions. [2021-12-27 21:52:58,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:52:58,309 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-12-27 21:52:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:58,311 INFO L225 Difference]: With dead ends: 1307 [2021-12-27 21:52:58,311 INFO L226 Difference]: Without dead ends: 1137 [2021-12-27 21:52:58,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-27 21:52:58,312 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 168 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 283 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:58,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 218 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 283 Unchecked, 0.1s Time] [2021-12-27 21:52:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2021-12-27 21:52:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 834. [2021-12-27 21:52:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 833 states have (on average 1.3457382953181272) internal successors, (1121), 833 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1121 transitions. [2021-12-27 21:52:58,339 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1121 transitions. Word has length 73 [2021-12-27 21:52:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:58,339 INFO L470 AbstractCegarLoop]: Abstraction has 834 states and 1121 transitions. [2021-12-27 21:52:58,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1121 transitions. [2021-12-27 21:52:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-27 21:52:58,340 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:58,340 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:58,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:58,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:58,547 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:58,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:58,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1135042114, now seen corresponding path program 1 times [2021-12-27 21:52:58,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:58,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333764828] [2021-12-27 21:52:58,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:58,548 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:58,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:58,549 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:58,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-27 21:52:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:58,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-27 21:52:58,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:53:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:53:01,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:53:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:53:03,606 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:53:03,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333764828] [2021-12-27 21:53:03,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333764828] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:53:03,606 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:53:03,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2021-12-27 21:53:03,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615928640] [2021-12-27 21:53:03,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:53:03,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-27 21:53:03,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:53:03,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-27 21:53:03,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2021-12-27 21:53:03,608 INFO L87 Difference]: Start difference. First operand 834 states and 1121 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)