./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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-sets/test_add-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-13 23:35:24,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-13 23:35:24,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-13 23:35:24,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-13 23:35:24,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-13 23:35:24,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-13 23:35:24,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-13 23:35:24,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-13 23:35:24,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-13 23:35:24,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-13 23:35:24,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-13 23:35:24,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-13 23:35:24,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-13 23:35:24,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-13 23:35:24,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-13 23:35:24,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-13 23:35:24,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-13 23:35:24,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-13 23:35:24,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-13 23:35:24,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-13 23:35:24,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-13 23:35:24,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-13 23:35:24,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-13 23:35:24,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-13 23:35:24,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-13 23:35:24,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-13 23:35:24,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-13 23:35:24,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-13 23:35:24,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-13 23:35:24,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-13 23:35:24,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-13 23:35:24,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-13 23:35:24,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-13 23:35:24,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-13 23:35:24,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-13 23:35:24,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-13 23:35:24,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-13 23:35:24,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-13 23:35:24,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-13 23:35:24,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-13 23:35:24,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-13 23:35:24,543 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-13 23:35:24,569 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-13 23:35:24,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-13 23:35:24,569 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-13 23:35:24,569 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-13 23:35:24,570 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-13 23:35:24,570 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-13 23:35:24,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-13 23:35:24,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-13 23:35:24,570 INFO L138 SettingsManager]: * Use SBE=true [2023-02-13 23:35:24,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-13 23:35:24,571 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-13 23:35:24,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-13 23:35:24,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-13 23:35:24,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-13 23:35:24,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-13 23:35:24,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-13 23:35:24,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-13 23:35:24,572 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-13 23:35:24,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-13 23:35:24,572 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-13 23:35:24,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-13 23:35:24,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-13 23:35:24,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-13 23:35:24,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-13 23:35:24,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:35:24,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-13 23:35:24,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-13 23:35:24,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-13 23:35:24,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-13 23:35:24,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-13 23:35:24,573 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-13 23:35:24,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-13 23:35:24,574 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-13 23:35:24,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-13 23:35:24,574 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-13 23:35:24,574 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 -> b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff [2023-02-13 23:35:24,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-13 23:35:24,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-13 23:35:24,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-13 23:35:24,795 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-13 23:35:24,795 INFO L275 PluginConnector]: CDTParser initialized [2023-02-13 23:35:24,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_add-2.i [2023-02-13 23:35:25,624 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-13 23:35:25,868 INFO L351 CDTParser]: Found 1 translation units. [2023-02-13 23:35:25,875 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i [2023-02-13 23:35:25,885 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07cfca726/2cb111c61bb5438283aeeda05165dc32/FLAG7f90f1062 [2023-02-13 23:35:25,895 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07cfca726/2cb111c61bb5438283aeeda05165dc32 [2023-02-13 23:35:25,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-13 23:35:25,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-13 23:35:25,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-13 23:35:25,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-13 23:35:25,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-13 23:35:25,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:35:25" (1/1) ... [2023-02-13 23:35:25,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c6fd6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:35:25, skipping insertion in model container [2023-02-13 23:35:25,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:35:25" (1/1) ... [2023-02-13 23:35:25,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-13 23:35:25,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-13 23:35:26,159 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-sets/test_add-2.i[25793,25806] [2023-02-13 23:35:26,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:35:26,173 INFO L203 MainTranslator]: Completed pre-run [2023-02-13 23:35:26,224 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-sets/test_add-2.i[25793,25806] [2023-02-13 23:35:26,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:35:26,250 INFO L208 MainTranslator]: Completed translation [2023-02-13 23:35:26,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:35:26 WrapperNode [2023-02-13 23:35:26,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-13 23:35:26,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-13 23:35:26,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-13 23:35:26,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-13 23:35:26,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:35:26" (1/1) ... [2023-02-13 23:35:26,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:35:26" (1/1) ... [2023-02-13 23:35:26,285 INFO L138 Inliner]: procedures = 135, calls = 46, calls flagged for inlining = 11, calls inlined = 7, statements flattened = 55 [2023-02-13 23:35:26,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-13 23:35:26,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-13 23:35:26,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-13 23:35:26,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-13 23:35:26,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:35:26" (1/1) ... [2023-02-13 23:35:26,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:35:26" (1/1) ... [2023-02-13 23:35:26,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:35:26" (1/1) ... [2023-02-13 23:35:26,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:35:26" (1/1) ... [2023-02-13 23:35:26,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:35:26" (1/1) ... [2023-02-13 23:35:26,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:35:26" (1/1) ... [2023-02-13 23:35:26,325 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:35:26" (1/1) ... [2023-02-13 23:35:26,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:35:26" (1/1) ... [2023-02-13 23:35:26,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-13 23:35:26,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-13 23:35:26,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-13 23:35:26,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-13 23:35:26,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:35:26" (1/1) ... [2023-02-13 23:35:26,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:35:26,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:35:26,350 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-13 23:35:26,357 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-13 23:35:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-13 23:35:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-13 23:35:26,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-13 23:35:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-13 23:35:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-13 23:35:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-13 23:35:26,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-13 23:35:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-02-13 23:35:26,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-02-13 23:35:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-13 23:35:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-13 23:35:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-13 23:35:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-13 23:35:26,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-13 23:35:26,459 INFO L235 CfgBuilder]: Building ICFG [2023-02-13 23:35:26,460 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-13 23:35:26,586 INFO L276 CfgBuilder]: Performing block encoding [2023-02-13 23:35:26,600 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-13 23:35:26,600 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-13 23:35:26,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:35:26 BoogieIcfgContainer [2023-02-13 23:35:26,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-13 23:35:26,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-13 23:35:26,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-13 23:35:26,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-13 23:35:26,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.02 11:35:25" (1/3) ... [2023-02-13 23:35:26,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbafaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:35:26, skipping insertion in model container [2023-02-13 23:35:26,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:35:26" (2/3) ... [2023-02-13 23:35:26,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbafaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:35:26, skipping insertion in model container [2023-02-13 23:35:26,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:35:26" (3/3) ... [2023-02-13 23:35:26,612 INFO L112 eAbstractionObserver]: Analyzing ICFG test_add-2.i [2023-02-13 23:35:26,624 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-13 23:35:26,624 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-13 23:35:26,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-13 23:35:26,670 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;@763a2e4a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-13 23:35:26,670 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-13 23:35:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-13 23:35:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-13 23:35:26,678 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:35:26,678 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:35:26,678 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:35:26,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:35:26,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1019691704, now seen corresponding path program 1 times [2023-02-13 23:35:26,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:35:26,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652252525] [2023-02-13 23:35:26,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:35:26,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:35:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:26,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-13 23:35:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:26,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-13 23:35:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-13 23:35:26,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:35:26,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652252525] [2023-02-13 23:35:26,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652252525] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:35:26,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:35:26,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-13 23:35:26,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274116148] [2023-02-13 23:35:26,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:35:26,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-13 23:35:26,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:35:26,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-13 23:35:26,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-13 23:35:26,835 INFO L87 Difference]: Start difference. First operand has 31 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-13 23:35:26,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:35:26,847 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2023-02-13 23:35:26,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-13 23:35:26,852 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-02-13 23:35:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:35:26,856 INFO L225 Difference]: With dead ends: 59 [2023-02-13 23:35:26,856 INFO L226 Difference]: Without dead ends: 27 [2023-02-13 23:35:26,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-13 23:35:26,860 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:35:26,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:35:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-13 23:35:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-13 23:35:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-13 23:35:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-02-13 23:35:26,890 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2023-02-13 23:35:26,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:35:26,891 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-13 23:35:26,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-13 23:35:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-02-13 23:35:26,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-13 23:35:26,893 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:35:26,893 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:35:26,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-13 23:35:26,893 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:35:26,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:35:26,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1544963960, now seen corresponding path program 1 times [2023-02-13 23:35:26,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:35:26,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205262251] [2023-02-13 23:35:26,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:35:26,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:35:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-13 23:35:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:27,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-13 23:35:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-13 23:35:27,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:35:27,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205262251] [2023-02-13 23:35:27,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205262251] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:35:27,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650446268] [2023-02-13 23:35:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:35:27,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:35:27,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:35:27,091 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-13 23:35:27,092 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-13 23:35:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:27,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-13 23:35:27,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:35:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:35:27,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-13 23:35:27,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650446268] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:35:27,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-13 23:35:27,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-02-13 23:35:27,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177570031] [2023-02-13 23:35:27,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:35:27,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:35:27,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:35:27,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:35:27,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:35:27,202 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-13 23:35:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:35:27,216 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2023-02-13 23:35:27,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 23:35:27,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-02-13 23:35:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:35:27,218 INFO L225 Difference]: With dead ends: 44 [2023-02-13 23:35:27,218 INFO L226 Difference]: Without dead ends: 31 [2023-02-13 23:35:27,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:35:27,220 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:35:27,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:35:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-13 23:35:27,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-13 23:35:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-13 23:35:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-02-13 23:35:27,226 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2023-02-13 23:35:27,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:35:27,227 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-02-13 23:35:27,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-13 23:35:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-02-13 23:35:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-13 23:35:27,228 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:35:27,229 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:35:27,236 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-13 23:35:27,433 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-13 23:35:27,434 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:35:27,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:35:27,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1439032465, now seen corresponding path program 1 times [2023-02-13 23:35:27,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:35:27,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989530343] [2023-02-13 23:35:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:35:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:35:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:27,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-13 23:35:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:27,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-13 23:35:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:35:27,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:35:27,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989530343] [2023-02-13 23:35:27,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989530343] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:35:27,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515829388] [2023-02-13 23:35:27,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:35:27,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:35:27,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:35:27,746 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-13 23:35:27,748 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-13 23:35:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:27,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-13 23:35:27,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:35:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:35:27,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-13 23:35:27,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515829388] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:35:27,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-13 23:35:27,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2023-02-13 23:35:27,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205382715] [2023-02-13 23:35:27,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:35:27,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-13 23:35:27,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:35:27,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-13 23:35:27,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-13 23:35:27,966 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-13 23:35:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:35:28,118 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2023-02-13 23:35:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-13 23:35:28,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-02-13 23:35:28,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:35:28,120 INFO L225 Difference]: With dead ends: 74 [2023-02-13 23:35:28,120 INFO L226 Difference]: Without dead ends: 34 [2023-02-13 23:35:28,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-02-13 23:35:28,123 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:35:28,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:35:28,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-13 23:35:28,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-02-13 23:35:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-13 23:35:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-02-13 23:35:28,135 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 20 [2023-02-13 23:35:28,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:35:28,135 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-02-13 23:35:28,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-13 23:35:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-02-13 23:35:28,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-13 23:35:28,136 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:35:28,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:35:28,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-13 23:35:28,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-02-13 23:35:28,345 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:35:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:35:28,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1950106983, now seen corresponding path program 1 times [2023-02-13 23:35:28,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:35:28,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269990054] [2023-02-13 23:35:28,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:35:28,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:35:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:28,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-13 23:35:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:28,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-13 23:35:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:28,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-13 23:35:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:35:28,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:35:28,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269990054] [2023-02-13 23:35:28,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269990054] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:35:28,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:35:28,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-13 23:35:28,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653418629] [2023-02-13 23:35:28,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:35:28,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-13 23:35:28,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:35:28,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-13 23:35:28,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-13 23:35:28,878 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-13 23:35:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:35:29,184 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2023-02-13 23:35:29,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-13 23:35:29,184 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2023-02-13 23:35:29,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:35:29,186 INFO L225 Difference]: With dead ends: 44 [2023-02-13 23:35:29,188 INFO L226 Difference]: Without dead ends: 37 [2023-02-13 23:35:29,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2023-02-13 23:35:29,189 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 99 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:35:29,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 60 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:35:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-13 23:35:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2023-02-13 23:35:29,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-13 23:35:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2023-02-13 23:35:29,200 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2023-02-13 23:35:29,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:35:29,204 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2023-02-13 23:35:29,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-13 23:35:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2023-02-13 23:35:29,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-13 23:35:29,205 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:35:29,205 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:35:29,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-13 23:35:29,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:35:29,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:35:29,206 INFO L85 PathProgramCache]: Analyzing trace with hash -375503678, now seen corresponding path program 1 times [2023-02-13 23:35:29,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:35:29,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423853954] [2023-02-13 23:35:29,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:35:29,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:35:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:29,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-13 23:35:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:29,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-13 23:35:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:29,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-13 23:35:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-13 23:35:29,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:35:29,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423853954] [2023-02-13 23:35:29,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423853954] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:35:29,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:35:29,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-13 23:35:29,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857067463] [2023-02-13 23:35:29,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:35:29,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-13 23:35:29,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:35:29,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-13 23:35:29,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:35:29,298 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-13 23:35:29,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:35:29,349 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2023-02-13 23:35:29,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 23:35:29,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2023-02-13 23:35:29,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:35:29,350 INFO L225 Difference]: With dead ends: 39 [2023-02-13 23:35:29,350 INFO L226 Difference]: Without dead ends: 33 [2023-02-13 23:35:29,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:35:29,351 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:35:29,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 63 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:35:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-13 23:35:29,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-02-13 23:35:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-13 23:35:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2023-02-13 23:35:29,359 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2023-02-13 23:35:29,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:35:29,360 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2023-02-13 23:35:29,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-13 23:35:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2023-02-13 23:35:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-13 23:35:29,361 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:35:29,361 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:35:29,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-13 23:35:29,361 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:35:29,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:35:29,362 INFO L85 PathProgramCache]: Analyzing trace with hash -714160700, now seen corresponding path program 1 times [2023-02-13 23:35:29,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:35:29,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765351889] [2023-02-13 23:35:29,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:35:29,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:35:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:30,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-13 23:35:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:30,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-13 23:35:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:30,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-13 23:35:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:35:30,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:35:30,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765351889] [2023-02-13 23:35:30,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765351889] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:35:30,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895922432] [2023-02-13 23:35:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:35:30,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:35:30,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:35:30,480 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-13 23:35:30,482 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-13 23:35:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:35:30,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 138 conjunts are in the unsatisfiable core [2023-02-13 23:35:30,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:35:30,864 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-13 23:35:30,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-13 23:35:30,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-13 23:35:31,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-13 23:35:31,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-13 23:35:31,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-13 23:35:31,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-13 23:35:31,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:35:31,258 INFO L321 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2023-02-13 23:35:31,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 152 [2023-02-13 23:35:31,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 106 [2023-02-13 23:35:31,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:35:31,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2023-02-13 23:35:31,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:35:31,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2023-02-13 23:35:31,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-13 23:35:31,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-13 23:35:31,305 INFO L321 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2023-02-13 23:35:31,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 42 [2023-02-13 23:35:31,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-02-13 23:35:31,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 25 [2023-02-13 23:35:31,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-13 23:35:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:35:31,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:35:32,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895922432] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:35:32,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-13 23:35:32,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2023-02-13 23:35:32,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318662943] [2023-02-13 23:35:32,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-13 23:35:32,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-13 23:35:32,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:35:32,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-13 23:35:32,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1252, Unknown=17, NotChecked=0, Total=1406 [2023-02-13 23:35:32,633 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 28 states have internal predecessors, (49), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-13 23:35:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:35:33,528 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2023-02-13 23:35:33,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-13 23:35:33,534 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 28 states have internal predecessors, (49), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2023-02-13 23:35:33,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:35:33,534 INFO L225 Difference]: With dead ends: 41 [2023-02-13 23:35:33,534 INFO L226 Difference]: Without dead ends: 0 [2023-02-13 23:35:33,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=294, Invalid=2341, Unknown=17, NotChecked=0, Total=2652 [2023-02-13 23:35:33,535 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 85 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 16 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-13 23:35:33,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 101 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 394 Invalid, 11 Unknown, 0 Unchecked, 0.4s Time] [2023-02-13 23:35:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-13 23:35:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-13 23:35:33,536 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-13 23:35:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-13 23:35:33,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2023-02-13 23:35:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:35:33,537 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-13 23:35:33,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 28 states have internal predecessors, (49), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-13 23:35:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-13 23:35:33,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-13 23:35:33,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-13 23:35:33,551 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-13 23:35:33,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:35:33,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-13 23:35:34,003 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-13 23:35:34,003 INFO L895 garLoopResultBuilder]: At program point L605(line 605) the Hoare annotation is: (and (= |~#s1~0.base| |ULTIMATE.start_ldv_list_add_~head#1.base|) (= |ULTIMATE.start_ldv_successful_malloc_#res#1.offset| 0) (not (= 3 |ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.base|)) (= |~#s1~0.offset| 0) (= 4 |ULTIMATE.start_ldv_list_add_~new#1.offset|) (not (= |ULTIMATE.start_ldv_successful_malloc_#res#1.base| 3)) (= (select |#valid| 3) 1) (= |ULTIMATE.start_foo_~j~0#1| |ULTIMATE.start_ldv_set_add_~new#1|) (not (= |ULTIMATE.start_ldv_list_add_~new#1.base| 3)) (= |ULTIMATE.start_foo_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_ldv_list_add_~new#1.base|) 0)) (= |ULTIMATE.start_ldv_set_add_~s#1.offset| |~#s1~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| |ULTIMATE.start_ldv_set_add_~s#1.base|) (= |~#s1~0.base| 3) (= |ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.offset| 0) (= |~#s1~0.offset| |ULTIMATE.start_ldv_list_add_~head#1.offset|) (= |ULTIMATE.start_ldv_list_add_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_list_add_~head#1.base|) |ULTIMATE.start_ldv_list_add_~head#1.offset|)) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) [2023-02-13 23:35:34,003 INFO L899 garLoopResultBuilder]: For program point L605-1(line 605) no Hoare annotation was computed. [2023-02-13 23:35:34,003 INFO L899 garLoopResultBuilder]: For program point L603(lines 603 606) no Hoare annotation was computed. [2023-02-13 23:35:34,003 INFO L895 garLoopResultBuilder]: At program point L667(line 667) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (and (not (= |~#s1~0.base| |ULTIMATE.start_ldv_successful_malloc_#res#1.base|)) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_list_add_~new#1.base|)) (= |~#s1~0.base| |ULTIMATE.start_ldv_list_add_~head#1.base|) (not (= 3 |ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.base|)) (= |~#s1~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) 4) (= (select |#valid| 3) 1) (= |ULTIMATE.start_ldv_set_add_~s#1.offset| |~#s1~0.offset|) (= |~#s1~0.base| |ULTIMATE.start_ldv_set_add_~s#1.base|) (= |~#s1~0.base| 3) (= |ULTIMATE.start_foo_~j~0#1| (select (select |#memory_int| .cse0) 0)) (not (= |~#s1~0.base| .cse0)) (= |~#s1~0.offset| |ULTIMATE.start_ldv_list_add_~head#1.offset|))) [2023-02-13 23:35:34,003 INFO L899 garLoopResultBuilder]: For program point L667-1(line 667) no Hoare annotation was computed. [2023-02-13 23:35:34,003 INFO L899 garLoopResultBuilder]: For program point L667-2(line 667) no Hoare annotation was computed. [2023-02-13 23:35:34,003 INFO L899 garLoopResultBuilder]: For program point L632(lines 632 639) no Hoare annotation was computed. [2023-02-13 23:35:34,003 INFO L899 garLoopResultBuilder]: For program point L667-3(line 667) no Hoare annotation was computed. [2023-02-13 23:35:34,003 INFO L899 garLoopResultBuilder]: For program point L663(lines 663 668) no Hoare annotation was computed. [2023-02-13 23:35:34,003 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 566) no Hoare annotation was computed. [2023-02-13 23:35:34,003 INFO L895 garLoopResultBuilder]: At program point ldv_successful_malloc_returnLabel#1(lines 575 579) the Hoare annotation is: (and (= |ULTIMATE.start_ldv_successful_malloc_#res#1.offset| 0) (not (= 3 |ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.base|)) (not (= |ULTIMATE.start_ldv_successful_malloc_#res#1.base| 3)) (= (select |#valid| 3) 1) (= |ULTIMATE.start_foo_~j~0#1| |ULTIMATE.start_ldv_set_add_~new#1|) (= |ULTIMATE.start_ldv_set_add_~s#1.offset| |~#s1~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| |ULTIMATE.start_ldv_set_add_~s#1.base|) (= |~#s1~0.base| 3) (= |ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.offset| 0) (= |ULTIMATE.start_ldv_set_add_~s#1.offset| 0) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) [2023-02-13 23:35:34,003 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-13 23:35:34,004 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 669 673) the Hoare annotation is: true [2023-02-13 23:35:34,004 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-13 23:35:34,004 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-13 23:35:34,004 INFO L895 garLoopResultBuilder]: At program point L633(line 633) the Hoare annotation is: (and (= (select |#valid| 3) 1) (= |ULTIMATE.start_foo_~j~0#1| |ULTIMATE.start_ldv_set_add_~new#1|) (= |ULTIMATE.start_ldv_set_add_~s#1.offset| |~#s1~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (= |~#s1~0.base| |ULTIMATE.start_ldv_set_add_~s#1.base|) (= |~#s1~0.base| 3) (= |ULTIMATE.start_ldv_set_add_~s#1.offset| 0) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) [2023-02-13 23:35:34,004 INFO L899 garLoopResultBuilder]: For program point L633-1(line 633) no Hoare annotation was computed. [2023-02-13 23:35:34,004 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 667) no Hoare annotation was computed. [2023-02-13 23:35:34,004 INFO L899 garLoopResultBuilder]: For program point L633-2(lines 633 638) no Hoare annotation was computed. [2023-02-13 23:35:34,005 INFO L899 garLoopResultBuilder]: For program point L565(line 565) no Hoare annotation was computed. [2023-02-13 23:35:34,005 INFO L899 garLoopResultBuilder]: For program point ldv_is_in_setEXIT(lines 650 658) no Hoare annotation was computed. [2023-02-13 23:35:34,005 INFO L899 garLoopResultBuilder]: For program point ldv_is_in_setFINAL(lines 650 658) no Hoare annotation was computed. [2023-02-13 23:35:34,005 INFO L899 garLoopResultBuilder]: For program point L653(lines 653 655) no Hoare annotation was computed. [2023-02-13 23:35:34,005 INFO L899 garLoopResultBuilder]: For program point L652-2(lines 652 656) no Hoare annotation was computed. [2023-02-13 23:35:34,005 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 650 658) the Hoare annotation is: true [2023-02-13 23:35:34,005 INFO L895 garLoopResultBuilder]: At program point L652-3(lines 652 656) the Hoare annotation is: (let ((.cse1 (= |ldv_is_in_set_#in~s.base| ldv_is_in_set_~s.base)) (.cse3 (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)) (.cse2 (= |ldv_is_in_set_#in~s.offset| ldv_is_in_set_~s.offset)) (.cse4 (select (select |#memory_$Pointer$.offset| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset))) (let ((.cse0 (not (= (select |#valid| 3) 1))) (.cse5 (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|)) (.cse6 (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (.cse7 (not (= |~#s1~0.base| 3))) (.cse8 (not (= |~#s1~0.offset| 0))) (.cse9 (and .cse1 (= .cse3 ldv_is_in_set_~m~1.base) .cse2 (= .cse4 (+ ldv_is_in_set_~m~1.offset 4)) (= |ldv_is_in_set_#in~e| ldv_is_in_set_~e)))) (and (or .cse0 (and .cse1 .cse2 (not (= (select (select |#memory_int| .cse3) (+ .cse4 (- 4))) |ldv_is_in_set_#in~e|))) (not (= .cse5 4)) .cse6 .cse7 .cse8 .cse9) (or .cse0 (not (= .cse5 |~#s1~0.offset|)) (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.base|)) (not .cse6) .cse7 .cse8 .cse9)))) [2023-02-13 23:35:34,005 INFO L899 garLoopResultBuilder]: For program point L652-4(lines 652 656) no Hoare annotation was computed. [2023-02-13 23:35:34,006 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 589 597) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= |~#s1~0.base| (select (select |old(#memory_$Pointer$.base)| |~#s1~0.base|) |~#s1~0.offset|))) (not (= (select |#valid| 3) 1)) (not (= |~#s1~0.base| 3)) (not (= |~#s1~0.offset| 0)) (not (= |~#s1~0.offset| (select (select |old(#memory_$Pointer$.offset)| |~#s1~0.base|) |~#s1~0.offset|)))) [2023-02-13 23:35:34,006 INFO L899 garLoopResultBuilder]: For program point __ldv_list_addFINAL(lines 589 597) no Hoare annotation was computed. [2023-02-13 23:35:34,006 INFO L899 garLoopResultBuilder]: For program point __ldv_list_addEXIT(lines 589 597) no Hoare annotation was computed. [2023-02-13 23:35:34,008 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-02-13 23:35:34,009 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-13 23:35:34,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,018 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,018 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,018 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,018 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,018 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,018 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,019 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,019 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,021 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,021 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,021 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,023 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,023 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,024 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,024 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,025 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,025 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.02 11:35:34 BoogieIcfgContainer [2023-02-13 23:35:34,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-13 23:35:34,026 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-13 23:35:34,026 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-13 23:35:34,026 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-13 23:35:34,027 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:35:26" (3/4) ... [2023-02-13 23:35:34,029 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-13 23:35:34,033 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_in_set [2023-02-13 23:35:34,033 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2023-02-13 23:35:34,035 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2023-02-13 23:35:34,035 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-02-13 23:35:34,036 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-13 23:35:34,036 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-13 23:35:34,050 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\valid[3] == 1) || ((s == s && s == s) && !(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + -4] == \old(e)))) || !(#memory_$Pointer$[s1][s1] == 4)) || s1 == #memory_$Pointer$[s1][s1]) || !(s1 == 3)) || !(s1 == 0)) || ((((s == s && #memory_$Pointer$[s][s] == m) && s == s) && #memory_$Pointer$[s][s] == m + 4) && \old(e) == e)) && (((((((!(\valid[3] == 1) || !(#memory_$Pointer$[s1][s1] == s1)) || !(#memory_$Pointer$[s][s] == s)) || !(#memory_$Pointer$[s][s] == s)) || !(s1 == #memory_$Pointer$[s1][s1])) || !(s1 == 3)) || !(s1 == 0)) || ((((s == s && #memory_$Pointer$[s][s] == m) && s == s) && #memory_$Pointer$[s][s] == m + 4) && \old(e) == e)) [2023-02-13 23:35:34,051 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\result == 0 && !(3 == ptr)) && !(\result == 3)) && \valid[3] == 1) && j == new) && s == s1) && #memory_$Pointer$[s1][s1] == s1) && s1 == s) && s1 == 3) && ptr == 0) && s == 0) && s1 == #memory_$Pointer$[s1][s1] [2023-02-13 23:35:34,057 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-13 23:35:34,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-13 23:35:34,057 INFO L158 Benchmark]: Toolchain (without parser) took 8160.26ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 155.8MB in the beginning and 104.2MB in the end (delta: 51.6MB). Peak memory consumption was 137.6MB. Max. memory is 16.1GB. [2023-02-13 23:35:34,058 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory was 96.6MB in the beginning and 96.5MB in the end (delta: 76.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-13 23:35:34,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.35ms. Allocated memory is still 186.6MB. Free memory was 155.8MB in the beginning and 137.1MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-13 23:35:34,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.61ms. Allocated memory is still 186.6MB. Free memory was 137.1MB in the beginning and 135.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-13 23:35:34,058 INFO L158 Benchmark]: Boogie Preprocessor took 39.84ms. Allocated memory is still 186.6MB. Free memory was 135.0MB in the beginning and 133.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-13 23:35:34,059 INFO L158 Benchmark]: RCFGBuilder took 274.08ms. Allocated memory is still 186.6MB. Free memory was 132.9MB in the beginning and 118.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-13 23:35:34,059 INFO L158 Benchmark]: TraceAbstraction took 7422.99ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 118.2MB in the beginning and 107.3MB in the end (delta: 10.9MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2023-02-13 23:35:34,059 INFO L158 Benchmark]: Witness Printer took 30.95ms. Allocated memory is still 270.5MB. Free memory was 107.3MB in the beginning and 104.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-13 23:35:34,060 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory was 96.6MB in the beginning and 96.5MB in the end (delta: 76.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.35ms. Allocated memory is still 186.6MB. Free memory was 155.8MB in the beginning and 137.1MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.61ms. Allocated memory is still 186.6MB. Free memory was 137.1MB in the beginning and 135.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.84ms. Allocated memory is still 186.6MB. Free memory was 135.0MB in the beginning and 133.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 274.08ms. Allocated memory is still 186.6MB. Free memory was 132.9MB in the beginning and 118.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7422.99ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 118.2MB in the beginning and 107.3MB in the end (delta: 10.9MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. * Witness Printer took 30.95ms. Allocated memory is still 270.5MB. Free memory was 107.3MB in the beginning and 104.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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: 667]: 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 3 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 301 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 668 IncrementalHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 130 mSDtfsCounter, 668 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=4, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 18 PreInvPairs, 25 NumberOfFragments, 420 HoareAnnotationTreeSize, 18 FomulaSimplifications, 18 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 435 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 213 ConstructedInterpolants, 6 QuantifiedInterpolants, 3082 SizeOfPredicates, 57 NumberOfNonLiveVariables, 543 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 33/46 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: 669]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 652]: Loop Invariant [2023-02-13 23:35:34,082 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,082 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,082 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,082 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,082 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,082 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,082 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,082 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,082 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,083 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,083 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,083 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,083 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,084 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((!(\valid[3] == 1) || ((s == s && s == s) && !(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + -4] == \old(e)))) || !(#memory_$Pointer$[s1][s1] == 4)) || s1 == #memory_$Pointer$[s1][s1]) || !(s1 == 3)) || !(s1 == 0)) || ((((s == s && #memory_$Pointer$[s][s] == m) && s == s) && #memory_$Pointer$[s][s] == m + 4) && \old(e) == e)) && (((((((!(\valid[3] == 1) || !(#memory_$Pointer$[s1][s1] == s1)) || !(#memory_$Pointer$[s][s] == s)) || !(#memory_$Pointer$[s][s] == s)) || !(s1 == #memory_$Pointer$[s1][s1])) || !(s1 == 3)) || !(s1 == 0)) || ((((s == s && #memory_$Pointer$[s][s] == m) && s == s) && #memory_$Pointer$[s][s] == m + 4) && \old(e) == e)) - InvariantResult [Line: 575]: Loop Invariant [2023-02-13 23:35:34,085 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,085 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-13 23:35:34,085 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-13 23:35:34,086 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((\result == 0 && !(3 == ptr)) && !(\result == 3)) && \valid[3] == 1) && j == new) && s == s1) && #memory_$Pointer$[s1][s1] == s1) && s1 == s) && s1 == 3) && ptr == 0) && s == 0) && s1 == #memory_$Pointer$[s1][s1] RESULT: Ultimate proved your program to be correct! [2023-02-13 23:35:34,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE