./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list_search-1.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/list-properties/list_search-1.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 ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-13 23:23:24,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-13 23:23:24,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-13 23:23:24,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-13 23:23:24,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-13 23:23:24,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-13 23:23:24,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-13 23:23:24,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-13 23:23:24,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-13 23:23:24,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-13 23:23:24,323 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-13 23:23:24,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-13 23:23:24,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-13 23:23:24,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-13 23:23:24,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-13 23:23:24,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-13 23:23:24,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-13 23:23:24,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-13 23:23:24,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-13 23:23:24,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-13 23:23:24,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-13 23:23:24,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-13 23:23:24,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-13 23:23:24,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-13 23:23:24,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-13 23:23:24,346 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-13 23:23:24,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-13 23:23:24,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-13 23:23:24,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-13 23:23:24,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-13 23:23:24,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-13 23:23:24,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-13 23:23:24,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-13 23:23:24,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-13 23:23:24,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-13 23:23:24,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-13 23:23:24,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-13 23:23:24,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-13 23:23:24,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-13 23:23:24,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-13 23:23:24,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-13 23:23:24,354 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:23:24,380 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-13 23:23:24,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-13 23:23:24,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-13 23:23:24,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-13 23:23:24,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-13 23:23:24,382 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-13 23:23:24,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-13 23:23:24,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-13 23:23:24,383 INFO L138 SettingsManager]: * Use SBE=true [2023-02-13 23:23:24,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-13 23:23:24,383 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-13 23:23:24,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-13 23:23:24,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-13 23:23:24,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-13 23:23:24,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-13 23:23:24,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-13 23:23:24,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-13 23:23:24,384 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-13 23:23:24,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-13 23:23:24,385 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-13 23:23:24,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-13 23:23:24,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-13 23:23:24,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-13 23:23:24,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-13 23:23:24,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:23:24,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-13 23:23:24,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-13 23:23:24,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-13 23:23:24,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-13 23:23:24,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-13 23:23:24,386 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-13 23:23:24,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-13 23:23:24,387 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-13 23:23:24,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-13 23:23:24,387 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-13 23:23:24,387 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 -> ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 [2023-02-13 23:23:24,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-13 23:23:24,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-13 23:23:24,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-13 23:23:24,603 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-13 23:23:24,603 INFO L275 PluginConnector]: CDTParser initialized [2023-02-13 23:23:24,604 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-1.i [2023-02-13 23:23:25,545 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-13 23:23:25,751 INFO L351 CDTParser]: Found 1 translation units. [2023-02-13 23:23:25,751 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i [2023-02-13 23:23:25,763 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853e2664f/00e06daf70e7441a85d310b760fa4f95/FLAG18858d569 [2023-02-13 23:23:25,776 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853e2664f/00e06daf70e7441a85d310b760fa4f95 [2023-02-13 23:23:25,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-13 23:23:25,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-13 23:23:25,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-13 23:23:25,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-13 23:23:25,784 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-13 23:23:25,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:23:25" (1/1) ... [2023-02-13 23:23:25,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c9a5cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:23:25, skipping insertion in model container [2023-02-13 23:23:25,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:23:25" (1/1) ... [2023-02-13 23:23:25,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-13 23:23:25,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-13 23:23:25,916 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/list-properties/list_search-1.i[813,826] [2023-02-13 23:23:25,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:23:25,986 INFO L203 MainTranslator]: Completed pre-run [2023-02-13 23:23:25,993 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/list-properties/list_search-1.i[813,826] [2023-02-13 23:23:26,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:23:26,032 INFO L208 MainTranslator]: Completed translation [2023-02-13 23:23:26,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:23:26 WrapperNode [2023-02-13 23:23:26,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-13 23:23:26,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-13 23:23:26,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-13 23:23:26,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-13 23:23:26,038 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:23:26" (1/1) ... [2023-02-13 23:23:26,054 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:23:26" (1/1) ... [2023-02-13 23:23:26,067 INFO L138 Inliner]: procedures = 125, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2023-02-13 23:23:26,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-13 23:23:26,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-13 23:23:26,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-13 23:23:26,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-13 23:23:26,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:23:26" (1/1) ... [2023-02-13 23:23:26,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:23:26" (1/1) ... [2023-02-13 23:23:26,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:23:26" (1/1) ... [2023-02-13 23:23:26,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:23:26" (1/1) ... [2023-02-13 23:23:26,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:23:26" (1/1) ... [2023-02-13 23:23:26,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:23:26" (1/1) ... [2023-02-13 23:23:26,091 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:23:26" (1/1) ... [2023-02-13 23:23:26,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:23:26" (1/1) ... [2023-02-13 23:23:26,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-13 23:23:26,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-13 23:23:26,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-13 23:23:26,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-13 23:23:26,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:23:26" (1/1) ... [2023-02-13 23:23:26,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:23:26,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:23:26,160 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:23:26,161 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:23:26,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-13 23:23:26,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-13 23:23:26,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-13 23:23:26,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-13 23:23:26,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-13 23:23:26,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-13 23:23:26,194 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2023-02-13 23:23:26,194 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2023-02-13 23:23:26,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-13 23:23:26,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-13 23:23:26,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-13 23:23:26,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-13 23:23:26,287 INFO L235 CfgBuilder]: Building ICFG [2023-02-13 23:23:26,289 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-13 23:23:26,465 INFO L276 CfgBuilder]: Performing block encoding [2023-02-13 23:23:26,473 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-13 23:23:26,474 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-13 23:23:26,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:23:26 BoogieIcfgContainer [2023-02-13 23:23:26,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-13 23:23:26,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-13 23:23:26,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-13 23:23:26,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-13 23:23:26,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.02 11:23:25" (1/3) ... [2023-02-13 23:23:26,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a15458d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:23:26, skipping insertion in model container [2023-02-13 23:23:26,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:23:26" (2/3) ... [2023-02-13 23:23:26,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a15458d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:23:26, skipping insertion in model container [2023-02-13 23:23:26,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:23:26" (3/3) ... [2023-02-13 23:23:26,496 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2023-02-13 23:23:26,507 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-13 23:23:26,507 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-13 23:23:26,537 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-13 23:23:26,541 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;@1a8ee51e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-13 23:23:26,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-13 23:23:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-13 23:23:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-13 23:23:26,550 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:23:26,551 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:23:26,551 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:23:26,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:23:26,555 INFO L85 PathProgramCache]: Analyzing trace with hash -547062782, now seen corresponding path program 1 times [2023-02-13 23:23:26,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:23:26,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511136698] [2023-02-13 23:23:26,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:23:26,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:23:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:26,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-13 23:23:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:27,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-13 23:23:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:27,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-13 23:23:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-13 23:23:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-13 23:23:27,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:23:27,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511136698] [2023-02-13 23:23:27,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511136698] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:23:27,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897216478] [2023-02-13 23:23:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:23:27,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:23:27,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:23:27,066 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:23:27,068 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:23:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:27,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-13 23:23:27,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:23:27,226 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-13 23:23:27,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-13 23:23:27,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897216478] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:23:27,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-13 23:23:27,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2023-02-13 23:23:27,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137549777] [2023-02-13 23:23:27,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:23:27,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-13 23:23:27,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:23:27,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-13 23:23:27,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:23:27,257 INFO L87 Difference]: Start difference. First operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-13 23:23:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:23:27,270 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-02-13 23:23:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-13 23:23:27,272 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2023-02-13 23:23:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:23:27,276 INFO L225 Difference]: With dead ends: 38 [2023-02-13 23:23:27,276 INFO L226 Difference]: Without dead ends: 23 [2023-02-13 23:23:27,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:23:27,284 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:23:27,285 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:23:27,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-13 23:23:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-13 23:23:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-13 23:23:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-02-13 23:23:27,312 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 35 [2023-02-13 23:23:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:23:27,313 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-02-13 23:23:27,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-13 23:23:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-02-13 23:23:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-13 23:23:27,316 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:23:27,316 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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:23:27,325 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:23:27,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-13 23:23:27,522 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:23:27,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:23:27,523 INFO L85 PathProgramCache]: Analyzing trace with hash -745059685, now seen corresponding path program 1 times [2023-02-13 23:23:27,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:23:27,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547720700] [2023-02-13 23:23:27,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:23:27,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:23:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:27,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-13 23:23:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:27,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-13 23:23:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:27,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-13 23:23:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:27,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-13 23:23:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-13 23:23:27,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:23:27,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547720700] [2023-02-13 23:23:27,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547720700] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:23:27,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643011806] [2023-02-13 23:23:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:23:27,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:23:27,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:23:27,713 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:23:27,743 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:23:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:27,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 23:23:27,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:23:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-13 23:23:27,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:23:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-13 23:23:28,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643011806] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:23:28,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:23:28,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2023-02-13 23:23:28,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675398687] [2023-02-13 23:23:28,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:23:28,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-13 23:23:28,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:23:28,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-13 23:23:28,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-13 23:23:28,011 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-13 23:23:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:23:28,102 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2023-02-13 23:23:28,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-13 23:23:28,102 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2023-02-13 23:23:28,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:23:28,104 INFO L225 Difference]: With dead ends: 47 [2023-02-13 23:23:28,104 INFO L226 Difference]: Without dead ends: 29 [2023-02-13 23:23:28,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-02-13 23:23:28,105 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:23:28,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 79 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:23:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-13 23:23:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-02-13 23:23:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-13 23:23:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-02-13 23:23:28,110 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 37 [2023-02-13 23:23:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:23:28,110 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-02-13 23:23:28,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-13 23:23:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-02-13 23:23:28,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-13 23:23:28,111 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:23:28,111 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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:23:28,121 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:23:28,319 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,SelfDestructingSolverStorable1 [2023-02-13 23:23:28,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:23:28,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:23:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash -2113798375, now seen corresponding path program 1 times [2023-02-13 23:23:28,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:23:28,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944614927] [2023-02-13 23:23:28,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:23:28,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:23:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:28,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-13 23:23:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:28,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-13 23:23:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:28,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-13 23:23:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:28,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-13 23:23:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-13 23:23:28,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:23:28,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944614927] [2023-02-13 23:23:28,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944614927] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:23:28,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:23:28,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-13 23:23:28,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217563032] [2023-02-13 23:23:28,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:23:28,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-13 23:23:28,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:23:28,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-13 23:23:28,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-13 23:23:28,663 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-13 23:23:28,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:23:28,780 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2023-02-13 23:23:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-13 23:23:28,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-02-13 23:23:28,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:23:28,781 INFO L225 Difference]: With dead ends: 43 [2023-02-13 23:23:28,781 INFO L226 Difference]: Without dead ends: 38 [2023-02-13 23:23:28,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-13 23:23:28,782 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:23:28,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 76 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:23:28,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-13 23:23:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2023-02-13 23:23:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-13 23:23:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-02-13 23:23:28,787 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 37 [2023-02-13 23:23:28,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:23:28,787 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-02-13 23:23:28,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-13 23:23:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-02-13 23:23:28,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-13 23:23:28,788 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:23:28,788 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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:23:28,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-13 23:23:28,789 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:23:28,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:23:28,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2056540073, now seen corresponding path program 1 times [2023-02-13 23:23:28,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:23:28,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294456452] [2023-02-13 23:23:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:23:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:23:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:28,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-13 23:23:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:28,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-13 23:23:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:28,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-13 23:23:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:28,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-13 23:23:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-13 23:23:28,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:23:28,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294456452] [2023-02-13 23:23:28,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294456452] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:23:28,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:23:28,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-13 23:23:28,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910653279] [2023-02-13 23:23:28,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:23:28,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-13 23:23:28,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:23:28,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-13 23:23:28,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:23:28,916 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-13 23:23:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:23:29,015 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2023-02-13 23:23:29,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-13 23:23:29,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-02-13 23:23:29,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:23:29,016 INFO L225 Difference]: With dead ends: 40 [2023-02-13 23:23:29,016 INFO L226 Difference]: Without dead ends: 32 [2023-02-13 23:23:29,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-02-13 23:23:29,017 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:23:29,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 88 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:23:29,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-13 23:23:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-02-13 23:23:29,020 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), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-13 23:23:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-02-13 23:23:29,021 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 37 [2023-02-13 23:23:29,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:23:29,021 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-02-13 23:23:29,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-13 23:23:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-02-13 23:23:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-13 23:23:29,021 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:23:29,021 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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:23:29,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-13 23:23:29,022 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:23:29,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:23:29,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1005030197, now seen corresponding path program 1 times [2023-02-13 23:23:29,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:23:29,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732846660] [2023-02-13 23:23:29,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:23:29,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:23:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:29,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-13 23:23:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:29,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-13 23:23:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:29,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-13 23:23:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:29,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-13 23:23:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-13 23:23:29,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:23:29,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732846660] [2023-02-13 23:23:29,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732846660] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:23:29,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943733973] [2023-02-13 23:23:29,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:23:29,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:23:29,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:23:29,899 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:23:29,901 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:23:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:30,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 75 conjunts are in the unsatisfiable core [2023-02-13 23:23:30,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:23:30,061 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 6 treesize of output 5 [2023-02-13 23:23:30,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:23:30,072 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 16 treesize of output 17 [2023-02-13 23:23:30,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2023-02-13 23:23:30,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2023-02-13 23:23:30,286 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-02-13 23:23:30,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-02-13 23:23:30,303 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-13 23:23:30,303 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 15 treesize of output 15 [2023-02-13 23:23:30,384 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 27 treesize of output 15 [2023-02-13 23:23:30,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-02-13 23:23:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-13 23:23:30,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:23:30,580 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_41 Int) (v_ArrVal_851 (Array Int Int))) (or (not (= (select |c_#valid| v_~head~0.base_41) 0)) (not (= 2 (select (select (store |c_#memory_int| v_~head~0.base_41 v_ArrVal_851) c_~head~0.base) c_~head~0.offset))))) is different from false [2023-02-13 23:23:30,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943733973] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:23:30,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-13 23:23:30,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2023-02-13 23:23:30,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103046205] [2023-02-13 23:23:30,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-13 23:23:30,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-13 23:23:30,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:23:30,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-13 23:23:30,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=543, Unknown=1, NotChecked=46, Total=650 [2023-02-13 23:23:30,598 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-13 23:23:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:23:31,154 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2023-02-13 23:23:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-13 23:23:31,155 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2023-02-13 23:23:31,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:23:31,156 INFO L225 Difference]: With dead ends: 48 [2023-02-13 23:23:31,156 INFO L226 Difference]: Without dead ends: 40 [2023-02-13 23:23:31,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=1173, Unknown=1, NotChecked=70, Total=1406 [2023-02-13 23:23:31,157 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-13 23:23:31,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 167 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-13 23:23:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-13 23:23:31,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2023-02-13 23:23:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-13 23:23:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2023-02-13 23:23:31,162 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 40 [2023-02-13 23:23:31,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:23:31,162 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2023-02-13 23:23:31,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-13 23:23:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2023-02-13 23:23:31,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-13 23:23:31,163 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:23:31,163 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:23:31,171 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:23:31,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:23:31,373 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:23:31,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:23:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2009254361, now seen corresponding path program 2 times [2023-02-13 23:23:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:23:31,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813097774] [2023-02-13 23:23:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:23:31,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:23:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:32,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-13 23:23:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:32,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-13 23:23:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:32,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-13 23:23:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:32,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-13 23:23:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-13 23:23:32,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:23:32,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813097774] [2023-02-13 23:23:32,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813097774] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:23:32,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86768837] [2023-02-13 23:23:32,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-13 23:23:32,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:23:32,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:23:32,833 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 23:23:32,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-13 23:23:32,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-13 23:23:32,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:23:32,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 110 conjunts are in the unsatisfiable core [2023-02-13 23:23:32,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:23:32,986 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 6 treesize of output 5 [2023-02-13 23:23:33,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:23:33,033 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 16 treesize of output 17 [2023-02-13 23:23:33,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2023-02-13 23:23:33,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2023-02-13 23:23:33,354 INFO L321 Elim1Store]: treesize reduction 36, result has 37.9 percent of original size [2023-02-13 23:23:33,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2023-02-13 23:23:33,363 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 20 treesize of output 22 [2023-02-13 23:23:33,493 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-13 23:23:33,500 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-13 23:23:33,634 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-02-13 23:23:33,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-02-13 23:23:33,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:23:33,645 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 53 treesize of output 36 [2023-02-13 23:23:33,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:23:33,655 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-02-13 23:23:33,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-02-13 23:23:33,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-02-13 23:23:33,873 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:23:33,880 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-13 23:23:33,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 49 [2023-02-13 23:23:33,890 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-13 23:23:33,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2023-02-13 23:23:33,931 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:23:33,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 10 [2023-02-13 23:23:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:23:33,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:23:34,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:23:34,207 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2023-02-13 23:23:34,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:23:34,213 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2023-02-13 23:23:34,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86768837] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:23:34,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-13 23:23:34,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2023-02-13 23:23:34,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715302056] [2023-02-13 23:23:34,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-13 23:23:34,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-13 23:23:34,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:23:34,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-13 23:23:34,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1534, Unknown=0, NotChecked=0, Total=1640 [2023-02-13 23:23:34,269 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 31 states have internal predecessors, (59), 5 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-13 23:23:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:23:36,404 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2023-02-13 23:23:36,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-13 23:23:36,405 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 31 states have internal predecessors, (59), 5 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 43 [2023-02-13 23:23:36,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:23:36,406 INFO L225 Difference]: With dead ends: 77 [2023-02-13 23:23:36,406 INFO L226 Difference]: Without dead ends: 72 [2023-02-13 23:23:36,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=461, Invalid=3961, Unknown=0, NotChecked=0, Total=4422 [2023-02-13 23:23:36,408 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 161 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 33 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-13 23:23:36,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 416 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 853 Invalid, 6 Unknown, 0 Unchecked, 0.7s Time] [2023-02-13 23:23:36,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-13 23:23:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2023-02-13 23:23:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-13 23:23:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2023-02-13 23:23:36,420 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 43 [2023-02-13 23:23:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:23:36,420 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2023-02-13 23:23:36,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 31 states have internal predecessors, (59), 5 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-13 23:23:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2023-02-13 23:23:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-13 23:23:36,422 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:23:36,422 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:23:36,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-13 23:23:36,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:23:36,628 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:23:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:23:36,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2066512663, now seen corresponding path program 1 times [2023-02-13 23:23:36,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:23:36,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600794441] [2023-02-13 23:23:36,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:23:36,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:23:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:37,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-13 23:23:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:37,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-13 23:23:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:37,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-13 23:23:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:37,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-13 23:23:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-13 23:23:37,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:23:37,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600794441] [2023-02-13 23:23:37,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600794441] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:23:37,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859117036] [2023-02-13 23:23:37,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:23:37,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:23:37,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:23:37,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 23:23:37,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-13 23:23:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:23:37,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-13 23:23:37,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:23:37,517 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 6 treesize of output 5 [2023-02-13 23:23:37,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2023-02-13 23:23:37,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2023-02-13 23:23:37,677 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-13 23:23:37,737 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-13 23:23:37,740 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 15 treesize of output 15 [2023-02-13 23:23:37,745 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 21 treesize of output 16 [2023-02-13 23:23:37,803 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 15 treesize of output 7 [2023-02-13 23:23:37,845 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-13 23:23:37,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2023-02-13 23:23:37,851 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:23:37,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:23:37,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:23:37,979 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2023-02-13 23:23:37,983 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_~head~0.base_53 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_53 v_arrayElimArr_6) c_~head~0.base) (+ c_~head~0.offset 4)) 0)) (not (= (select |c_#valid| v_~head~0.base_53) 0)) (not (= (select v_arrayElimArr_6 4) c_~head~0.base)))) is different from false [2023-02-13 23:23:37,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859117036] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:23:37,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-13 23:23:37,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 28 [2023-02-13 23:23:37,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412976313] [2023-02-13 23:23:37,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-13 23:23:37,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-13 23:23:37,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:23:37,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-13 23:23:37,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=843, Unknown=1, NotChecked=58, Total=992 [2023-02-13 23:23:37,985 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 23 states have internal predecessors, (55), 4 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-13 23:23:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:23:38,945 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2023-02-13 23:23:38,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-13 23:23:38,946 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 23 states have internal predecessors, (55), 4 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 43 [2023-02-13 23:23:38,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:23:38,946 INFO L225 Difference]: With dead ends: 75 [2023-02-13 23:23:38,946 INFO L226 Difference]: Without dead ends: 59 [2023-02-13 23:23:38,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=450, Invalid=2523, Unknown=1, NotChecked=106, Total=3080 [2023-02-13 23:23:38,948 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 117 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-13 23:23:38,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 218 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-13 23:23:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-13 23:23:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2023-02-13 23:23:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-13 23:23:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2023-02-13 23:23:38,958 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 43 [2023-02-13 23:23:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:23:38,959 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2023-02-13 23:23:38,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 23 states have internal predecessors, (55), 4 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-13 23:23:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2023-02-13 23:23:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-13 23:23:38,959 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:23:38,960 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:23:38,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-13 23:23:39,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:23:39,165 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:23:39,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:23:39,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1384296971, now seen corresponding path program 3 times [2023-02-13 23:23:39,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:23:39,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7668719] [2023-02-13 23:23:39,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:23:39,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:23:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 23:23:39,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 23:23:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 23:23:39,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 23:23:39,224 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-13 23:23:39,225 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-13 23:23:39,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-13 23:23:39,230 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-02-13 23:23:39,232 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-13 23:23:39,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.02 11:23:39 BoogieIcfgContainer [2023-02-13 23:23:39,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-13 23:23:39,258 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-13 23:23:39,258 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-13 23:23:39,258 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-13 23:23:39,259 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:23:26" (3/4) ... [2023-02-13 23:23:39,260 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-13 23:23:39,289 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-13 23:23:39,289 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-13 23:23:39,290 INFO L158 Benchmark]: Toolchain (without parser) took 13510.13ms. Allocated memory was 117.4MB in the beginning and 302.0MB in the end (delta: 184.5MB). Free memory was 77.5MB in the beginning and 228.4MB in the end (delta: -150.9MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2023-02-13 23:23:39,290 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-13 23:23:39,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.11ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 60.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-13 23:23:39,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.54ms. Allocated memory is still 117.4MB. Free memory was 60.4MB in the beginning and 58.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-13 23:23:39,290 INFO L158 Benchmark]: Boogie Preprocessor took 35.54ms. Allocated memory is still 117.4MB. Free memory was 58.7MB in the beginning and 56.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-13 23:23:39,291 INFO L158 Benchmark]: RCFGBuilder took 386.90ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 56.9MB in the beginning and 139.6MB in the end (delta: -82.6MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2023-02-13 23:23:39,291 INFO L158 Benchmark]: TraceAbstraction took 12765.87ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 138.8MB in the beginning and 232.6MB in the end (delta: -93.8MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2023-02-13 23:23:39,291 INFO L158 Benchmark]: Witness Printer took 31.31ms. Allocated memory is still 302.0MB. Free memory was 232.6MB in the beginning and 228.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-13 23:23:39,292 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.24ms. Allocated memory is still 117.4MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.11ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 60.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.54ms. Allocated memory is still 117.4MB. Free memory was 60.4MB in the beginning and 58.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.54ms. Allocated memory is still 117.4MB. Free memory was 58.7MB in the beginning and 56.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 386.90ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 56.9MB in the beginning and 139.6MB in the end (delta: -82.6MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12765.87ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 138.8MB in the beginning and 232.6MB in the end (delta: -93.8MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 31.31ms. Allocated memory is still 302.0MB. Free memory was 232.6MB in the beginning and 228.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L533] mlist *head; VAL [head={0:0}] [L554] int i; [L555] mlist *mylist, *temp; VAL [head={0:0}] [L556] CALL insert_list(mylist,2) VAL [\old(head)={0:0}, \old(k)=2, head={0:0}, l={55:64}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)={0:0}, \old(k)=2, head={0:0}, k=2, l={-1:0}, l={55:64}] [L544] COND TRUE head==((void *)0) [L545] l->next = ((void *)0) VAL [\old(head)={0:0}, \old(k)=2, head={0:0}, k=2, l={-1:0}, l={55:64}] [L550] head = l [L551] return 0; VAL [\old(head)={0:0}, \old(k)=2, \result=0, head={-1:0}, k=2, l={-1:0}, l={55:64}] [L556] RET insert_list(mylist,2) VAL [head={-1:0}, insert_list(mylist,2)=0, mylist={55:64}] [L557] CALL insert_list(mylist,5) VAL [\old(head)={-1:0}, \old(k)=5, head={-1:0}, l={55:64}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)={-1:0}, \old(k)=5, head={-1:0}, k=5, l={-5:0}, l={55:64}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(head)={-1:0}, \old(k)=5, head={-1:0}, k=5, l={55:64}, l={-5:0}] [L550] head = l [L551] return 0; VAL [\old(head)={-1:0}, \old(k)=5, \result=0, head={-5:0}, k=5, l={55:64}, l={-5:0}] [L557] RET insert_list(mylist,5) VAL [head={-5:0}, insert_list(mylist,5)=0, mylist={55:64}] [L558] CALL insert_list(mylist,1) VAL [\old(head)={-5:0}, \old(k)=1, head={-5:0}, l={55:64}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)={-5:0}, \old(k)=1, head={-5:0}, k=1, l={55:64}, l={-3:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(head)={-5:0}, \old(k)=1, head={-5:0}, k=1, l={-3:0}, l={55:64}] [L550] head = l [L551] return 0; VAL [\old(head)={-5:0}, \old(k)=1, \result=0, head={-3:0}, k=1, l={55:64}, l={-3:0}] [L558] RET insert_list(mylist,1) VAL [head={-3:0}, insert_list(mylist,1)=0, mylist={55:64}] [L559] CALL insert_list(mylist,3) VAL [\old(head)={-3:0}, \old(k)=3, head={-3:0}, l={55:64}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)={-3:0}, \old(k)=3, head={-3:0}, k=3, l={-4:0}, l={55:64}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(head)={-3:0}, \old(k)=3, head={-3:0}, k=3, l={-4:0}, l={55:64}] [L550] head = l [L551] return 0; VAL [\old(head)={-3:0}, \old(k)=3, \result=0, head={-4:0}, k=3, l={-4:0}, l={55:64}] [L559] RET insert_list(mylist,3) VAL [head={-4:0}, insert_list(mylist,3)=0, mylist={55:64}] [L560] CALL, EXPR search_list(head,2) [L535] l = head VAL [\old(k)=2, head={-4:0}, k=2, l={-4:0}, l={-4:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-4:0}, k=2, l={-4:0}, l={-4:0}, l!=((void *)0) && l->key!=k=1, l->key=3] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-4:0}, k=2, l={-3:0}, l={-4:0}, l!=((void *)0) && l->key!=k=1, l->key=1] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-4:0}, k=2, l={-5:0}, l={-4:0}, l!=((void *)0) && l->key!=k=1, l->key=5] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-4:0}, k=2, l={-1:0}, l={-4:0}, l!=((void *)0) && l->key!=k=0, l->key=2] [L536] COND FALSE !(l!=((void *)0) && l->key!=k) [L539] return l; VAL [\old(k)=2, \result={-1:0}, head={-4:0}, k=2, l={-4:0}, l={-1:0}] [L560] RET, EXPR search_list(head,2) [L560] temp = search_list(head,2) [L561] EXPR temp->key [L561] CALL __VERIFIER_assert(temp->key==1) [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, head={-4:0}] [L15] reach_error() VAL [\old(cond)=0, cond=0, head={-4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 426 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 426 mSDsluCounter, 1078 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 930 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1790 IncrementalHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 148 mSDtfsCounter, 1790 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 272 SyntacticMatches, 15 SemanticMatches, 193 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=7, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 36 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 494 ConstructedInterpolants, 10 QuantifiedInterpolants, 4947 SizeOfPredicates, 50 NumberOfNonLiveVariables, 1950 ConjunctsInSsa, 259 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 280/432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-13 23:23:39,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE