./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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-simple/id_i25_o25-2.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 76955366716759eb9478710f6ef46e3de93d252b9c3177ff4beaca56ee5c75a7 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 14:49:58,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 14:49:58,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 14:49:58,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 14:49:58,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 14:49:58,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 14:49:58,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 14:49:58,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 14:49:58,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 14:49:58,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 14:49:58,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 14:49:58,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 14:49:58,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 14:49:58,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 14:49:58,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 14:49:58,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 14:49:58,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 14:49:58,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 14:49:58,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 14:49:58,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 14:49:58,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 14:49:58,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 14:49:58,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 14:49:58,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 14:49:58,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 14:49:58,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 14:49:58,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 14:49:58,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 14:49:58,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 14:49:58,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 14:49:58,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 14:49:58,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 14:49:58,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 14:49:58,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 14:49:58,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 14:49:58,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 14:49:58,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 14:49:58,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 14:49:58,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 14:49:58,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 14:49:58,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 14:49:58,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 14:49:58,873 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 14:49:58,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 14:49:58,878 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 14:49:58,878 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 14:49:58,878 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 14:49:58,879 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 14:49:58,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 14:49:58,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 14:49:58,879 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 14:49:58,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 14:49:58,880 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 14:49:58,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 14:49:58,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 14:49:58,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 14:49:58,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 14:49:58,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 14:49:58,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 14:49:58,881 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 14:49:58,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 14:49:58,881 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 14:49:58,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 14:49:58,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 14:49:58,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 14:49:58,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 14:49:58,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 14:49:58,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 14:49:58,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 14:49:58,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 14:49:58,883 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 14:49:58,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 14:49:58,883 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 14:49:58,883 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 14:49:58,884 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 14:49:58,884 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 14:49:58,884 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 -> 76955366716759eb9478710f6ef46e3de93d252b9c3177ff4beaca56ee5c75a7 [2021-12-14 14:49:59,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 14:49:59,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 14:49:59,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 14:49:59,058 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 14:49:59,058 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 14:49:59,059 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2021-12-14 14:49:59,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4cbd09d4/fdd3aa3aed754ac5ba31ad34cf56ae08/FLAG03a75b253 [2021-12-14 14:49:59,497 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 14:49:59,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2021-12-14 14:49:59,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4cbd09d4/fdd3aa3aed754ac5ba31ad34cf56ae08/FLAG03a75b253 [2021-12-14 14:49:59,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4cbd09d4/fdd3aa3aed754ac5ba31ad34cf56ae08 [2021-12-14 14:49:59,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 14:49:59,521 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 14:49:59,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 14:49:59,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 14:49:59,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 14:49:59,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:49:59" (1/1) ... [2021-12-14 14:49:59,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b700587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:59, skipping insertion in model container [2021-12-14 14:49:59,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:49:59" (1/1) ... [2021-12-14 14:49:59,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 14:49:59,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 14:49:59,670 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-simple/id_i25_o25-2.c[454,467] [2021-12-14 14:49:59,676 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 14:49:59,680 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 14:49:59,690 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-simple/id_i25_o25-2.c[454,467] [2021-12-14 14:49:59,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 14:49:59,698 INFO L208 MainTranslator]: Completed translation [2021-12-14 14:49:59,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:59 WrapperNode [2021-12-14 14:49:59,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 14:49:59,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 14:49:59,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 14:49:59,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 14:49:59,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:59" (1/1) ... [2021-12-14 14:49:59,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:59" (1/1) ... [2021-12-14 14:49:59,716 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2021-12-14 14:49:59,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 14:49:59,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 14:49:59,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 14:49:59,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 14:49:59,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:59" (1/1) ... [2021-12-14 14:49:59,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:59" (1/1) ... [2021-12-14 14:49:59,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:59" (1/1) ... [2021-12-14 14:49:59,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:59" (1/1) ... [2021-12-14 14:49:59,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:59" (1/1) ... [2021-12-14 14:49:59,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:59" (1/1) ... [2021-12-14 14:49:59,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:59" (1/1) ... [2021-12-14 14:49:59,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 14:49:59,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 14:49:59,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 14:49:59,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 14:49:59,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:59" (1/1) ... [2021-12-14 14:49:59,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 14:49:59,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:49:59,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 14:49:59,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 14:49:59,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 14:49:59,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 14:49:59,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 14:49:59,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 14:49:59,775 INFO L130 BoogieDeclarations]: Found specification of procedure id [2021-12-14 14:49:59,775 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2021-12-14 14:49:59,811 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 14:49:59,812 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 14:49:59,884 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 14:49:59,888 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 14:49:59,888 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-14 14:49:59,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:49:59 BoogieIcfgContainer [2021-12-14 14:49:59,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 14:49:59,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 14:49:59,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 14:49:59,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 14:49:59,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:49:59" (1/3) ... [2021-12-14 14:49:59,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c772d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:49:59, skipping insertion in model container [2021-12-14 14:49:59,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:49:59" (2/3) ... [2021-12-14 14:49:59,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c772d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:49:59, skipping insertion in model container [2021-12-14 14:49:59,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:49:59" (3/3) ... [2021-12-14 14:49:59,895 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2021-12-14 14:49:59,898 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 14:49:59,898 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 14:49:59,942 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 14:49:59,946 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 14:49:59,947 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 14:49:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 14:49:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 14:49:59,958 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:49:59,958 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:49:59,959 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:49:59,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:49:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2021-12-14 14:49:59,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:49:59,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316505402] [2021-12-14 14:49:59,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:49:59,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:50:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:00,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:50:00,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:50:00,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316505402] [2021-12-14 14:50:00,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316505402] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:50:00,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:50:00,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 14:50:00,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496682261] [2021-12-14 14:50:00,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:50:00,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 14:50:00,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:50:00,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 14:50:00,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 14:50:00,205 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-12-14 14:50:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:50:00,227 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2021-12-14 14:50:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 14:50:00,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2021-12-14 14:50:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:50:00,233 INFO L225 Difference]: With dead ends: 28 [2021-12-14 14:50:00,234 INFO L226 Difference]: Without dead ends: 15 [2021-12-14 14:50:00,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 14:50:00,238 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 14:50:00,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 55 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:50:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-14 14:50:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-14 14:50:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 14:50:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-12-14 14:50:00,271 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2021-12-14 14:50:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:50:00,271 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-12-14 14:50:00,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-12-14 14:50:00,272 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2021-12-14 14:50:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 14:50:00,274 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:50:00,274 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:50:00,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 14:50:00,275 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:50:00,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:50:00,279 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2021-12-14 14:50:00,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:50:00,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504033152] [2021-12-14 14:50:00,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:50:00,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:50:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:00,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:00,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 14:50:00,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:50:00,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504033152] [2021-12-14 14:50:00,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504033152] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:50:00,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627391874] [2021-12-14 14:50:00,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:50:00,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:50:00,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:50:00,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:50:00,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 14:50:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:00,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 14:50:00,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:50:00,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 14:50:00,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:50:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 14:50:00,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627391874] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:50:00,594 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:50:00,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2021-12-14 14:50:00,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915008523] [2021-12-14 14:50:00,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:50:00,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 14:50:00,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:50:00,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 14:50:00,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-14 14:50:00,596 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 14:50:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:50:00,625 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2021-12-14 14:50:00,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 14:50:00,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 16 [2021-12-14 14:50:00,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:50:00,626 INFO L225 Difference]: With dead ends: 22 [2021-12-14 14:50:00,626 INFO L226 Difference]: Without dead ends: 18 [2021-12-14 14:50:00,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-14 14:50:00,628 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 14:50:00,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:50:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-12-14 14:50:00,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-14 14:50:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 14:50:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2021-12-14 14:50:00,631 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2021-12-14 14:50:00,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:50:00,632 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2021-12-14 14:50:00,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 14:50:00,632 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2021-12-14 14:50:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 14:50:00,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:50:00,633 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:50:00,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 14:50:00,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:50:00,862 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:50:00,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:50:00,862 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2021-12-14 14:50:00,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:50:00,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867538982] [2021-12-14 14:50:00,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:50:00,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:50:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:00,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:00,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:00,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 14:50:00,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:50:00,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867538982] [2021-12-14 14:50:00,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867538982] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:50:00,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333097765] [2021-12-14 14:50:00,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 14:50:00,938 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:50:00,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:50:00,939 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:50:00,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 14:50:00,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 14:50:00,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:50:00,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 14:50:00,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:50:01,018 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 14:50:01,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:50:01,355 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 14:50:01,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333097765] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:50:01,355 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:50:01,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 13 [2021-12-14 14:50:01,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677410457] [2021-12-14 14:50:01,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:50:01,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 14:50:01,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:50:01,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 14:50:01,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-12-14 14:50:01,357 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2021-12-14 14:50:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:50:01,407 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2021-12-14 14:50:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 14:50:01,408 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 22 [2021-12-14 14:50:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:50:01,409 INFO L225 Difference]: With dead ends: 25 [2021-12-14 14:50:01,409 INFO L226 Difference]: Without dead ends: 21 [2021-12-14 14:50:01,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-12-14 14:50:01,412 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 14:50:01,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 48 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:50:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-14 14:50:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-14 14:50:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 14:50:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-12-14 14:50:01,423 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2021-12-14 14:50:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:50:01,423 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-12-14 14:50:01,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2021-12-14 14:50:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-12-14 14:50:01,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 14:50:01,425 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:50:01,425 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:50:01,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 14:50:01,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-14 14:50:01,647 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:50:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:50:01,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2021-12-14 14:50:01,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:50:01,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323706849] [2021-12-14 14:50:01,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:50:01,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:50:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:01,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:01,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:01,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:01,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 14:50:01,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:50:01,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323706849] [2021-12-14 14:50:01,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323706849] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:50:01,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885197010] [2021-12-14 14:50:01,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 14:50:01,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:50:01,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:50:01,778 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:50:01,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 14:50:01,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 14:50:01,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:50:01,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 14:50:01,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:50:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 14:50:01,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:50:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 14:50:02,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885197010] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:50:02,229 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:50:02,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2021-12-14 14:50:02,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019234796] [2021-12-14 14:50:02,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:50:02,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-14 14:50:02,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:50:02,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-14 14:50:02,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2021-12-14 14:50:02,233 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-14 14:50:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:50:02,426 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2021-12-14 14:50:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-14 14:50:02,426 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) Word has length 28 [2021-12-14 14:50:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:50:02,427 INFO L225 Difference]: With dead ends: 39 [2021-12-14 14:50:02,427 INFO L226 Difference]: Without dead ends: 33 [2021-12-14 14:50:02,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1388, Unknown=0, NotChecked=0, Total=1640 [2021-12-14 14:50:02,432 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 14:50:02,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 80 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:50:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-14 14:50:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-12-14 14:50:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-14 14:50:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-12-14 14:50:02,437 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2021-12-14 14:50:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:50:02,438 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-12-14 14:50:02,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-14 14:50:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-12-14 14:50:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-14 14:50:02,439 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:50:02,439 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:50:02,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 14:50:02,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:50:02,655 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:50:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:50:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 4 times [2021-12-14 14:50:02,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:50:02,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849864536] [2021-12-14 14:50:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:50:02,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:50:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:02,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:02,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:02,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:02,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:02,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:02,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:02,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:02,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:02,814 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-12-14 14:50:02,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:50:02,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849864536] [2021-12-14 14:50:02,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849864536] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:50:02,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551850911] [2021-12-14 14:50:02,815 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 14:50:02,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:50:02,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:50:02,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:50:02,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 14:50:02,851 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 14:50:02,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:50:02,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-14 14:50:02,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:50:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-12-14 14:50:02,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:50:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-14 14:50:04,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551850911] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:50:04,494 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:50:04,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 23 [2021-12-14 14:50:04,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443873602] [2021-12-14 14:50:04,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:50:04,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-14 14:50:04,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:50:04,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-14 14:50:04,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2021-12-14 14:50:04,495 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2021-12-14 14:50:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:50:04,584 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2021-12-14 14:50:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 14:50:04,585 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) Word has length 52 [2021-12-14 14:50:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:50:04,586 INFO L225 Difference]: With dead ends: 40 [2021-12-14 14:50:04,586 INFO L226 Difference]: Without dead ends: 36 [2021-12-14 14:50:04,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=302, Invalid=628, Unknown=0, NotChecked=0, Total=930 [2021-12-14 14:50:04,587 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 92 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 14:50:04,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 91 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:50:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-14 14:50:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-12-14 14:50:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-14 14:50:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2021-12-14 14:50:04,591 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2021-12-14 14:50:04,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:50:04,591 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2021-12-14 14:50:04,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2021-12-14 14:50:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2021-12-14 14:50:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 14:50:04,592 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:50:04,593 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:50:04,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 14:50:04,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:50:04,793 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:50:04,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:50:04,794 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 5 times [2021-12-14 14:50:04,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:50:04,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762366116] [2021-12-14 14:50:04,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:50:04,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:50:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:04,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:04,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:04,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:04,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:04,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:04,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:04,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:04,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:04,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:04,976 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-12-14 14:50:04,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:50:04,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762366116] [2021-12-14 14:50:04,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762366116] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:50:04,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328633597] [2021-12-14 14:50:04,976 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 14:50:04,976 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:50:04,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:50:04,992 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:50:05,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 14:50:05,125 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-12-14 14:50:05,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:50:05,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-14 14:50:05,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:50:05,393 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-12-14 14:50:05,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:50:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-12-14 14:50:07,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328633597] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:50:07,247 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:50:07,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 21] total 51 [2021-12-14 14:50:07,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466734904] [2021-12-14 14:50:07,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:50:07,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-14 14:50:07,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:50:07,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-14 14:50:07,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2140, Unknown=0, NotChecked=0, Total=2550 [2021-12-14 14:50:07,249 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 33 states have internal predecessors, (68), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) [2021-12-14 14:50:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:50:07,785 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2021-12-14 14:50:07,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-14 14:50:07,785 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.36) internal successors, (68), 33 states have internal predecessors, (68), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) Word has length 58 [2021-12-14 14:50:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:50:07,786 INFO L225 Difference]: With dead ends: 69 [2021-12-14 14:50:07,786 INFO L226 Difference]: Without dead ends: 63 [2021-12-14 14:50:07,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1152, Invalid=6158, Unknown=0, NotChecked=0, Total=7310 [2021-12-14 14:50:07,789 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:50:07,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 161 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:50:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-14 14:50:07,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-14 14:50:07,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-14 14:50:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2021-12-14 14:50:07,795 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2021-12-14 14:50:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:50:07,795 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2021-12-14 14:50:07,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.36) internal successors, (68), 33 states have internal predecessors, (68), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) [2021-12-14 14:50:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2021-12-14 14:50:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-14 14:50:07,797 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:50:07,797 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:50:07,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 14:50:08,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:50:08,012 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:50:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:50:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2122437418, now seen corresponding path program 6 times [2021-12-14 14:50:08,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:50:08,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211561516] [2021-12-14 14:50:08,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:50:08,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:50:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 14:50:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:50:08,545 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2021-12-14 14:50:08,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:50:08,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211561516] [2021-12-14 14:50:08,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211561516] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:50:08,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779505082] [2021-12-14 14:50:08,546 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-14 14:50:08,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:50:08,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:50:08,547 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:50:08,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 14:50:08,709 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2021-12-14 14:50:08,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 14:50:08,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-14 14:50:08,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:50:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2021-12-14 14:50:09,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 14:50:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2021-12-14 14:50:21,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779505082] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 14:50:21,689 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 14:50:21,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 39, 39] total 75 [2021-12-14 14:50:21,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340927047] [2021-12-14 14:50:21,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 14:50:21,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2021-12-14 14:50:21,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:50:21,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-12-14 14:50:21,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=878, Invalid=4672, Unknown=0, NotChecked=0, Total=5550 [2021-12-14 14:50:21,693 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 49 states have internal predecessors, (101), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) [2021-12-14 14:50:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:50:22,607 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2021-12-14 14:50:22,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-12-14 14:50:22,608 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 49 states have internal predecessors, (101), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) Word has length 112 [2021-12-14 14:50:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:50:22,609 INFO L225 Difference]: With dead ends: 93 [2021-12-14 14:50:22,609 INFO L226 Difference]: Without dead ends: 87 [2021-12-14 14:50:22,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3864 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2558, Invalid=13192, Unknown=0, NotChecked=0, Total=15750 [2021-12-14 14:50:22,613 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:50:22,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 131 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:50:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-14 14:50:22,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-14 14:50:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 26 states have return successors, (27), 26 states have call predecessors, (27), 2 states have call successors, (27) [2021-12-14 14:50:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2021-12-14 14:50:22,647 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 112 [2021-12-14 14:50:22,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:50:22,649 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2021-12-14 14:50:22,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 49 states have internal predecessors, (101), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) [2021-12-14 14:50:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2021-12-14 14:50:22,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-14 14:50:22,654 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:50:22,654 INFO L514 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:50:22,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-14 14:50:22,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:50:22,854 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:50:22,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:50:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash -678635050, now seen corresponding path program 7 times [2021-12-14 14:50:22,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:50:22,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694611456] [2021-12-14 14:50:22,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:50:22,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:50:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 14:50:22,901 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 14:50:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 14:50:23,002 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 14:50:23,002 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 14:50:23,002 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 14:50:23,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 14:50:23,018 INFO L732 BasicCegarLoop]: Path program histogram: [7, 1] [2021-12-14 14:50:23,021 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 14:50:23,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 02:50:23 BoogieIcfgContainer [2021-12-14 14:50:23,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 14:50:23,103 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 14:50:23,103 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 14:50:23,103 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 14:50:23,103 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:49:59" (3/4) ... [2021-12-14 14:50:23,104 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 14:50:23,167 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 14:50:23,167 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 14:50:23,168 INFO L158 Benchmark]: Toolchain (without parser) took 23646.65ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 93.1MB in the beginning and 114.6MB in the end (delta: -21.5MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. [2021-12-14 14:50:23,168 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 74.3MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 14:50:23,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.22ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 93.1MB in the beginning and 142.7MB in the end (delta: -49.7MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2021-12-14 14:50:23,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.48ms. Allocated memory is still 167.8MB. Free memory was 142.7MB in the beginning and 141.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 14:50:23,168 INFO L158 Benchmark]: Boogie Preprocessor took 9.43ms. Allocated memory is still 167.8MB. Free memory was 141.5MB in the beginning and 140.5MB in the end (delta: 927.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 14:50:23,169 INFO L158 Benchmark]: RCFGBuilder took 162.04ms. Allocated memory is still 167.8MB. Free memory was 140.5MB in the beginning and 132.0MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 14:50:23,169 INFO L158 Benchmark]: TraceAbstraction took 23211.67ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 131.1MB in the beginning and 118.8MB in the end (delta: 12.3MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2021-12-14 14:50:23,169 INFO L158 Benchmark]: Witness Printer took 64.84ms. Allocated memory is still 243.3MB. Free memory was 118.8MB in the beginning and 114.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-14 14:50:23,170 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.19ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 74.3MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.22ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 93.1MB in the beginning and 142.7MB in the end (delta: -49.7MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.48ms. Allocated memory is still 167.8MB. Free memory was 142.7MB in the beginning and 141.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 9.43ms. Allocated memory is still 167.8MB. Free memory was 141.5MB in the beginning and 140.5MB in the end (delta: 927.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 162.04ms. Allocated memory is still 167.8MB. Free memory was 140.5MB in the beginning and 132.0MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23211.67ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 131.1MB in the beginning and 118.8MB in the end (delta: 12.3MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. * Witness Printer took 64.84ms. Allocated memory is still 243.3MB. Free memory was 118.8MB in the beginning and 114.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int input = 25; VAL [input=25] [L13] CALL, EXPR id(input) VAL [\old(x)=25] [L7] COND FALSE !(x==0) VAL [\old(x)=25, x=25] [L8] CALL, EXPR id(x-1) VAL [\old(x)=24] [L7] COND FALSE !(x==0) VAL [\old(x)=24, x=24] [L8] CALL, EXPR id(x-1) VAL [\old(x)=23] [L7] COND FALSE !(x==0) VAL [\old(x)=23, x=23] [L8] CALL, EXPR id(x-1) VAL [\old(x)=22] [L7] COND FALSE !(x==0) VAL [\old(x)=22, x=22] [L8] CALL, EXPR id(x-1) VAL [\old(x)=21] [L7] COND FALSE !(x==0) VAL [\old(x)=21, x=21] [L8] CALL, EXPR id(x-1) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=21, id(x-1)=20, x=21] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=22, id(x-1)=21, x=22] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=23, id(x-1)=22, x=23] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=24, id(x-1)=23, x=24] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=25, id(x-1)=24, x=25] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [id(input)=25, input=25] [L13] int result = id(input); [L14] COND TRUE result == 25 VAL [input=25, result=25] [L15] reach_error() VAL [input=25, result=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 8, TraceHistogramMax: 26, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 308 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 595 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 526 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 595 IncrementalHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 69 mSDtfsCounter, 595 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 835 GetRequests, 530 SyntacticMatches, 1 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6263 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=7, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 746 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 855 ConstructedInterpolants, 0 QuantifiedInterpolants, 2015 SizeOfPredicates, 13 NumberOfNonLiveVariables, 814 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 1875/3858 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-14 14:50:23,220 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE