./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/rule60_list2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e 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/ldv-regression/rule60_list2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec34d681fc532ab8881c0bb28aeb7b8d0ef0df29d4602290c71f943db752a206 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 05:57:59,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 05:57:59,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 05:57:59,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 05:57:59,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 05:57:59,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 05:57:59,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 05:57:59,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 05:57:59,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 05:57:59,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 05:57:59,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 05:57:59,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 05:57:59,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 05:57:59,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 05:57:59,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 05:57:59,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 05:57:59,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 05:57:59,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 05:57:59,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 05:57:59,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 05:57:59,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 05:57:59,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 05:57:59,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 05:57:59,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 05:57:59,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 05:57:59,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 05:57:59,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 05:57:59,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 05:57:59,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 05:57:59,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 05:57:59,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 05:57:59,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 05:57:59,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 05:57:59,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 05:57:59,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 05:57:59,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 05:57:59,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 05:57:59,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 05:57:59,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 05:57:59,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 05:57:59,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 05:57:59,714 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 05:57:59,738 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 05:57:59,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 05:57:59,745 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 05:57:59,745 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 05:57:59,746 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 05:57:59,746 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 05:57:59,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 05:57:59,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 05:57:59,747 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 05:57:59,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 05:57:59,748 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 05:57:59,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 05:57:59,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 05:57:59,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 05:57:59,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 05:57:59,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 05:57:59,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 05:57:59,749 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 05:57:59,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 05:57:59,749 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 05:57:59,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 05:57:59,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 05:57:59,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 05:57:59,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 05:57:59,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:57:59,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 05:57:59,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 05:57:59,751 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 05:57:59,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 05:57:59,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 05:57:59,751 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 05:57:59,752 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 05:57:59,752 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 05:57:59,752 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 05:57:59,752 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 05:57:59,752 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> ec34d681fc532ab8881c0bb28aeb7b8d0ef0df29d4602290c71f943db752a206 [2023-02-17 05:57:59,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 05:57:59,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 05:57:59,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 05:57:59,957 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 05:57:59,959 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 05:57:59,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule60_list2.i [2023-02-17 05:58:01,032 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 05:58:01,219 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 05:58:01,219 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.i [2023-02-17 05:58:01,228 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a2d6908/9b499f10823a42ada115289e33083f6d/FLAGee017c562 [2023-02-17 05:58:01,586 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a2d6908/9b499f10823a42ada115289e33083f6d [2023-02-17 05:58:01,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 05:58:01,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 05:58:01,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 05:58:01,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 05:58:01,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 05:58:01,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:58:01" (1/1) ... [2023-02-17 05:58:01,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c35f643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:58:01, skipping insertion in model container [2023-02-17 05:58:01,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:58:01" (1/1) ... [2023-02-17 05:58:01,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 05:58:01,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 05:58:01,714 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.i[292,305] [2023-02-17 05:58:01,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:58:01,851 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 05:58:01,860 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.i[292,305] [2023-02-17 05:58:01,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:58:01,918 INFO L208 MainTranslator]: Completed translation [2023-02-17 05:58:01,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:58:01 WrapperNode [2023-02-17 05:58:01,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 05:58:01,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 05:58:01,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 05:58:01,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 05:58:01,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:58:01" (1/1) ... [2023-02-17 05:58:01,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:58:01" (1/1) ... [2023-02-17 05:58:01,960 INFO L138 Inliner]: procedures = 126, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2023-02-17 05:58:01,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 05:58:01,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 05:58:01,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 05:58:01,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 05:58:01,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:58:01" (1/1) ... [2023-02-17 05:58:01,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:58:01" (1/1) ... [2023-02-17 05:58:01,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:58:01" (1/1) ... [2023-02-17 05:58:01,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:58:01" (1/1) ... [2023-02-17 05:58:01,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:58:01" (1/1) ... [2023-02-17 05:58:01,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:58:01" (1/1) ... [2023-02-17 05:58:01,992 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:58:01" (1/1) ... [2023-02-17 05:58:01,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:58:01" (1/1) ... [2023-02-17 05:58:01,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 05:58:01,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 05:58:01,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 05:58:01,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 05:58:01,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:58:01" (1/1) ... [2023-02-17 05:58:02,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:58:02,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:58:02,025 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) [2023-02-17 05:58:02,038 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 [2023-02-17 05:58:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2023-02-17 05:58:02,054 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2023-02-17 05:58:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 05:58:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-02-17 05:58:02,054 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-02-17 05:58:02,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 05:58:02,057 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2023-02-17 05:58:02,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2023-02-17 05:58:02,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 05:58:02,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 05:58:02,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 05:58:02,122 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 05:58:02,123 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 05:58:02,220 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 05:58:02,224 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 05:58:02,224 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 05:58:02,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:58:02 BoogieIcfgContainer [2023-02-17 05:58:02,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 05:58:02,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 05:58:02,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 05:58:02,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 05:58:02,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 05:58:01" (1/3) ... [2023-02-17 05:58:02,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323ab7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:58:02, skipping insertion in model container [2023-02-17 05:58:02,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:58:01" (2/3) ... [2023-02-17 05:58:02,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323ab7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:58:02, skipping insertion in model container [2023-02-17 05:58:02,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:58:02" (3/3) ... [2023-02-17 05:58:02,231 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2023-02-17 05:58:02,267 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 05:58:02,267 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 05:58:02,320 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 05:58:02,326 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@469b8a20, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 05:58:02,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 05:58:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 05:58:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 05:58:02,335 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:58:02,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:58:02,336 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:58:02,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:58:02,339 INFO L85 PathProgramCache]: Analyzing trace with hash 483918471, now seen corresponding path program 1 times [2023-02-17 05:58:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:58:02,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314739808] [2023-02-17 05:58:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:02,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:58:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:58:02,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:58:02,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314739808] [2023-02-17 05:58:02,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314739808] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:58:02,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:58:02,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 05:58:02,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722058031] [2023-02-17 05:58:02,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:58:02,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 05:58:02,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:58:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 05:58:02,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 05:58:02,581 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:58:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:58:02,654 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2023-02-17 05:58:02,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 05:58:02,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-17 05:58:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:58:02,663 INFO L225 Difference]: With dead ends: 66 [2023-02-17 05:58:02,663 INFO L226 Difference]: Without dead ends: 29 [2023-02-17 05:58:02,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 05:58:02,669 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:58:02,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 93 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:58:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-17 05:58:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-17 05:58:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 05:58:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-02-17 05:58:02,697 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 7 [2023-02-17 05:58:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:58:02,698 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-02-17 05:58:02,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:58:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-02-17 05:58:02,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 05:58:02,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:58:02,700 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:58:02,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 05:58:02,701 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:58:02,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:58:02,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1376776956, now seen corresponding path program 1 times [2023-02-17 05:58:02,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:58:02,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165783737] [2023-02-17 05:58:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:02,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:58:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:58:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:02,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 05:58:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 05:58:02,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:58:02,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165783737] [2023-02-17 05:58:02,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165783737] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:58:02,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931814684] [2023-02-17 05:58:02,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:02,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:58:02,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:58:02,975 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) [2023-02-17 05:58:02,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 05:58:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:03,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 05:58:03,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:58:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 05:58:03,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:58:03,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 05:58:03,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931814684] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:58:03,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:58:03,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-02-17 05:58:03,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775009244] [2023-02-17 05:58:03,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:58:03,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 05:58:03,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:58:03,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 05:58:03,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 05:58:03,154 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 05:58:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:58:03,252 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2023-02-17 05:58:03,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 05:58:03,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-02-17 05:58:03,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:58:03,254 INFO L225 Difference]: With dead ends: 51 [2023-02-17 05:58:03,254 INFO L226 Difference]: Without dead ends: 32 [2023-02-17 05:58:03,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-17 05:58:03,256 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:58:03,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 108 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:58:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-17 05:58:03,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-17 05:58:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-17 05:58:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-02-17 05:58:03,262 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 26 [2023-02-17 05:58:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:58:03,262 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-02-17 05:58:03,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 05:58:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-02-17 05:58:03,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 05:58:03,263 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:58:03,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:58:03,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 05:58:03,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:58:03,469 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:58:03,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:58:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2100541890, now seen corresponding path program 1 times [2023-02-17 05:58:03,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:58:03,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352274425] [2023-02-17 05:58:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:03,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:58:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:03,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:58:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:03,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 05:58:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 05:58:03,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:58:03,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352274425] [2023-02-17 05:58:03,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352274425] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:58:03,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:58:03,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 05:58:03,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501783542] [2023-02-17 05:58:03,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:58:03,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 05:58:03,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:58:03,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 05:58:03,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 05:58:03,600 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 05:58:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:58:03,682 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2023-02-17 05:58:03,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 05:58:03,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-02-17 05:58:03,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:58:03,684 INFO L225 Difference]: With dead ends: 49 [2023-02-17 05:58:03,684 INFO L226 Difference]: Without dead ends: 29 [2023-02-17 05:58:03,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-17 05:58:03,687 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:58:03,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 103 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:58:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-17 05:58:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-17 05:58:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 05:58:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-02-17 05:58:03,701 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 26 [2023-02-17 05:58:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:58:03,701 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-02-17 05:58:03,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 05:58:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-02-17 05:58:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 05:58:03,704 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:58:03,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:58:03,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 05:58:03,704 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:58:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:58:03,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1493360828, now seen corresponding path program 1 times [2023-02-17 05:58:03,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:58:03,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622319664] [2023-02-17 05:58:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:03,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:58:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:03,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:58:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:03,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 05:58:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 05:58:03,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:58:03,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622319664] [2023-02-17 05:58:03,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622319664] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:58:03,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855870513] [2023-02-17 05:58:03,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:03,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:58:03,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:58:03,927 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) [2023-02-17 05:58:03,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 05:58:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:03,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 05:58:03,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:58:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 05:58:04,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:58:04,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855870513] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:58:04,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 05:58:04,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2023-02-17 05:58:04,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3167163] [2023-02-17 05:58:04,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:58:04,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 05:58:04,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:58:04,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 05:58:04,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2023-02-17 05:58:04,162 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 05:58:04,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:58:04,351 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2023-02-17 05:58:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 05:58:04,351 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-02-17 05:58:04,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:58:04,353 INFO L225 Difference]: With dead ends: 55 [2023-02-17 05:58:04,353 INFO L226 Difference]: Without dead ends: 46 [2023-02-17 05:58:04,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2023-02-17 05:58:04,354 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 52 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:58:04,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 114 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:58:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-17 05:58:04,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2023-02-17 05:58:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 05:58:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2023-02-17 05:58:04,359 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2023-02-17 05:58:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:58:04,359 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2023-02-17 05:58:04,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 05:58:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2023-02-17 05:58:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-17 05:58:04,360 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:58:04,361 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:58:04,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 05:58:04,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-17 05:58:04,570 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:58:04,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:58:04,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1025994815, now seen corresponding path program 1 times [2023-02-17 05:58:04,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:58:04,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834268627] [2023-02-17 05:58:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:04,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:58:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:04,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:58:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:04,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 05:58:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:04,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-17 05:58:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 05:58:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:58:04,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834268627] [2023-02-17 05:58:04,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834268627] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:58:04,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706556992] [2023-02-17 05:58:04,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:04,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:58:04,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:58:04,796 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) [2023-02-17 05:58:04,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 05:58:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:04,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 05:58:04,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:58:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:58:05,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:58:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:58:05,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706556992] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:58:05,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:58:05,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 26 [2023-02-17 05:58:05,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023543731] [2023-02-17 05:58:05,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:58:05,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 05:58:05,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:58:05,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 05:58:05,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2023-02-17 05:58:05,170 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 20 states have internal predecessors, (40), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 05:58:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:58:05,520 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2023-02-17 05:58:05,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 05:58:05,521 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 20 states have internal predecessors, (40), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2023-02-17 05:58:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:58:05,522 INFO L225 Difference]: With dead ends: 55 [2023-02-17 05:58:05,522 INFO L226 Difference]: Without dead ends: 48 [2023-02-17 05:58:05,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 19 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2023-02-17 05:58:05,523 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 64 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 05:58:05,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 94 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 05:58:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-17 05:58:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2023-02-17 05:58:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-17 05:58:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2023-02-17 05:58:05,531 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 33 [2023-02-17 05:58:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:58:05,531 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2023-02-17 05:58:05,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 20 states have internal predecessors, (40), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 05:58:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2023-02-17 05:58:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-17 05:58:05,533 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:58:05,533 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:58:05,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-17 05:58:05,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:58:05,739 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:58:05,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:58:05,740 INFO L85 PathProgramCache]: Analyzing trace with hash 216648189, now seen corresponding path program 1 times [2023-02-17 05:58:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:58:05,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449856672] [2023-02-17 05:58:05,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:05,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:58:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:05,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:58:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:05,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 05:58:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:05,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-17 05:58:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 05:58:05,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:58:05,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449856672] [2023-02-17 05:58:05,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449856672] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:58:05,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436205989] [2023-02-17 05:58:05,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:05,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:58:05,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:58:05,912 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) [2023-02-17 05:58:05,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 05:58:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:05,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 05:58:05,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:58:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:58:06,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:58:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:58:06,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436205989] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:58:06,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:58:06,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 35 [2023-02-17 05:58:06,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986653198] [2023-02-17 05:58:06,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:58:06,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-17 05:58:06,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:58:06,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-17 05:58:06,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2023-02-17 05:58:06,299 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 27 states have internal predecessors, (63), 8 states have call successors, (13), 11 states have call predecessors, (13), 7 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-17 05:58:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:58:06,633 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2023-02-17 05:58:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 05:58:06,633 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 27 states have internal predecessors, (63), 8 states have call successors, (13), 11 states have call predecessors, (13), 7 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) Word has length 33 [2023-02-17 05:58:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:58:06,634 INFO L225 Difference]: With dead ends: 57 [2023-02-17 05:58:06,634 INFO L226 Difference]: Without dead ends: 54 [2023-02-17 05:58:06,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=307, Invalid=1763, Unknown=0, NotChecked=0, Total=2070 [2023-02-17 05:58:06,635 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 113 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 05:58:06,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 88 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 05:58:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-17 05:58:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2023-02-17 05:58:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-17 05:58:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2023-02-17 05:58:06,640 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 33 [2023-02-17 05:58:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:58:06,640 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2023-02-17 05:58:06,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 27 states have internal predecessors, (63), 8 states have call successors, (13), 11 states have call predecessors, (13), 7 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-17 05:58:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2023-02-17 05:58:06,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 05:58:06,641 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:58:06,641 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:58:06,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 05:58:06,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:58:06,848 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:58:06,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:58:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1230299368, now seen corresponding path program 1 times [2023-02-17 05:58:06,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:58:06,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22890525] [2023-02-17 05:58:06,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:06,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:58:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:06,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:58:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:06,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 05:58:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:07,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-17 05:58:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:07,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-17 05:58:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 05:58:07,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:58:07,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22890525] [2023-02-17 05:58:07,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22890525] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:58:07,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480723647] [2023-02-17 05:58:07,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:07,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:58:07,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:58:07,095 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) [2023-02-17 05:58:07,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 05:58:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:07,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 05:58:07,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:58:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 05:58:07,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:58:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 05:58:07,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480723647] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:58:07,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:58:07,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 25 [2023-02-17 05:58:07,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109919245] [2023-02-17 05:58:07,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:58:07,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-17 05:58:07,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:58:07,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-17 05:58:07,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2023-02-17 05:58:07,418 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 20 states have internal predecessors, (49), 4 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 05:58:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:58:07,709 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2023-02-17 05:58:07,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 05:58:07,709 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 20 states have internal predecessors, (49), 4 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2023-02-17 05:58:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:58:07,710 INFO L225 Difference]: With dead ends: 57 [2023-02-17 05:58:07,710 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 05:58:07,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 69 SyntacticMatches, 16 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=1232, Unknown=0, NotChecked=0, Total=1406 [2023-02-17 05:58:07,711 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 77 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 05:58:07,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 95 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 05:58:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 05:58:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2023-02-17 05:58:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-17 05:58:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2023-02-17 05:58:07,715 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 43 [2023-02-17 05:58:07,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:58:07,716 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2023-02-17 05:58:07,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 20 states have internal predecessors, (49), 4 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 05:58:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2023-02-17 05:58:07,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 05:58:07,717 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:58:07,717 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:58:07,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 05:58:07,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:58:07,922 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:58:07,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:58:07,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1289660566, now seen corresponding path program 1 times [2023-02-17 05:58:07,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:58:07,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005695296] [2023-02-17 05:58:07,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:58:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:08,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:58:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:08,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 05:58:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:08,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-17 05:58:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:08,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-17 05:58:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 05:58:08,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:58:08,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005695296] [2023-02-17 05:58:08,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005695296] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:58:08,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428733583] [2023-02-17 05:58:08,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:08,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:58:08,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:58:08,126 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) [2023-02-17 05:58:08,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 05:58:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:08,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 05:58:08,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:58:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 05:58:08,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:58:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 05:58:08,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428733583] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:58:08,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:58:08,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 26 [2023-02-17 05:58:08,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857329475] [2023-02-17 05:58:08,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:58:08,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 05:58:08,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:58:08,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 05:58:08,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2023-02-17 05:58:08,420 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 21 states have internal predecessors, (49), 5 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 05:58:08,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:58:08,714 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2023-02-17 05:58:08,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 05:58:08,715 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 21 states have internal predecessors, (49), 5 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2023-02-17 05:58:08,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:58:08,716 INFO L225 Difference]: With dead ends: 53 [2023-02-17 05:58:08,716 INFO L226 Difference]: Without dead ends: 37 [2023-02-17 05:58:08,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2023-02-17 05:58:08,717 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 05:58:08,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 92 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 05:58:08,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-17 05:58:08,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-02-17 05:58:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 05:58:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2023-02-17 05:58:08,721 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 43 [2023-02-17 05:58:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:58:08,722 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2023-02-17 05:58:08,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 21 states have internal predecessors, (49), 5 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 05:58:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2023-02-17 05:58:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 05:58:08,723 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:58:08,723 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:58:08,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 05:58:08,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:58:08,930 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:58:08,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:58:08,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1931363946, now seen corresponding path program 1 times [2023-02-17 05:58:08,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:58:08,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253968182] [2023-02-17 05:58:08,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:08,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:58:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:09,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:58:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:09,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 05:58:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:09,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-17 05:58:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:09,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-17 05:58:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 05:58:09,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:58:09,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253968182] [2023-02-17 05:58:09,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253968182] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:58:09,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895077329] [2023-02-17 05:58:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:09,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:58:09,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:58:09,083 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 05:58:09,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 05:58:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:09,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 05:58:09,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:58:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 05:58:09,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:58:09,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895077329] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:58:09,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 05:58:09,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 24 [2023-02-17 05:58:09,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632472509] [2023-02-17 05:58:09,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:58:09,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 05:58:09,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:58:09,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 05:58:09,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2023-02-17 05:58:09,230 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 05:58:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:58:09,344 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2023-02-17 05:58:09,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 05:58:09,345 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2023-02-17 05:58:09,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:58:09,345 INFO L225 Difference]: With dead ends: 47 [2023-02-17 05:58:09,345 INFO L226 Difference]: Without dead ends: 40 [2023-02-17 05:58:09,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2023-02-17 05:58:09,346 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:58:09,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 98 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:58:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-17 05:58:09,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2023-02-17 05:58:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 05:58:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2023-02-17 05:58:09,349 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 43 [2023-02-17 05:58:09,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:58:09,349 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2023-02-17 05:58:09,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 05:58:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2023-02-17 05:58:09,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 05:58:09,350 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:58:09,350 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:58:09,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 05:58:09,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:58:09,555 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:58:09,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:58:09,555 INFO L85 PathProgramCache]: Analyzing trace with hash -588595988, now seen corresponding path program 1 times [2023-02-17 05:58:09,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:58:09,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401344669] [2023-02-17 05:58:09,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:09,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:58:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:09,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 05:58:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:09,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-17 05:58:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:09,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-17 05:58:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:09,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-17 05:58:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 05:58:09,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:58:09,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401344669] [2023-02-17 05:58:09,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401344669] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:58:09,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229978514] [2023-02-17 05:58:09,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:58:09,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:58:09,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:58:09,809 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 05:58:09,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 05:58:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:58:09,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 05:58:09,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:58:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 05:58:09,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:58:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 05:58:09,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229978514] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:58:09,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:58:09,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 24 [2023-02-17 05:58:09,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661286210] [2023-02-17 05:58:09,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:58:09,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-17 05:58:09,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:58:09,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-17 05:58:09,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2023-02-17 05:58:09,950 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 19 states have internal predecessors, (56), 8 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-17 05:58:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:58:10,196 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2023-02-17 05:58:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-17 05:58:10,197 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 19 states have internal predecessors, (56), 8 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 43 [2023-02-17 05:58:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:58:10,197 INFO L225 Difference]: With dead ends: 44 [2023-02-17 05:58:10,197 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 05:58:10,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2023-02-17 05:58:10,198 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 65 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:58:10,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 60 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:58:10,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 05:58:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 05:58:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:58:10,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 05:58:10,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2023-02-17 05:58:10,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:58:10,199 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 05:58:10,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 19 states have internal predecessors, (56), 8 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-17 05:58:10,199 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 05:58:10,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 05:58:10,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 05:58:10,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 05:58:10,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-17 05:58:10,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 05:58:10,437 INFO L899 garLoopResultBuilder]: For program point my_mallocFINAL(lines 528 530) no Hoare annotation was computed. [2023-02-17 05:58:10,438 INFO L895 garLoopResultBuilder]: At program point __getMemory_returnLabel#1(lines 520 527) the Hoare annotation is: (let ((.cse11 (= |my_malloc_#in~size#1| 8))) (let ((.cse9 (= (+ |my_malloc___getMemory_~size#1| (- 8)) 0)) (.cse18 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse16 (+ ~guard_malloc_counter~0.offset (- 1))) (.cse17 (not (= |old(~guard_malloc_counter~0.offset)| 0))) (.cse15 (not .cse11)) (.cse3 (<= ~elem~0.offset 0)) (.cse1 (+ |old(~guard_malloc_counter~0.offset)| (- 1)))) (let ((.cse0 (let ((.cse20 (not (<= 0 .cse1))) (.cse21 (not (>= |old(~guard_malloc_counter~0.offset)| 0)))) (let ((.cse19 (let ((.cse23 (not .cse3))) (let ((.cse22 (and (or .cse23 .cse15 .cse20) (or .cse21 .cse23 .cse15)))) (and (or .cse21 .cse22 (and (not (< |old(~guard_malloc_counter~0.offset)| ~elem~0.offset)) (not (< ~elem~0.offset |old(~guard_malloc_counter~0.offset)|))) .cse23) (or .cse22 .cse17 .cse23 (not (= ~elem~0.offset 0)))))))) (and (or .cse19 .cse20) (or .cse21 .cse19))))) (.cse2 (>= ~guard_malloc_counter~0.offset 0)) (.cse4 (<= 0 .cse16)) (.cse6 (<= |my_malloc___getMemory_#res#1.offset| ~guard_malloc_counter~0.offset)) (.cse8 (>= |my_malloc___getMemory_#res#1.offset| ~guard_malloc_counter~0.offset)) (.cse10 (<= |my_malloc___getMemory_#res#1.offset| .cse18)) (.cse5 (= |old(~guard_malloc_counter~0.offset)| .cse16)) (.cse7 (<= |old(~guard_malloc_counter~0.offset)| .cse16)) (.cse12 (<= .cse18 |my_malloc___getMemory_#res#1.offset|)) (.cse13 (<= ~guard_malloc_counter~0.offset |my_malloc___getMemory_#res#1.offset|)) (.cse14 (and (<= |my_malloc___getMemory_#res#1.base| 0) (<= 0 |my_malloc___getMemory_#res#1.offset|) (<= |my_malloc___getMemory_#res#1.offset| 0) (<= 0 |my_malloc___getMemory_#res#1.base|) .cse9 .cse11))) (and (or .cse0 (not (= .cse1 0)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or (and .cse9 .cse11) .cse15 .cse14) (or .cse0 (and .cse2 .cse4 .cse6 (= .cse16 0) .cse8 .cse10 .cse3 .cse5 .cse7 .cse9 .cse11 .cse12 .cse13) .cse17 .cse14))))) [2023-02-17 05:58:10,438 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 525) no Hoare annotation was computed. [2023-02-17 05:58:10,438 INFO L899 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2023-02-17 05:58:10,439 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 528 530) the Hoare annotation is: (let ((.cse1 (= |my_malloc_#in~size#1| 8))) (let ((.cse6 (= ~guard_malloc_counter~0.offset 0)) (.cse0 (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) (.cse2 (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|)) (.cse8 (+ ~guard_malloc_counter~0.offset (- 1))) (.cse15 (< |old(~guard_malloc_counter~0.offset)| ~elem~0.offset)) (.cse5 (not (= |old(~guard_malloc_counter~0.offset)| 0))) (.cse17 (= ~elem~0.offset 0)) (.cse3 (not .cse1)) (.cse14 (<= ~elem~0.offset 0)) (.cse9 (+ |old(~guard_malloc_counter~0.offset)| (- 1)))) (let ((.cse4 (let ((.cse19 (not (<= 0 .cse9))) (.cse20 (not (>= |old(~guard_malloc_counter~0.offset)| 0)))) (let ((.cse18 (let ((.cse22 (not .cse14))) (let ((.cse21 (and (or .cse22 .cse3 .cse19) (or .cse20 .cse22 .cse3)))) (and (or .cse20 .cse21 (and (not .cse15) (not (< ~elem~0.offset |old(~guard_malloc_counter~0.offset)|))) .cse22) (or .cse21 .cse5 .cse22 (not .cse17))))))) (and (or .cse18 .cse19) (or .cse20 .cse18))))) (.cse7 (let ((.cse10 (<= 0 .cse8)) (.cse13 (>= ~guard_malloc_counter~0.offset 0)) (.cse11 (>= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|))) (let ((.cse12 (let ((.cse16 (or (and .cse14 .cse10 .cse11 .cse0 .cse1 .cse2) (and .cse14 .cse13 .cse11 .cse0 .cse1 .cse2)))) (or (and .cse14 .cse13 (or .cse15 (< ~elem~0.offset ~guard_malloc_counter~0.offset)) .cse16 .cse11 .cse0 .cse2) (and .cse14 .cse6 .cse16 .cse11 .cse0 .cse2 .cse17))))) (or (and .cse10 .cse11 .cse0 .cse12 .cse2) (and .cse13 .cse11 .cse0 .cse12 .cse2)))))) (and (or (and .cse0 .cse1 .cse2) .cse3) (or .cse4 .cse5 (and .cse6 .cse0 .cse7 .cse2)) (or .cse4 (and (= .cse8 0) .cse0 .cse7 .cse2) (not (= .cse9 0))))))) [2023-02-17 05:58:10,439 INFO L895 garLoopResultBuilder]: At program point L522-2(line 522) the Hoare annotation is: (let ((.cse2 (not (= |old(~guard_malloc_counter~0.offset)| 0))) (.cse0 (not (= |my_malloc_#in~size#1| 8))) (.cse3 (+ |old(~guard_malloc_counter~0.offset)| (- 1)))) (let ((.cse1 (let ((.cse5 (not (<= 0 .cse3))) (.cse6 (not (>= |old(~guard_malloc_counter~0.offset)| 0)))) (let ((.cse4 (let ((.cse8 (not (<= ~elem~0.offset 0)))) (let ((.cse7 (and (or .cse8 .cse0 .cse5) (or .cse6 .cse8 .cse0)))) (and (or .cse6 .cse7 (and (not (< |old(~guard_malloc_counter~0.offset)| ~elem~0.offset)) (not (< ~elem~0.offset |old(~guard_malloc_counter~0.offset)|))) .cse8) (or .cse7 .cse2 .cse8 (not (= ~elem~0.offset 0)))))))) (and (or .cse4 .cse5) (or .cse6 .cse4)))))) (and .cse0 (or .cse1 .cse2) (or .cse1 (not (= .cse3 0)))))) [2023-02-17 05:58:10,439 INFO L899 garLoopResultBuilder]: For program point L522-3(line 522) no Hoare annotation was computed. [2023-02-17 05:58:10,439 INFO L899 garLoopResultBuilder]: For program point my_mallocEXIT(lines 528 530) no Hoare annotation was computed. [2023-02-17 05:58:10,439 INFO L899 garLoopResultBuilder]: For program point L537(lines 537 538) no Hoare annotation was computed. [2023-02-17 05:58:10,439 INFO L899 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2023-02-17 05:58:10,439 INFO L899 garLoopResultBuilder]: For program point L537-2(lines 535 539) no Hoare annotation was computed. [2023-02-17 05:58:10,440 INFO L895 garLoopResultBuilder]: At program point L536-2(line 536) the Hoare annotation is: (let ((.cse0 (not (<= 2 |list_add_#in~new.offset|))) (.cse1 (not (<= 0 (+ ~guard_malloc_counter~0.offset (- 1))))) (.cse2 (not (<= |old(~elem~0.offset)| 0))) (.cse3 (not (>= ~guard_malloc_counter~0.offset 0))) (.cse4 (+ |list_add_#in~new.offset| (- 1)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (not (<= |list_add_#in~new.offset| (+ |old(~elem~0.offset)| (- 1))))) (or .cse0 .cse1 .cse2 .cse3) (or .cse1 (not (= |old(~elem~0.offset)| 0)) .cse2 (not (<= 0 .cse4)) .cse3) (not (<= |old(~elem~0.offset)| .cse4)))) [2023-02-17 05:58:10,440 INFO L899 garLoopResultBuilder]: For program point L536-3(line 536) no Hoare annotation was computed. [2023-02-17 05:58:10,440 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 535 539) the Hoare annotation is: (let ((.cse5 (<= 0 (+ ~guard_malloc_counter~0.offset (- 1)))) (.cse11 (<= 2 |list_add_#in~new.offset|)) (.cse3 (<= ~elem~0.offset 0)) (.cse6 (= ~elem~0.base |old(~elem~0.base)|)) (.cse7 (= ~elem~0.offset |old(~elem~0.offset)|)) (.cse4 (>= ~guard_malloc_counter~0.offset 0))) (let ((.cse8 (not .cse4)) (.cse9 (+ |list_add_#in~new.offset| (- 1))) (.cse12 (let ((.cse13 (or (and .cse3 .cse6 .cse7) (and .cse6 .cse7)))) (or (and .cse13 .cse6 .cse7) (and .cse13 (<= ~elem~0.offset |list_add_#in~new.offset|) .cse6 .cse7)))) (.cse10 (not .cse11)) (.cse1 (not (<= |old(~elem~0.offset)| 0))) (.cse0 (not .cse5))) (and (let ((.cse2 (<= 0 .cse9))) (or .cse0 (not (= |old(~elem~0.offset)| 0)) .cse1 (not .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse2 (= ~elem~0.offset 0)) .cse8)) (or .cse10 (and .cse3 .cse4 .cse5 .cse11 .cse6 .cse7) .cse0 .cse1 .cse8) (or (and .cse12 .cse6 .cse7 (<= ~elem~0.offset .cse9)) (not (<= |old(~elem~0.offset)| .cse9))) (or .cse10 (and .cse3 .cse12 .cse11 .cse5 .cse6 .cse7) .cse0 .cse1) (or .cse10 (and .cse3 .cse5 .cse11) .cse0 .cse1) (or .cse0 (and .cse5 .cse6 .cse7 (<= |list_add_#in~new.offset| (+ ~elem~0.offset (- 1)))) (not (<= |list_add_#in~new.offset| (+ |old(~elem~0.offset)| (- 1)))))))) [2023-02-17 05:58:10,440 INFO L899 garLoopResultBuilder]: For program point list_addEXIT(lines 535 539) no Hoare annotation was computed. [2023-02-17 05:58:10,440 INFO L899 garLoopResultBuilder]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2023-02-17 05:58:10,440 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 4 7) the Hoare annotation is: true [2023-02-17 05:58:10,441 INFO L899 garLoopResultBuilder]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2023-02-17 05:58:10,441 INFO L899 garLoopResultBuilder]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2023-02-17 05:58:10,441 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 05:58:10,441 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 542) no Hoare annotation was computed. [2023-02-17 05:58:10,441 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 05:58:10,441 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 545 556) the Hoare annotation is: true [2023-02-17 05:58:10,441 INFO L895 garLoopResultBuilder]: At program point L550(line 550) the Hoare annotation is: (and (<= ~elem~0.offset 0) (>= ~guard_malloc_counter~0.offset 0) (<= 0 (+ ~guard_malloc_counter~0.offset (- 1))) (or (< |old(~guard_malloc_counter~0.offset)| ~elem~0.offset) (< ~elem~0.offset ~guard_malloc_counter~0.offset)) (<= |ULTIMATE.start_main_~dev2~0#1.offset| 2) (<= |ULTIMATE.start_main_~dev1~0#1.offset| (+ |ULTIMATE.start_main_~dev2~0#1.offset| (- 1))) (<= 0 (+ |ULTIMATE.start_main_~dev1~0#1.offset| (- 1))) (<= 2 |ULTIMATE.start_main_~dev2~0#1.offset|) (<= |ULTIMATE.start_main_~dev1~0#1.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset 0) (<= 0 (+ |ULTIMATE.start_main_~dev2~0#1.offset| (- 2)))) [2023-02-17 05:58:10,441 INFO L895 garLoopResultBuilder]: At program point L550-1(line 550) the Hoare annotation is: (let ((.cse0 (<= 0 (+ ~guard_malloc_counter~0.offset (- 1)))) (.cse1 (<= |ULTIMATE.start_main_~dev1~0#1.offset| (+ |ULTIMATE.start_main_~dev2~0#1.offset| (- 1)))) (.cse2 (<= |ULTIMATE.start_main_~dev1~0#1.offset| ~guard_malloc_counter~0.offset))) (or (and (<= ~elem~0.offset 0) (>= ~guard_malloc_counter~0.offset 0) .cse0 (or (< |old(~guard_malloc_counter~0.offset)| ~elem~0.offset) (< ~elem~0.offset ~guard_malloc_counter~0.offset)) .cse1 (<= 0 (+ |ULTIMATE.start_main_~dev1~0#1.offset| (- 1))) (<= 2 |ULTIMATE.start_main_~dev2~0#1.offset|) .cse2 (= ~elem~0.offset 0)) (and .cse0 (= ~elem~0.base |ULTIMATE.start_main_~dev2~0#1.base|) (= ~elem~0.offset |ULTIMATE.start_main_~dev2~0#1.offset|) (<= |ULTIMATE.start_main_~dev1~0#1.offset| (+ ~elem~0.offset (- 1))) (<= |ULTIMATE.start_main_~dev2~0#1.offset| 2) .cse1 (= |ULTIMATE.start_main_~dev2~0#1.base| ~elem~0.base) .cse2 (<= 0 (+ |ULTIMATE.start_main_~dev2~0#1.offset| (- 2)))))) [2023-02-17 05:58:10,442 INFO L895 garLoopResultBuilder]: At program point L548(line 548) the Hoare annotation is: (or (let ((.cse0 (+ ~guard_malloc_counter~0.offset (- 1)))) (and (<= ~elem~0.offset 0) (<= 0 .cse0) (= .cse0 0) (<= |ULTIMATE.start_main_~dev1~0#1.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset 0) (<= ~guard_malloc_counter~0.offset |ULTIMATE.start_main_~dev1~0#1.offset|))) (and (= |ULTIMATE.start_main_~dev1~0#1.base| 0) (= |ULTIMATE.start_main_~dev1~0#1.offset| 0))) [2023-02-17 05:58:10,442 INFO L899 garLoopResultBuilder]: For program point L548-1(line 548) no Hoare annotation was computed. [2023-02-17 05:58:10,442 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 05:58:10,442 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 05:58:10,442 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 543) no Hoare annotation was computed. [2023-02-17 05:58:10,442 INFO L895 garLoopResultBuilder]: At program point L553(line 553) the Hoare annotation is: (let ((.cse9 (+ |ULTIMATE.start_main_~dev2~0#1.offset| (- 1)))) (let ((.cse5 (<= ~elem~0.offset .cse9)) (.cse0 (<= ~elem~0.offset 0)) (.cse3 (<= |ULTIMATE.start_main_~dev1~0#1.offset| .cse9)) (.cse4 (<= |ULTIMATE.start_main_~dev1~0#1.offset| ~guard_malloc_counter~0.offset))) (let ((.cse1 (<= 0 (+ ~guard_malloc_counter~0.offset (- 1)))) (.cse2 (let ((.cse6 (let ((.cse7 (and .cse3 .cse4)) (.cse8 (and (<= |ULTIMATE.start_main_~dev1~0#1.offset| (+ ~elem~0.offset (- 1))) .cse3 .cse4))) (or .cse7 .cse8 (and .cse0 (or .cse7 .cse8)))))) (or (and .cse6 .cse3 .cse4) (and .cse6 (<= (+ ~elem~0.offset 1) |ULTIMATE.start_list_del_~entry#1.offset|) .cse5 .cse3 .cse4))))) (or (and .cse0 .cse1 (<= 2 |ULTIMATE.start_main_~dev2~0#1.offset|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 (+ |ULTIMATE.start_main_~dev2~0#1.offset| (- 2)))) (and .cse5 .cse2 .cse3 .cse4))))) [2023-02-17 05:58:10,442 INFO L899 garLoopResultBuilder]: For program point L551(line 551) no Hoare annotation was computed. [2023-02-17 05:58:10,442 INFO L899 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2023-02-17 05:58:10,442 INFO L899 garLoopResultBuilder]: For program point L549-1(lines 549 554) no Hoare annotation was computed. [2023-02-17 05:58:10,443 INFO L895 garLoopResultBuilder]: At program point L547(line 547) the Hoare annotation is: (and (<= ~elem~0.offset 0) (>= ~guard_malloc_counter~0.offset 0) (= ~guard_malloc_counter~0.offset 0) (= ~elem~0.offset 0)) [2023-02-17 05:58:10,443 INFO L899 garLoopResultBuilder]: For program point L547-1(line 547) no Hoare annotation was computed. [2023-02-17 05:58:10,445 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:58:10,446 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 05:58:10,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 05:58:10 BoogieIcfgContainer [2023-02-17 05:58:10,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 05:58:10,467 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 05:58:10,467 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 05:58:10,467 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 05:58:10,468 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:58:02" (3/4) ... [2023-02-17 05:58:10,470 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 05:58:10,473 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure my_malloc [2023-02-17 05:58:10,474 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure list_add [2023-02-17 05:58:10,474 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2023-02-17 05:58:10,476 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-02-17 05:58:10,476 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-02-17 05:58:10,477 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 05:58:10,477 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 05:58:10,492 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(\old(guard_malloc_counter) >= 0) || (((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8)))) || (!(\old(guard_malloc_counter) < elem) && !(elem < \old(guard_malloc_counter)))) || !(elem <= 0)) && ((((((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8))) || !(\old(guard_malloc_counter) == 0)) || !(elem <= 0)) || !(elem == 0))) || !(0 <= \old(guard_malloc_counter) + -1)) && (!(\old(guard_malloc_counter) >= 0) || ((((!(\old(guard_malloc_counter) >= 0) || (((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8)))) || (!(\old(guard_malloc_counter) < elem) && !(elem < \old(guard_malloc_counter)))) || !(elem <= 0)) && ((((((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8))) || !(\old(guard_malloc_counter) == 0)) || !(elem <= 0)) || !(elem == 0))))) || !(\old(guard_malloc_counter) + -1 == 0)) || (((((((((((guard_malloc_counter >= 0 && elem <= 0) && 0 <= guard_malloc_counter + -1) && \old(guard_malloc_counter) == guard_malloc_counter + -1) && \result <= guard_malloc_counter) && \old(guard_malloc_counter) <= guard_malloc_counter + -1) && \result >= guard_malloc_counter) && size + -8 == 0) && \result <= \old(guard_malloc_counter) + 1) && \old(size) == 8) && \old(guard_malloc_counter) + 1 <= \result) && guard_malloc_counter <= \result)) || (((((\result <= 0 && 0 <= \result) && \result <= 0) && 0 <= \result) && size + -8 == 0) && \old(size) == 8)) && (((size + -8 == 0 && \old(size) == 8) || !(\old(size) == 8)) || (((((\result <= 0 && 0 <= \result) && \result <= 0) && 0 <= \result) && size + -8 == 0) && \old(size) == 8))) && (((((((((!(\old(guard_malloc_counter) >= 0) || (((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8)))) || (!(\old(guard_malloc_counter) < elem) && !(elem < \old(guard_malloc_counter)))) || !(elem <= 0)) && ((((((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8))) || !(\old(guard_malloc_counter) == 0)) || !(elem <= 0)) || !(elem == 0))) || !(0 <= \old(guard_malloc_counter) + -1)) && (!(\old(guard_malloc_counter) >= 0) || ((((!(\old(guard_malloc_counter) >= 0) || (((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8)))) || (!(\old(guard_malloc_counter) < elem) && !(elem < \old(guard_malloc_counter)))) || !(elem <= 0)) && ((((((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8))) || !(\old(guard_malloc_counter) == 0)) || !(elem <= 0)) || !(elem == 0))))) || ((((((((((((guard_malloc_counter >= 0 && 0 <= guard_malloc_counter + -1) && \result <= guard_malloc_counter) && guard_malloc_counter + -1 == 0) && \result >= guard_malloc_counter) && \result <= \old(guard_malloc_counter) + 1) && elem <= 0) && \old(guard_malloc_counter) == guard_malloc_counter + -1) && \old(guard_malloc_counter) <= guard_malloc_counter + -1) && size + -8 == 0) && \old(size) == 8) && \old(guard_malloc_counter) + 1 <= \result) && guard_malloc_counter <= \result)) || !(\old(guard_malloc_counter) == 0)) || (((((\result <= 0 && 0 <= \result) && \result <= 0) && 0 <= \result) && size + -8 == 0) && \old(size) == 8)) [2023-02-17 05:58:10,497 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 05:58:10,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 05:58:10,497 INFO L158 Benchmark]: Toolchain (without parser) took 8909.15ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 93.6MB in the beginning and 82.4MB in the end (delta: 11.2MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2023-02-17 05:58:10,498 INFO L158 Benchmark]: CDTParser took 1.97ms. Allocated memory is still 138.4MB. Free memory was 91.9MB in the beginning and 91.8MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:58:10,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.48ms. Allocated memory is still 138.4MB. Free memory was 93.3MB in the beginning and 76.8MB in the end (delta: 16.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 05:58:10,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.29ms. Allocated memory is still 138.4MB. Free memory was 76.8MB in the beginning and 74.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 05:58:10,498 INFO L158 Benchmark]: Boogie Preprocessor took 36.97ms. Allocated memory is still 138.4MB. Free memory was 74.9MB in the beginning and 73.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 05:58:10,499 INFO L158 Benchmark]: RCFGBuilder took 227.58ms. Allocated memory is still 138.4MB. Free memory was 73.4MB in the beginning and 61.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 05:58:10,499 INFO L158 Benchmark]: TraceAbstraction took 8239.84ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 60.8MB in the beginning and 85.6MB in the end (delta: -24.8MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2023-02-17 05:58:10,499 INFO L158 Benchmark]: Witness Printer took 30.06ms. Allocated memory is still 209.7MB. Free memory was 85.6MB in the beginning and 82.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 05:58:10,500 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.97ms. Allocated memory is still 138.4MB. Free memory was 91.9MB in the beginning and 91.8MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.48ms. Allocated memory is still 138.4MB. Free memory was 93.3MB in the beginning and 76.8MB in the end (delta: 16.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.29ms. Allocated memory is still 138.4MB. Free memory was 76.8MB in the beginning and 74.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.97ms. Allocated memory is still 138.4MB. Free memory was 74.9MB in the beginning and 73.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 227.58ms. Allocated memory is still 138.4MB. Free memory was 73.4MB in the beginning and 61.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8239.84ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 60.8MB in the beginning and 85.6MB in the end (delta: -24.8MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * Witness Printer took 30.06ms. Allocated memory is still 209.7MB. Free memory was 85.6MB in the beginning and 82.4MB in the end (delta: 3.1MB). 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 - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 511 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 511 mSDsluCounter, 945 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 770 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3369 IncrementalHoareTripleChecker+Invalid, 3531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 175 mSDtfsCounter, 3369 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 754 GetRequests, 430 SyntacticMatches, 60 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=7, InterpolantAutomatonStates: 131, 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, 10 MinimizatonAttempts, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 63 PreInvPairs, 78 NumberOfFragments, 2846 HoareAnnotationTreeSize, 63 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 613 NumberOfCodeBlocks, 613 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 810 ConstructedInterpolants, 0 QuantifiedInterpolants, 3223 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1715 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 24 InterpolantComputations, 4 PerfectInterpolantSequences, 182/283 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 520]: Loop Invariant Derived loop invariant: ((((((((((!(\old(guard_malloc_counter) >= 0) || (((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8)))) || (!(\old(guard_malloc_counter) < elem) && !(elem < \old(guard_malloc_counter)))) || !(elem <= 0)) && ((((((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8))) || !(\old(guard_malloc_counter) == 0)) || !(elem <= 0)) || !(elem == 0))) || !(0 <= \old(guard_malloc_counter) + -1)) && (!(\old(guard_malloc_counter) >= 0) || ((((!(\old(guard_malloc_counter) >= 0) || (((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8)))) || (!(\old(guard_malloc_counter) < elem) && !(elem < \old(guard_malloc_counter)))) || !(elem <= 0)) && ((((((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8))) || !(\old(guard_malloc_counter) == 0)) || !(elem <= 0)) || !(elem == 0))))) || !(\old(guard_malloc_counter) + -1 == 0)) || (((((((((((guard_malloc_counter >= 0 && elem <= 0) && 0 <= guard_malloc_counter + -1) && \old(guard_malloc_counter) == guard_malloc_counter + -1) && \result <= guard_malloc_counter) && \old(guard_malloc_counter) <= guard_malloc_counter + -1) && \result >= guard_malloc_counter) && size + -8 == 0) && \result <= \old(guard_malloc_counter) + 1) && \old(size) == 8) && \old(guard_malloc_counter) + 1 <= \result) && guard_malloc_counter <= \result)) || (((((\result <= 0 && 0 <= \result) && \result <= 0) && 0 <= \result) && size + -8 == 0) && \old(size) == 8)) && (((size + -8 == 0 && \old(size) == 8) || !(\old(size) == 8)) || (((((\result <= 0 && 0 <= \result) && \result <= 0) && 0 <= \result) && size + -8 == 0) && \old(size) == 8))) && (((((((((!(\old(guard_malloc_counter) >= 0) || (((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8)))) || (!(\old(guard_malloc_counter) < elem) && !(elem < \old(guard_malloc_counter)))) || !(elem <= 0)) && ((((((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8))) || !(\old(guard_malloc_counter) == 0)) || !(elem <= 0)) || !(elem == 0))) || !(0 <= \old(guard_malloc_counter) + -1)) && (!(\old(guard_malloc_counter) >= 0) || ((((!(\old(guard_malloc_counter) >= 0) || (((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8)))) || (!(\old(guard_malloc_counter) < elem) && !(elem < \old(guard_malloc_counter)))) || !(elem <= 0)) && ((((((!(elem <= 0) || !(\old(size) == 8)) || !(0 <= \old(guard_malloc_counter) + -1)) && ((!(\old(guard_malloc_counter) >= 0) || !(elem <= 0)) || !(\old(size) == 8))) || !(\old(guard_malloc_counter) == 0)) || !(elem <= 0)) || !(elem == 0))))) || ((((((((((((guard_malloc_counter >= 0 && 0 <= guard_malloc_counter + -1) && \result <= guard_malloc_counter) && guard_malloc_counter + -1 == 0) && \result >= guard_malloc_counter) && \result <= \old(guard_malloc_counter) + 1) && elem <= 0) && \old(guard_malloc_counter) == guard_malloc_counter + -1) && \old(guard_malloc_counter) <= guard_malloc_counter + -1) && size + -8 == 0) && \old(size) == 8) && \old(guard_malloc_counter) + 1 <= \result) && guard_malloc_counter <= \result)) || !(\old(guard_malloc_counter) == 0)) || (((((\result <= 0 && 0 <= \result) && \result <= 0) && 0 <= \result) && size + -8 == 0) && \old(size) == 8)) RESULT: Ultimate proved your program to be correct! [2023-02-17 05:58:10,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE