./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/recursive/Ackermann03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c244f72db2906c596b7f122d769fc1464836d7d05d9227ee4269773d59ed10bd --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 17:26:35,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 17:26:35,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 17:26:35,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 17:26:35,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 17:26:35,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 17:26:35,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 17:26:35,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 17:26:35,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 17:26:35,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 17:26:35,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 17:26:35,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 17:26:35,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 17:26:35,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 17:26:35,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 17:26:35,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 17:26:35,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 17:26:35,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 17:26:35,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 17:26:35,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 17:26:35,723 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 17:26:35,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 17:26:35,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 17:26:35,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 17:26:35,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 17:26:35,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 17:26:35,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 17:26:35,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 17:26:35,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 17:26:35,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 17:26:35,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 17:26:35,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 17:26:35,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 17:26:35,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 17:26:35,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 17:26:35,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 17:26:35,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 17:26:35,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 17:26:35,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 17:26:35,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 17:26:35,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 17:26:35,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 17:26:35,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 17:26:35,750 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 17:26:35,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 17:26:35,751 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 17:26:35,751 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 17:26:35,752 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 17:26:35,752 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 17:26:35,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 17:26:35,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 17:26:35,753 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 17:26:35,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 17:26:35,753 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 17:26:35,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 17:26:35,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 17:26:35,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 17:26:35,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 17:26:35,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 17:26:35,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 17:26:35,754 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 17:26:35,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 17:26:35,755 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 17:26:35,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 17:26:35,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 17:26:35,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 17:26:35,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 17:26:35,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:26:35,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 17:26:35,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 17:26:35,756 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 17:26:35,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 17:26:35,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 17:26:35,757 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 17:26:35,757 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 17:26:35,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 17:26:35,758 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 -> c244f72db2906c596b7f122d769fc1464836d7d05d9227ee4269773d59ed10bd [2022-07-19 17:26:35,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 17:26:35,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 17:26:35,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 17:26:35,934 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 17:26:35,934 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 17:26:35,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann03.c [2022-07-19 17:26:35,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/459c89c50/5d38f31ec9d54d7091c41c81129b91a5/FLAG7d8896895 [2022-07-19 17:26:36,309 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 17:26:36,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann03.c [2022-07-19 17:26:36,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/459c89c50/5d38f31ec9d54d7091c41c81129b91a5/FLAG7d8896895 [2022-07-19 17:26:36,321 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/459c89c50/5d38f31ec9d54d7091c41c81129b91a5 [2022-07-19 17:26:36,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 17:26:36,323 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 17:26:36,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 17:26:36,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 17:26:36,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 17:26:36,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:26:36" (1/1) ... [2022-07-19 17:26:36,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c3a229d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:36, skipping insertion in model container [2022-07-19 17:26:36,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:26:36" (1/1) ... [2022-07-19 17:26:36,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 17:26:36,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 17:26:36,488 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/recursive/Ackermann03.c[1168,1181] [2022-07-19 17:26:36,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:26:36,495 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 17:26:36,503 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/recursive/Ackermann03.c[1168,1181] [2022-07-19 17:26:36,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:26:36,511 INFO L208 MainTranslator]: Completed translation [2022-07-19 17:26:36,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:36 WrapperNode [2022-07-19 17:26:36,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 17:26:36,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 17:26:36,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 17:26:36,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 17:26:36,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:36" (1/1) ... [2022-07-19 17:26:36,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:36" (1/1) ... [2022-07-19 17:26:36,530 INFO L137 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2022-07-19 17:26:36,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 17:26:36,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 17:26:36,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 17:26:36,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 17:26:36,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:36" (1/1) ... [2022-07-19 17:26:36,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:36" (1/1) ... [2022-07-19 17:26:36,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:36" (1/1) ... [2022-07-19 17:26:36,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:36" (1/1) ... [2022-07-19 17:26:36,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:36" (1/1) ... [2022-07-19 17:26:36,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:36" (1/1) ... [2022-07-19 17:26:36,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:36" (1/1) ... [2022-07-19 17:26:36,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 17:26:36,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 17:26:36,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 17:26:36,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 17:26:36,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:36" (1/1) ... [2022-07-19 17:26:36,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:26:36,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:36,588 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) [2022-07-19 17:26:36,608 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 [2022-07-19 17:26:36,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 17:26:36,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 17:26:36,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 17:26:36,621 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2022-07-19 17:26:36,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2022-07-19 17:26:36,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 17:26:36,669 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 17:26:36,670 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 17:26:36,788 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 17:26:36,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 17:26:36,792 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 17:26:36,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:26:36 BoogieIcfgContainer [2022-07-19 17:26:36,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 17:26:36,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 17:26:36,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 17:26:36,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 17:26:36,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 05:26:36" (1/3) ... [2022-07-19 17:26:36,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df62bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:26:36, skipping insertion in model container [2022-07-19 17:26:36,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:36" (2/3) ... [2022-07-19 17:26:36,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df62bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:26:36, skipping insertion in model container [2022-07-19 17:26:36,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:26:36" (3/3) ... [2022-07-19 17:26:36,803 INFO L111 eAbstractionObserver]: Analyzing ICFG Ackermann03.c [2022-07-19 17:26:36,815 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 17:26:36,815 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 17:26:36,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 17:26:36,853 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2c3eebeb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5820d862 [2022-07-19 17:26:36,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 17:26:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 17:26:36,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 17:26:36,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:36,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:26:36,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:36,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:36,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1470704041, now seen corresponding path program 1 times [2022-07-19 17:26:36,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:36,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037767636] [2022-07-19 17:26:36,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:36,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:37,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:26:37,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:37,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037767636] [2022-07-19 17:26:37,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037767636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:26:37,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:26:37,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:26:37,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243555746] [2022-07-19 17:26:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:26:37,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:26:37,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:37,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:26:37,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:26:37,089 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 17:26:37,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:37,192 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-07-19 17:26:37,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:26:37,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-07-19 17:26:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:37,200 INFO L225 Difference]: With dead ends: 51 [2022-07-19 17:26:37,200 INFO L226 Difference]: Without dead ends: 25 [2022-07-19 17:26:37,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:26:37,207 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:26:37,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 72 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:26:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-19 17:26:37,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-19 17:26:37,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-19 17:26:37,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-07-19 17:26:37,240 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2022-07-19 17:26:37,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:37,240 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-19 17:26:37,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 17:26:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-07-19 17:26:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 17:26:37,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:37,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:26:37,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 17:26:37,243 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:37,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:37,243 INFO L85 PathProgramCache]: Analyzing trace with hash 941922339, now seen corresponding path program 1 times [2022-07-19 17:26:37,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:37,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758214774] [2022-07-19 17:26:37,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:37,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:37,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:37,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:37,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 17:26:37,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:37,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758214774] [2022-07-19 17:26:37,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758214774] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:26:37,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484412837] [2022-07-19 17:26:37,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:37,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:37,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:37,398 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) [2022-07-19 17:26:37,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 17:26:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:37,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 17:26:37,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:26:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 17:26:37,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:26:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 17:26:37,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484412837] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:26:37,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:26:37,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-19 17:26:37,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248756929] [2022-07-19 17:26:37,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:26:37,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 17:26:37,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:37,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 17:26:37,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:26:37,650 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 17:26:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:37,770 INFO L93 Difference]: Finished difference Result 74 states and 126 transitions. [2022-07-19 17:26:37,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 17:26:37,771 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 19 [2022-07-19 17:26:37,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:37,773 INFO L225 Difference]: With dead ends: 74 [2022-07-19 17:26:37,773 INFO L226 Difference]: Without dead ends: 50 [2022-07-19 17:26:37,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:26:37,775 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:26:37,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 91 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:26:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-19 17:26:37,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-07-19 17:26:37,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (27), 12 states have call predecessors, (27), 10 states have call successors, (27) [2022-07-19 17:26:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2022-07-19 17:26:37,786 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 19 [2022-07-19 17:26:37,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:37,786 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2022-07-19 17:26:37,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 17:26:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2022-07-19 17:26:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 17:26:37,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:37,789 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:26:37,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 17:26:38,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:38,007 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:38,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:38,008 INFO L85 PathProgramCache]: Analyzing trace with hash -574784801, now seen corresponding path program 1 times [2022-07-19 17:26:38,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:38,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447186815] [2022-07-19 17:26:38,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:38,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:38,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:38,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:38,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:38,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:38,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:38,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:26:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 17:26:38,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:38,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447186815] [2022-07-19 17:26:38,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447186815] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:26:38,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974131527] [2022-07-19 17:26:38,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:38,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:38,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:38,203 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) [2022-07-19 17:26:38,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 17:26:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:38,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 17:26:38,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:26:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 17:26:38,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:26:38,765 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 17:26:38,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974131527] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:26:38,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:26:38,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2022-07-19 17:26:38,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33906609] [2022-07-19 17:26:38,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:26:38,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 17:26:38,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:38,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 17:26:38,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:26:38,767 INFO L87 Difference]: Start difference. First operand 50 states and 76 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 17:26:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:38,840 INFO L93 Difference]: Finished difference Result 120 states and 227 transitions. [2022-07-19 17:26:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 17:26:38,841 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 6 states have call successors, (9) Word has length 45 [2022-07-19 17:26:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:38,843 INFO L225 Difference]: With dead ends: 120 [2022-07-19 17:26:38,843 INFO L226 Difference]: Without dead ends: 53 [2022-07-19 17:26:38,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:26:38,845 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:26:38,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 82 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:26:38,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-19 17:26:38,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-19 17:26:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) [2022-07-19 17:26:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2022-07-19 17:26:38,853 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 45 [2022-07-19 17:26:38,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:38,853 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2022-07-19 17:26:38,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 17:26:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2022-07-19 17:26:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-19 17:26:38,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:38,856 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:26:38,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 17:26:39,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-19 17:26:39,089 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:39,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:39,089 INFO L85 PathProgramCache]: Analyzing trace with hash -749766204, now seen corresponding path program 2 times [2022-07-19 17:26:39,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:39,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430361558] [2022-07-19 17:26:39,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:39,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:39,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:39,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:39,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:39,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:39,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:39,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:39,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:26:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:39,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 17:26:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:39,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-19 17:26:39,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:39,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430361558] [2022-07-19 17:26:39,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430361558] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:26:39,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359527722] [2022-07-19 17:26:39,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 17:26:39,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:39,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:39,321 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) [2022-07-19 17:26:39,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 17:26:39,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 17:26:39,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:26:39,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-19 17:26:39,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:26:39,484 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 141 proven. 37 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-19 17:26:39,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:26:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 85 proven. 65 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-19 17:26:40,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359527722] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:26:40,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:26:40,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 29 [2022-07-19 17:26:40,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690739077] [2022-07-19 17:26:40,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:26:40,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-19 17:26:40,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:40,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-19 17:26:40,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2022-07-19 17:26:40,476 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2022-07-19 17:26:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:40,827 INFO L93 Difference]: Finished difference Result 106 states and 183 transitions. [2022-07-19 17:26:40,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 17:26:40,828 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) Word has length 79 [2022-07-19 17:26:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:40,830 INFO L225 Difference]: With dead ends: 106 [2022-07-19 17:26:40,830 INFO L226 Difference]: Without dead ends: 58 [2022-07-19 17:26:40,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=298, Invalid=1342, Unknown=0, NotChecked=0, Total=1640 [2022-07-19 17:26:40,832 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:26:40,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 183 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:26:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-19 17:26:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2022-07-19 17:26:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (24), 11 states have call predecessors, (24), 8 states have call successors, (24) [2022-07-19 17:26:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2022-07-19 17:26:40,854 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 79 [2022-07-19 17:26:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:40,854 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2022-07-19 17:26:40,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2022-07-19 17:26:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2022-07-19 17:26:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-19 17:26:40,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:40,856 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 12, 9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:26:40,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 17:26:41,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:41,057 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:41,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2109661843, now seen corresponding path program 3 times [2022-07-19 17:26:41,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:41,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171860691] [2022-07-19 17:26:41,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:41,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:26:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:26:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:26:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 17:26:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:26:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 391 proven. 197 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-07-19 17:26:41,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:41,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171860691] [2022-07-19 17:26:41,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171860691] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:26:41,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484455177] [2022-07-19 17:26:41,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 17:26:41,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:41,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:41,520 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) [2022-07-19 17:26:41,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 17:26:41,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2022-07-19 17:26:41,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:26:41,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-19 17:26:41,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:26:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 367 proven. 209 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-07-19 17:26:41,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:26:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 410 proven. 201 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2022-07-19 17:26:44,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484455177] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:26:44,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:26:44,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 26] total 39 [2022-07-19 17:26:44,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222539229] [2022-07-19 17:26:44,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:26:44,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-19 17:26:44,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:44,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-19 17:26:44,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1293, Unknown=0, NotChecked=0, Total=1482 [2022-07-19 17:26:44,166 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 32 states have internal predecessors, (80), 15 states have call successors, (18), 1 states have call predecessors, (18), 18 states have return successors, (33), 19 states have call predecessors, (33), 15 states have call successors, (33) [2022-07-19 17:26:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:44,817 INFO L93 Difference]: Finished difference Result 128 states and 237 transitions. [2022-07-19 17:26:44,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-19 17:26:44,818 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 32 states have internal predecessors, (80), 15 states have call successors, (18), 1 states have call predecessors, (18), 18 states have return successors, (33), 19 states have call predecessors, (33), 15 states have call successors, (33) Word has length 144 [2022-07-19 17:26:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:44,820 INFO L225 Difference]: With dead ends: 128 [2022-07-19 17:26:44,820 INFO L226 Difference]: Without dead ends: 80 [2022-07-19 17:26:44,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 311 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=799, Invalid=3623, Unknown=0, NotChecked=0, Total=4422 [2022-07-19 17:26:44,823 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 68 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:26:44,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 273 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:26:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-19 17:26:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2022-07-19 17:26:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 11 states have call successors, (11), 5 states have call predecessors, (11), 10 states have return successors, (35), 15 states have call predecessors, (35), 11 states have call successors, (35) [2022-07-19 17:26:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2022-07-19 17:26:44,831 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 144 [2022-07-19 17:26:44,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:44,831 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2022-07-19 17:26:44,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 32 states have internal predecessors, (80), 15 states have call successors, (18), 1 states have call predecessors, (18), 18 states have return successors, (33), 19 states have call predecessors, (33), 15 states have call successors, (33) [2022-07-19 17:26:44,831 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2022-07-19 17:26:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-19 17:26:44,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:44,833 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:26:44,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 17:26:45,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:45,051 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:45,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:45,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1942933932, now seen corresponding path program 4 times [2022-07-19 17:26:45,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:45,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611811111] [2022-07-19 17:26:45,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:45,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:26:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:26:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:26:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 17:26:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 17:26:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:26:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:26:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 17:26:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 258 proven. 609 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2022-07-19 17:26:45,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:45,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611811111] [2022-07-19 17:26:45,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611811111] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:26:45,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476501076] [2022-07-19 17:26:45,405 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 17:26:45,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:45,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:45,406 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) [2022-07-19 17:26:45,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 17:26:45,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 17:26:45,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:26:45,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-19 17:26:45,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:26:45,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 1016 proven. 196 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-07-19 17:26:45,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:26:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 264 proven. 632 refuted. 0 times theorem prover too weak. 845 trivial. 0 not checked. [2022-07-19 17:26:47,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476501076] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:26:47,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:26:47,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 21] total 27 [2022-07-19 17:26:47,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998301065] [2022-07-19 17:26:47,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:26:47,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-19 17:26:47,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:47,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-19 17:26:47,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2022-07-19 17:26:47,326 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand has 27 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) [2022-07-19 17:26:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:47,714 INFO L93 Difference]: Finished difference Result 152 states and 268 transitions. [2022-07-19 17:26:47,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 17:26:47,715 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) Word has length 183 [2022-07-19 17:26:47,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:47,718 INFO L225 Difference]: With dead ends: 152 [2022-07-19 17:26:47,718 INFO L226 Difference]: Without dead ends: 90 [2022-07-19 17:26:47,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 408 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2022-07-19 17:26:47,721 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 41 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:26:47,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 257 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:26:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-19 17:26:47,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-07-19 17:26:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 57 states have internal predecessors, (61), 14 states have call successors, (14), 5 states have call predecessors, (14), 14 states have return successors, (62), 22 states have call predecessors, (62), 14 states have call successors, (62) [2022-07-19 17:26:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 137 transitions. [2022-07-19 17:26:47,738 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 137 transitions. Word has length 183 [2022-07-19 17:26:47,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:47,739 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 137 transitions. [2022-07-19 17:26:47,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) [2022-07-19 17:26:47,740 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 137 transitions. [2022-07-19 17:26:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-19 17:26:47,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:47,745 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 16, 12, 11, 11, 11, 11, 11, 11, 11, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:26:47,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 17:26:47,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:47,962 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash 66624188, now seen corresponding path program 5 times [2022-07-19 17:26:47,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:47,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585663340] [2022-07-19 17:26:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:47,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:26:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:26:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 17:26:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:26:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 17:26:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:26:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:26:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 17:26:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1872 backedges. 327 proven. 605 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2022-07-19 17:26:48,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:48,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585663340] [2022-07-19 17:26:48,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585663340] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:26:48,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149173739] [2022-07-19 17:26:48,227 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 17:26:48,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:48,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:48,244 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) [2022-07-19 17:26:48,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 17:26:48,378 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-19 17:26:48,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:26:48,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 17:26:48,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:26:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1872 backedges. 1065 proven. 18 refuted. 0 times theorem prover too weak. 789 trivial. 0 not checked. [2022-07-19 17:26:48,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:26:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1872 backedges. 324 proven. 328 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2022-07-19 17:26:49,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149173739] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:26:49,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:26:49,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11] total 20 [2022-07-19 17:26:49,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408775710] [2022-07-19 17:26:49,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:26:49,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 17:26:49,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:49,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 17:26:49,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-07-19 17:26:49,236 INFO L87 Difference]: Start difference. First operand 85 states and 137 transitions. Second operand has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 9 states have call successors, (20), 2 states have call predecessors, (20), 9 states have return successors, (30), 13 states have call predecessors, (30), 9 states have call successors, (30) [2022-07-19 17:26:49,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:49,416 INFO L93 Difference]: Finished difference Result 203 states and 456 transitions. [2022-07-19 17:26:49,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 17:26:49,417 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 9 states have call successors, (20), 2 states have call predecessors, (20), 9 states have return successors, (30), 13 states have call predecessors, (30), 9 states have call successors, (30) Word has length 190 [2022-07-19 17:26:49,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:49,419 INFO L225 Difference]: With dead ends: 203 [2022-07-19 17:26:49,419 INFO L226 Difference]: Without dead ends: 123 [2022-07-19 17:26:49,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 435 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2022-07-19 17:26:49,421 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 95 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:26:49,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 166 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:26:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-19 17:26:49,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-07-19 17:26:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.1) internal successors, (77), 71 states have internal predecessors, (77), 19 states have call successors, (19), 9 states have call predecessors, (19), 15 states have return successors, (77), 24 states have call predecessors, (77), 19 states have call successors, (77) [2022-07-19 17:26:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 173 transitions. [2022-07-19 17:26:49,460 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 173 transitions. Word has length 190 [2022-07-19 17:26:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:49,460 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 173 transitions. [2022-07-19 17:26:49,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 9 states have call successors, (20), 2 states have call predecessors, (20), 9 states have return successors, (30), 13 states have call predecessors, (30), 9 states have call successors, (30) [2022-07-19 17:26:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 173 transitions. [2022-07-19 17:26:49,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-19 17:26:49,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:49,463 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 12, 9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:26:49,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 17:26:49,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:49,681 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:49,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:49,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1294012555, now seen corresponding path program 6 times [2022-07-19 17:26:49,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:49,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374468740] [2022-07-19 17:26:49,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:49,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:26:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:26:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 17:26:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:26:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:26:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 158 proven. 354 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2022-07-19 17:26:49,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:49,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374468740] [2022-07-19 17:26:49,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374468740] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:26:49,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55789207] [2022-07-19 17:26:49,927 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 17:26:49,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:49,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:49,929 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:26:49,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 17:26:50,084 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-07-19 17:26:50,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:26:50,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 17:26:50,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:26:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 595 proven. 114 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2022-07-19 17:26:50,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:26:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 160 proven. 360 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2022-07-19 17:26:51,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55789207] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:26:51,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:26:51,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 23 [2022-07-19 17:26:51,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150222048] [2022-07-19 17:26:51,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:26:51,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-19 17:26:51,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:51,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-19 17:26:51,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-07-19 17:26:51,239 INFO L87 Difference]: Start difference. First operand 105 states and 173 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 20 states have internal predecessors, (69), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2022-07-19 17:26:51,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:51,639 INFO L93 Difference]: Finished difference Result 201 states and 358 transitions. [2022-07-19 17:26:51,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-19 17:26:51,640 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 20 states have internal predecessors, (69), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) Word has length 144 [2022-07-19 17:26:51,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:51,641 INFO L225 Difference]: With dead ends: 201 [2022-07-19 17:26:51,641 INFO L226 Difference]: Without dead ends: 105 [2022-07-19 17:26:51,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 320 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=433, Invalid=1459, Unknown=0, NotChecked=0, Total=1892 [2022-07-19 17:26:51,643 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 40 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:26:51,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 177 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:26:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-19 17:26:51,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-19 17:26:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.1) internal successors, (77), 71 states have internal predecessors, (77), 19 states have call successors, (19), 9 states have call predecessors, (19), 15 states have return successors, (69), 24 states have call predecessors, (69), 19 states have call successors, (69) [2022-07-19 17:26:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 165 transitions. [2022-07-19 17:26:51,652 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 165 transitions. Word has length 144 [2022-07-19 17:26:51,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:51,652 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 165 transitions. [2022-07-19 17:26:51,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 20 states have internal predecessors, (69), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2022-07-19 17:26:51,652 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 165 transitions. [2022-07-19 17:26:51,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-19 17:26:51,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:51,656 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:26:51,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 17:26:51,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:51,877 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:51,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:51,877 INFO L85 PathProgramCache]: Analyzing trace with hash 332854534, now seen corresponding path program 7 times [2022-07-19 17:26:51,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:51,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653636714] [2022-07-19 17:26:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:51,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:26:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:26:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:26:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 17:26:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:26:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:26:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 17:26:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:26:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 600 proven. 156 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2022-07-19 17:26:52,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:52,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653636714] [2022-07-19 17:26:52,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653636714] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:26:52,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349194393] [2022-07-19 17:26:52,435 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 17:26:52,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:52,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:52,451 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:26:52,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 17:26:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:52,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-19 17:26:52,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:26:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 583 proven. 158 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2022-07-19 17:26:52,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:26:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 597 proven. 189 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2022-07-19 17:26:54,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349194393] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:26:54,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:26:54,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 36 [2022-07-19 17:26:54,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247047934] [2022-07-19 17:26:54,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:26:54,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-19 17:26:54,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:54,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-19 17:26:54,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2022-07-19 17:26:54,052 INFO L87 Difference]: Start difference. First operand 105 states and 165 transitions. Second operand has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) [2022-07-19 17:26:55,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:55,719 INFO L93 Difference]: Finished difference Result 247 states and 510 transitions. [2022-07-19 17:26:55,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-19 17:26:55,720 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) Word has length 183 [2022-07-19 17:26:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:55,723 INFO L225 Difference]: With dead ends: 247 [2022-07-19 17:26:55,723 INFO L226 Difference]: Without dead ends: 243 [2022-07-19 17:26:55,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 404 SyntacticMatches, 9 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=610, Invalid=4792, Unknown=0, NotChecked=0, Total=5402 [2022-07-19 17:26:55,727 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 78 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 17:26:55,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 464 Invalid, 2154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 17:26:55,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-19 17:26:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 127. [2022-07-19 17:26:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 85 states have internal predecessors, (91), 21 states have call successors, (21), 9 states have call predecessors, (21), 21 states have return successors, (107), 32 states have call predecessors, (107), 21 states have call successors, (107) [2022-07-19 17:26:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 219 transitions. [2022-07-19 17:26:55,758 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 219 transitions. Word has length 183 [2022-07-19 17:26:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:55,758 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 219 transitions. [2022-07-19 17:26:55,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) [2022-07-19 17:26:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 219 transitions. [2022-07-19 17:26:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-19 17:26:55,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:55,760 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:26:55,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 17:26:55,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-19 17:26:55,979 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:55,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:55,979 INFO L85 PathProgramCache]: Analyzing trace with hash -860565711, now seen corresponding path program 8 times [2022-07-19 17:26:55,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:55,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039668290] [2022-07-19 17:26:55,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:55,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:26:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:26:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:26:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 17:26:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:26:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:26:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 17:26:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 503 proven. 360 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2022-07-19 17:26:56,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:56,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039668290] [2022-07-19 17:26:56,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039668290] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:26:56,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879965331] [2022-07-19 17:26:56,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 17:26:56,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:56,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:56,318 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:26:56,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 17:26:56,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 17:26:56,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:26:56,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-19 17:26:56,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:26:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2022-07-19 17:26:56,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:26:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2022-07-19 17:26:58,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879965331] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:26:58,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:26:58,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 28] total 34 [2022-07-19 17:26:58,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104736781] [2022-07-19 17:26:58,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:26:58,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 17:26:58,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:58,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 17:26:58,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2022-07-19 17:26:58,553 INFO L87 Difference]: Start difference. First operand 127 states and 219 transitions. Second operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2022-07-19 17:26:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:58,921 INFO L93 Difference]: Finished difference Result 277 states and 584 transitions. [2022-07-19 17:26:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-19 17:26:58,922 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) Word has length 170 [2022-07-19 17:26:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:58,924 INFO L225 Difference]: With dead ends: 277 [2022-07-19 17:26:58,924 INFO L226 Difference]: Without dead ends: 159 [2022-07-19 17:26:58,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 376 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=826, Invalid=3206, Unknown=0, NotChecked=0, Total=4032 [2022-07-19 17:26:58,927 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 30 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:26:58,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 253 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:26:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-19 17:26:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-07-19 17:26:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 104 states have (on average 1.0673076923076923) internal successors, (111), 105 states have internal predecessors, (111), 25 states have call successors, (25), 9 states have call predecessors, (25), 29 states have return successors, (150), 44 states have call predecessors, (150), 25 states have call successors, (150) [2022-07-19 17:26:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 286 transitions. [2022-07-19 17:26:58,977 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 286 transitions. Word has length 170 [2022-07-19 17:26:58,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:58,978 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 286 transitions. [2022-07-19 17:26:58,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2022-07-19 17:26:58,978 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 286 transitions. [2022-07-19 17:26:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-19 17:26:58,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:58,980 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 16, 13, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:26:59,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 17:26:59,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 17:26:59,197 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:59,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:59,198 INFO L85 PathProgramCache]: Analyzing trace with hash 530318069, now seen corresponding path program 9 times [2022-07-19 17:26:59,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:59,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243822104] [2022-07-19 17:26:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:26:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:26:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:26:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 17:26:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:26:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:26:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 17:26:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:26:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 17:26:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 665 proven. 517 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2022-07-19 17:26:59,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:59,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243822104] [2022-07-19 17:26:59,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243822104] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:26:59,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569682670] [2022-07-19 17:26:59,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 17:26:59,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:59,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:59,741 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:26:59,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 17:26:59,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2022-07-19 17:26:59,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:26:59,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-19 17:26:59,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:00,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 647 proven. 519 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2022-07-19 17:27:00,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 685 proven. 580 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2022-07-19 17:27:03,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569682670] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:03,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:03,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 32] total 38 [2022-07-19 17:27:03,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905972359] [2022-07-19 17:27:03,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:03,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-19 17:27:03,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:03,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-19 17:27:03,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1209, Unknown=0, NotChecked=0, Total=1406 [2022-07-19 17:27:03,401 INFO L87 Difference]: Start difference. First operand 159 states and 286 transitions. Second operand has 38 states, 38 states have (on average 2.5) internal successors, (95), 34 states have internal predecessors, (95), 21 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (45), 18 states have call predecessors, (45), 21 states have call successors, (45) [2022-07-19 17:27:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:03,869 INFO L93 Difference]: Finished difference Result 331 states and 698 transitions. [2022-07-19 17:27:03,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-19 17:27:03,869 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 34 states have internal predecessors, (95), 21 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (45), 18 states have call predecessors, (45), 21 states have call successors, (45) Word has length 196 [2022-07-19 17:27:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:03,872 INFO L225 Difference]: With dead ends: 331 [2022-07-19 17:27:03,872 INFO L226 Difference]: Without dead ends: 181 [2022-07-19 17:27:03,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 434 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=759, Invalid=3147, Unknown=0, NotChecked=0, Total=3906 [2022-07-19 17:27:03,874 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 114 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:03,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 335 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:27:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-19 17:27:03,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 164. [2022-07-19 17:27:03,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 107 states have (on average 1.0654205607476634) internal successors, (114), 108 states have internal predecessors, (114), 26 states have call successors, (26), 9 states have call predecessors, (26), 30 states have return successors, (154), 46 states have call predecessors, (154), 26 states have call successors, (154) [2022-07-19 17:27:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 294 transitions. [2022-07-19 17:27:03,899 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 294 transitions. Word has length 196 [2022-07-19 17:27:03,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:03,900 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 294 transitions. [2022-07-19 17:27:03,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 34 states have internal predecessors, (95), 21 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (45), 18 states have call predecessors, (45), 21 states have call successors, (45) [2022-07-19 17:27:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 294 transitions. [2022-07-19 17:27:03,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2022-07-19 17:27:03,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:03,908 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 24, 20, 19, 19, 19, 19, 19, 19, 19, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:03,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:04,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-19 17:27:04,140 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:04,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:04,140 INFO L85 PathProgramCache]: Analyzing trace with hash 462778554, now seen corresponding path program 10 times [2022-07-19 17:27:04,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:04,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838431841] [2022-07-19 17:27:04,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:04,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:27:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:27:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:27:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:27:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:27:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:27:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 17:27:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:27:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:27:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:27:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 17:27:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:27:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-19 17:27:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:27:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:27:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:27:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 17:27:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:27:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 17:27:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 17:27:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 233 proven. 548 refuted. 0 times theorem prover too weak. 3983 trivial. 0 not checked. [2022-07-19 17:27:04,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:04,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838431841] [2022-07-19 17:27:04,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838431841] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:04,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097883606] [2022-07-19 17:27:04,459 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 17:27:04,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:04,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:04,461 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:04,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 17:27:04,774 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 17:27:04,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:27:04,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 17:27:04,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 239 proven. 542 refuted. 0 times theorem prover too weak. 3983 trivial. 0 not checked. [2022-07-19 17:27:04,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 239 proven. 557 refuted. 0 times theorem prover too weak. 3968 trivial. 0 not checked. [2022-07-19 17:27:05,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097883606] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:05,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:05,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2022-07-19 17:27:05,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351024243] [2022-07-19 17:27:05,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:05,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 17:27:05,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:05,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 17:27:05,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-19 17:27:05,366 INFO L87 Difference]: Start difference. First operand 164 states and 294 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 11 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2022-07-19 17:27:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:05,481 INFO L93 Difference]: Finished difference Result 168 states and 297 transitions. [2022-07-19 17:27:05,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 17:27:05,482 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 11 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) Word has length 294 [2022-07-19 17:27:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:05,486 INFO L225 Difference]: With dead ends: 168 [2022-07-19 17:27:05,486 INFO L226 Difference]: Without dead ends: 164 [2022-07-19 17:27:05,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 669 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2022-07-19 17:27:05,487 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:05,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 114 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:27:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-19 17:27:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2022-07-19 17:27:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 99 states have (on average 1.0707070707070707) internal successors, (106), 100 states have internal predecessors, (106), 26 states have call successors, (26), 9 states have call predecessors, (26), 26 states have return successors, (118), 42 states have call predecessors, (118), 26 states have call successors, (118) [2022-07-19 17:27:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2022-07-19 17:27:05,499 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 294 [2022-07-19 17:27:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:05,499 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2022-07-19 17:27:05,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 11 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2022-07-19 17:27:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2022-07-19 17:27:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-07-19 17:27:05,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:05,502 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 23, 18, 17, 17, 17, 17, 17, 17, 17, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:05,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:05,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-19 17:27:05,722 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:05,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:05,722 INFO L85 PathProgramCache]: Analyzing trace with hash 582117116, now seen corresponding path program 11 times [2022-07-19 17:27:05,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:05,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544426144] [2022-07-19 17:27:05,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:05,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:05,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:27:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:05,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:05,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:05,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:05,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:05,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:05,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:05,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:05,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:27:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:05,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:27:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:27:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:27:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:27:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 17:27:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:27:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:27:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:27:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 17:27:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 17:27:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:27:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 17:27:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-19 17:27:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 17:27:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:27:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 17:27:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 238 proven. 956 refuted. 0 times theorem prover too weak. 2913 trivial. 0 not checked. [2022-07-19 17:27:06,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:06,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544426144] [2022-07-19 17:27:06,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544426144] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:06,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911520895] [2022-07-19 17:27:06,095 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 17:27:06,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:06,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:06,112 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:06,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 17:27:06,406 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2022-07-19 17:27:06,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:27:06,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-19 17:27:06,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 2428 proven. 401 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2022-07-19 17:27:06,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:10,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 700 proven. 1204 refuted. 0 times theorem prover too weak. 2203 trivial. 0 not checked. [2022-07-19 17:27:10,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911520895] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:10,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:10,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 29] total 40 [2022-07-19 17:27:10,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608472866] [2022-07-19 17:27:10,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:10,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-19 17:27:10,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:10,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-19 17:27:10,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1398, Unknown=0, NotChecked=0, Total=1560 [2022-07-19 17:27:10,506 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand has 40 states, 40 states have (on average 2.525) internal successors, (101), 35 states have internal predecessors, (101), 20 states have call successors, (27), 2 states have call predecessors, (27), 20 states have return successors, (47), 23 states have call predecessors, (47), 20 states have call successors, (47) [2022-07-19 17:27:11,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:11,622 INFO L93 Difference]: Finished difference Result 294 states and 558 transitions. [2022-07-19 17:27:11,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-07-19 17:27:11,623 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.525) internal successors, (101), 35 states have internal predecessors, (101), 20 states have call successors, (27), 2 states have call predecessors, (27), 20 states have return successors, (47), 23 states have call predecessors, (47), 20 states have call successors, (47) Word has length 275 [2022-07-19 17:27:11,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:11,623 INFO L225 Difference]: With dead ends: 294 [2022-07-19 17:27:11,624 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 17:27:11,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 601 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1969, Invalid=8333, Unknown=0, NotChecked=0, Total=10302 [2022-07-19 17:27:11,628 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 95 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:11,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 280 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 17:27:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 17:27:11,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 17:27:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-07-19 17:27:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 17:27:11,629 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 275 [2022-07-19 17:27:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:11,630 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 17:27:11,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.525) internal successors, (101), 35 states have internal predecessors, (101), 20 states have call successors, (27), 2 states have call predecessors, (27), 20 states have return successors, (47), 23 states have call predecessors, (47), 20 states have call successors, (47) [2022-07-19 17:27:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 17:27:11,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 17:27:11,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 17:27:11,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:11,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 17:27:11,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 17:27:14,783 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 17:27:14,784 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 17:27:14,784 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 17:27:14,784 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 33) no Hoare annotation was computed. [2022-07-19 17:27:14,784 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 17:27:14,784 INFO L902 garLoopResultBuilder]: At program point L27(lines 27 47) the Hoare annotation is: true [2022-07-19 17:27:14,784 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2022-07-19 17:27:14,784 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2022-07-19 17:27:14,785 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2022-07-19 17:27:14,785 INFO L902 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: true [2022-07-19 17:27:14,785 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-07-19 17:27:14,785 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 40) no Hoare annotation was computed. [2022-07-19 17:27:14,786 INFO L899 garLoopResultBuilder]: For program point ackermannEXIT(lines 16 24) no Hoare annotation was computed. [2022-07-19 17:27:14,787 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (and (or (not (<= 1 |ackermann_#in~n|)) (not (= |ackermann_#in~m| 0)) (not (< |ackermann_#in~n| 2))) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2022-07-19 17:27:14,787 INFO L899 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2022-07-19 17:27:14,787 INFO L902 garLoopResultBuilder]: At program point ackermannENTRY(lines 16 24) the Hoare annotation is: true [2022-07-19 17:27:14,787 INFO L895 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2022-07-19 17:27:14,788 INFO L895 garLoopResultBuilder]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse3 (<= 1 |ackermann_#in~n|)) (.cse5 (<= |ackermann_#in~n| 1)) (.cse7 (<= |ackermann_#t~ret5| 5)) (.cse9 (<= 3 |ackermann_#in~n|)) (.cse2 (<= 3 |ackermann_#t~ret5|)) (.cse8 (<= 2 |ackermann_#in~n|)) (.cse4 (<= |ackermann_#t~ret5| 3)) (.cse6 (<= 5 |ackermann_#t~ret5|)) (.cse0 (= ackermann_~n |ackermann_#in~n|)) (.cse1 (= ackermann_~m |ackermann_#in~m|))) (and (or (not (<= |ackermann_#in~m| 0)) (and (= |ackermann_#in~m| 0) .cse0 .cse1)) (or (and .cse2 .cse0 (<= ackermann_~m 2) .cse3 .cse1 .cse4 .cse5) (and (<= 3 ackermann_~m) .cse6 .cse0 .cse3 .cse1) (not (<= 2 |ackermann_#in~m|)) (and .cse6 .cse7 .cse0 .cse8 .cse1) (and .cse6 .cse0 .cse9 .cse1)) (or (and (<= 1 ackermann_~m) (<= |ackermann_#t~ret5| 2) .cse0 (<= 2 |ackermann_#t~ret5|) .cse3 (<= ackermann_~m 1) .cse5) (and .cse6 .cse7 .cse0 (<= 4 |ackermann_#in~n|) .cse1 (<= |ackermann_#in~n| 4)) (not (<= |ackermann_#in~m| 1)) (and (<= |ackermann_#in~n| 3) (<= |ackermann_#t~ret5| 4) .cse0 .cse9 .cse1 (<= 4 |ackermann_#t~ret5|)) (and (<= |ackermann_#in~n| 2) .cse2 .cse0 .cse8 .cse1 .cse4) (and .cse6 .cse0 .cse1 (<= 6 |ackermann_#in~n|)) (not (<= 1 |ackermann_#in~m|)) (and (<= 6 |ackermann_#t~ret5|) .cse0 (<= |ackermann_#t~ret5| 6) .cse1 (<= 5 |ackermann_#in~n|))))) [2022-07-19 17:27:14,788 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 22) no Hoare annotation was computed. [2022-07-19 17:27:14,788 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2022-07-19 17:27:14,788 INFO L899 garLoopResultBuilder]: For program point L23-3(line 23) no Hoare annotation was computed. [2022-07-19 17:27:14,788 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 19) no Hoare annotation was computed. [2022-07-19 17:27:14,788 INFO L899 garLoopResultBuilder]: For program point ackermannFINAL(lines 16 24) no Hoare annotation was computed. [2022-07-19 17:27:14,790 INFO L356 BasicCegarLoop]: Path program histogram: [11, 1, 1] [2022-07-19 17:27:14,792 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 17:27:14,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 05:27:14 BoogieIcfgContainer [2022-07-19 17:27:14,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 17:27:14,797 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 17:27:14,797 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 17:27:14,797 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 17:27:14,798 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:26:36" (3/4) ... [2022-07-19 17:27:14,799 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 17:27:14,803 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2022-07-19 17:27:14,817 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-19 17:27:14,817 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-19 17:27:14,817 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 17:27:14,817 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 17:27:14,860 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 17:27:14,860 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 17:27:14,860 INFO L158 Benchmark]: Toolchain (without parser) took 38537.20ms. Allocated memory was 125.8MB in the beginning and 677.4MB in the end (delta: 551.6MB). Free memory was 96.1MB in the beginning and 436.8MB in the end (delta: -340.6MB). Peak memory consumption was 211.1MB. Max. memory is 16.1GB. [2022-07-19 17:27:14,861 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:27:14,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.21ms. Allocated memory is still 125.8MB. Free memory was 96.1MB in the beginning and 99.3MB in the end (delta: -3.1MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2022-07-19 17:27:14,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.94ms. Allocated memory is still 125.8MB. Free memory was 99.3MB in the beginning and 97.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 17:27:14,862 INFO L158 Benchmark]: Boogie Preprocessor took 21.55ms. Allocated memory is still 125.8MB. Free memory was 97.9MB in the beginning and 96.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:27:14,862 INFO L158 Benchmark]: RCFGBuilder took 239.90ms. Allocated memory is still 125.8MB. Free memory was 96.9MB in the beginning and 87.1MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 17:27:14,863 INFO L158 Benchmark]: TraceAbstraction took 38002.72ms. Allocated memory was 125.8MB in the beginning and 677.4MB in the end (delta: 551.6MB). Free memory was 86.8MB in the beginning and 439.9MB in the end (delta: -353.2MB). Peak memory consumption was 336.4MB. Max. memory is 16.1GB. [2022-07-19 17:27:14,863 INFO L158 Benchmark]: Witness Printer took 63.10ms. Allocated memory is still 677.4MB. Free memory was 439.9MB in the beginning and 436.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 17:27:14,869 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.17ms. Allocated memory is still 125.8MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.21ms. Allocated memory is still 125.8MB. Free memory was 96.1MB in the beginning and 99.3MB in the end (delta: -3.1MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.94ms. Allocated memory is still 125.8MB. Free memory was 99.3MB in the beginning and 97.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.55ms. Allocated memory is still 125.8MB. Free memory was 97.9MB in the beginning and 96.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 239.90ms. Allocated memory is still 125.8MB. Free memory was 96.9MB in the beginning and 87.1MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 38002.72ms. Allocated memory was 125.8MB in the beginning and 677.4MB in the end (delta: 551.6MB). Free memory was 86.8MB in the beginning and 439.9MB in the end (delta: -353.2MB). Peak memory consumption was 336.4MB. Max. memory is 16.1GB. * Witness Printer took 63.10ms. Allocated memory is still 677.4MB. Free memory was 439.9MB in the beginning and 436.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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 - PositiveResult [Line: 45]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.0s, OverallIterations: 13, TraceHistogramMax: 44, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 743 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 688 mSDsluCounter, 2747 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2391 mSDsCounter, 1549 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7353 IncrementalHoareTripleChecker+Invalid, 8902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1549 mSolverCounterUnsat, 356 mSDtfsCounter, 7353 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4864 GetRequests, 4271 SyntacticMatches, 43 SemanticMatches, 550 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7655 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=11, InterpolantAutomatonStates: 323, 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, 13 MinimizatonAttempts, 186 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 690 PreInvPairs, 1887 NumberOfFragments, 238 HoareAnnotationTreeSize, 690 FomulaSimplifications, 19535 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 6 FomulaSimplificationsInter, 24810 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 23.3s InterpolantComputationTime, 3856 NumberOfCodeBlocks, 3583 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 5741 ConstructedInterpolants, 0 QuantifiedInterpolants, 11028 SizeOfPredicates, 91 NumberOfNonLiveVariables, 5048 ConjunctsInSsa, 326 ConjunctsInUnsatCore, 37 InterpolantComputations, 1 PerfectInterpolantSequences, 48867/60372 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-19 17:27:14,915 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 Writing output log to file Ultimate.log Result: TRUE