./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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-ext3-properties/dll_nullified-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 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 15:01:08,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 15:01:08,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 15:01:08,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 15:01:08,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 15:01:08,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 15:01:08,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 15:01:08,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 15:01:08,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 15:01:08,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 15:01:08,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 15:01:08,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 15:01:08,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 15:01:08,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 15:01:08,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 15:01:08,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 15:01:08,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 15:01:08,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 15:01:08,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 15:01:08,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 15:01:08,656 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 15:01:08,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 15:01:08,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 15:01:08,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 15:01:08,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 15:01:08,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 15:01:08,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 15:01:08,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 15:01:08,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 15:01:08,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 15:01:08,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 15:01:08,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 15:01:08,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 15:01:08,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 15:01:08,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 15:01:08,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 15:01:08,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 15:01:08,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 15:01:08,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 15:01:08,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 15:01:08,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 15:01:08,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 15:01:08,678 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 15:01:08,712 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 15:01:08,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 15:01:08,716 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 15:01:08,716 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 15:01:08,717 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 15:01:08,717 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 15:01:08,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 15:01:08,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 15:01:08,718 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 15:01:08,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 15:01:08,719 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 15:01:08,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 15:01:08,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 15:01:08,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 15:01:08,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 15:01:08,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 15:01:08,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 15:01:08,720 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 15:01:08,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 15:01:08,721 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 15:01:08,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 15:01:08,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 15:01:08,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 15:01:08,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 15:01:08,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 15:01:08,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 15:01:08,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 15:01:08,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 15:01:08,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 15:01:08,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 15:01:08,730 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 15:01:08,730 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 15:01:08,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 15:01:08,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 [2022-07-22 15:01:08,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 15:01:08,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 15:01:08,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 15:01:08,993 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 15:01:08,994 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 15:01:08,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2022-07-22 15:01:09,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f1f82241/93f65d6d17e242aa8883b2eb52bc5097/FLAGfb693ae64 [2022-07-22 15:01:09,479 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 15:01:09,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2022-07-22 15:01:09,503 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f1f82241/93f65d6d17e242aa8883b2eb52bc5097/FLAGfb693ae64 [2022-07-22 15:01:09,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f1f82241/93f65d6d17e242aa8883b2eb52bc5097 [2022-07-22 15:01:09,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 15:01:09,827 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 15:01:09,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 15:01:09,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 15:01:09,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 15:01:09,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:01:09" (1/1) ... [2022-07-22 15:01:09,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@724994ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:09, skipping insertion in model container [2022-07-22 15:01:09,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:01:09" (1/1) ... [2022-07-22 15:01:09,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 15:01:09,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 15:01:10,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i[24046,24059] [2022-07-22 15:01:10,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 15:01:10,118 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 15:01:10,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i[24046,24059] [2022-07-22 15:01:10,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 15:01:10,179 INFO L208 MainTranslator]: Completed translation [2022-07-22 15:01:10,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:10 WrapperNode [2022-07-22 15:01:10,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 15:01:10,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 15:01:10,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 15:01:10,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 15:01:10,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:10" (1/1) ... [2022-07-22 15:01:10,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:10" (1/1) ... [2022-07-22 15:01:10,215 INFO L137 Inliner]: procedures = 123, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2022-07-22 15:01:10,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 15:01:10,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 15:01:10,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 15:01:10,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 15:01:10,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:10" (1/1) ... [2022-07-22 15:01:10,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:10" (1/1) ... [2022-07-22 15:01:10,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:10" (1/1) ... [2022-07-22 15:01:10,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:10" (1/1) ... [2022-07-22 15:01:10,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:10" (1/1) ... [2022-07-22 15:01:10,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:10" (1/1) ... [2022-07-22 15:01:10,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:10" (1/1) ... [2022-07-22 15:01:10,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 15:01:10,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 15:01:10,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 15:01:10,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 15:01:10,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:10" (1/1) ... [2022-07-22 15:01:10,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 15:01:10,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:10,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 15:01:10,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 15:01:10,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 15:01:10,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 15:01:10,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 15:01:10,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 15:01:10,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 15:01:10,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 15:01:10,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 15:01:10,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 15:01:10,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 15:01:10,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 15:01:10,396 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 15:01:10,398 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 15:01:10,595 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 15:01:10,600 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 15:01:10,600 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 15:01:10,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:01:10 BoogieIcfgContainer [2022-07-22 15:01:10,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 15:01:10,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 15:01:10,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 15:01:10,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 15:01:10,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 03:01:09" (1/3) ... [2022-07-22 15:01:10,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a34f181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 03:01:10, skipping insertion in model container [2022-07-22 15:01:10,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:10" (2/3) ... [2022-07-22 15:01:10,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a34f181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 03:01:10, skipping insertion in model container [2022-07-22 15:01:10,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:01:10" (3/3) ... [2022-07-22 15:01:10,613 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2022-07-22 15:01:10,626 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 15:01:10,627 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 15:01:10,673 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 15:01:10,678 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5755db34, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@746ccb7d [2022-07-22 15:01:10,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 15:01:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 15:01:10,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:10,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:10,691 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:10,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:10,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1957812527, now seen corresponding path program 1 times [2022-07-22 15:01:10,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:10,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791415587] [2022-07-22 15:01:10,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:10,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:10,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:10,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791415587] [2022-07-22 15:01:10,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791415587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:01:10,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:01:10,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 15:01:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108900277] [2022-07-22 15:01:10,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:01:10,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 15:01:10,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:10,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 15:01:10,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 15:01:10,863 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:10,878 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2022-07-22 15:01:10,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 15:01:10,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 15:01:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:10,885 INFO L225 Difference]: With dead ends: 48 [2022-07-22 15:01:10,886 INFO L226 Difference]: Without dead ends: 24 [2022-07-22 15:01:10,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 15:01:10,891 INFO L413 NwaCegarLoop]: 39 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, 39 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 [2022-07-22 15:01:10,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 15:01:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-22 15:01:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-22 15:01:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-07-22 15:01:10,915 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 12 [2022-07-22 15:01:10,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:10,916 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-07-22 15:01:10,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2022-07-22 15:01:10,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 15:01:10,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:10,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:10,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 15:01:10,919 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:10,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1580862863, now seen corresponding path program 1 times [2022-07-22 15:01:10,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:10,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775835553] [2022-07-22 15:01:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:10,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:10,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:10,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775835553] [2022-07-22 15:01:10,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775835553] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:01:10,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:01:10,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:01:10,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785399980] [2022-07-22 15:01:10,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:01:10,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:01:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:10,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:01:10,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:01:10,984 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:11,006 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2022-07-22 15:01:11,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:01:11,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 15:01:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:11,008 INFO L225 Difference]: With dead ends: 46 [2022-07-22 15:01:11,008 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 15:01:11,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:01:11,010 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:11,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 15:01:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 15:01:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-07-22 15:01:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2022-07-22 15:01:11,027 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 12 [2022-07-22 15:01:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:11,028 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-07-22 15:01:11,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-07-22 15:01:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 15:01:11,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:11,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:11,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 15:01:11,029 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:11,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2031015874, now seen corresponding path program 1 times [2022-07-22 15:01:11,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:11,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216670782] [2022-07-22 15:01:11,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:11,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:11,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:11,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216670782] [2022-07-22 15:01:11,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216670782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:01:11,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:01:11,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:01:11,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963805257] [2022-07-22 15:01:11,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:01:11,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:01:11,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:11,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:01:11,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:01:11,163 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:11,193 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-07-22 15:01:11,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:01:11,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-22 15:01:11,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:11,195 INFO L225 Difference]: With dead ends: 53 [2022-07-22 15:01:11,195 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 15:01:11,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:01:11,197 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:11,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 15:01:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 15:01:11,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-07-22 15:01:11,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-07-22 15:01:11,205 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 19 [2022-07-22 15:01:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:11,206 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-07-22 15:01:11,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-07-22 15:01:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 15:01:11,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:11,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:11,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 15:01:11,207 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:11,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:11,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1772850436, now seen corresponding path program 1 times [2022-07-22 15:01:11,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:11,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420188794] [2022-07-22 15:01:11,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:11,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:11,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:11,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420188794] [2022-07-22 15:01:11,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420188794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:01:11,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:01:11,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 15:01:11,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704418648] [2022-07-22 15:01:11,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:01:11,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 15:01:11,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:11,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 15:01:11,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 15:01:11,339 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:11,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:11,503 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2022-07-22 15:01:11,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 15:01:11,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-22 15:01:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:11,505 INFO L225 Difference]: With dead ends: 77 [2022-07-22 15:01:11,505 INFO L226 Difference]: Without dead ends: 64 [2022-07-22 15:01:11,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-22 15:01:11,506 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 128 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:11,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 120 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 15:01:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-22 15:01:11,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 37. [2022-07-22 15:01:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-07-22 15:01:11,513 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 19 [2022-07-22 15:01:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:11,513 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-07-22 15:01:11,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-07-22 15:01:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 15:01:11,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:11,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:11,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 15:01:11,515 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:11,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:11,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1771003394, now seen corresponding path program 1 times [2022-07-22 15:01:11,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:11,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205629228] [2022-07-22 15:01:11,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:11,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:11,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:11,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205629228] [2022-07-22 15:01:11,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205629228] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:01:11,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066719790] [2022-07-22 15:01:11,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:11,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:11,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:11,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 15:01:11,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 15:01:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:11,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 15:01:11,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:11,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:11,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066719790] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:11,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:01:11,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-22 15:01:11,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850778267] [2022-07-22 15:01:11,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:11,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 15:01:11,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:11,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 15:01:11,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-22 15:01:11,794 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:11,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:11,821 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2022-07-22 15:01:11,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 15:01:11,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-22 15:01:11,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:11,823 INFO L225 Difference]: With dead ends: 77 [2022-07-22 15:01:11,826 INFO L226 Difference]: Without dead ends: 57 [2022-07-22 15:01:11,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-22 15:01:11,828 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:11,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 88 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 15:01:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-22 15:01:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2022-07-22 15:01:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2022-07-22 15:01:11,841 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 19 [2022-07-22 15:01:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:11,841 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2022-07-22 15:01:11,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2022-07-22 15:01:11,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 15:01:11,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:11,844 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:11,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 15:01:12,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:12,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:12,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:12,064 INFO L85 PathProgramCache]: Analyzing trace with hash -338892847, now seen corresponding path program 1 times [2022-07-22 15:01:12,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:12,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136156551] [2022-07-22 15:01:12,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:12,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:12,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:12,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136156551] [2022-07-22 15:01:12,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136156551] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:01:12,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331698856] [2022-07-22 15:01:12,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:12,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:12,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:12,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 15:01:12,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 15:01:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:12,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 15:01:12,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:12,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:12,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331698856] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:12,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:01:12,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-07-22 15:01:12,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747337667] [2022-07-22 15:01:12,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:12,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 15:01:12,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:12,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 15:01:12,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 15:01:12,512 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:12,549 INFO L93 Difference]: Finished difference Result 82 states and 109 transitions. [2022-07-22 15:01:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 15:01:12,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-22 15:01:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:12,551 INFO L225 Difference]: With dead ends: 82 [2022-07-22 15:01:12,551 INFO L226 Difference]: Without dead ends: 62 [2022-07-22 15:01:12,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 15:01:12,557 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:12,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 93 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 15:01:12,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-22 15:01:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-07-22 15:01:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2022-07-22 15:01:12,575 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 40 [2022-07-22 15:01:12,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:12,575 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2022-07-22 15:01:12,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2022-07-22 15:01:12,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-22 15:01:12,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:12,578 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:12,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 15:01:12,802 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,SelfDestructingSolverStorable5 [2022-07-22 15:01:12,802 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:12,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:12,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2036506556, now seen corresponding path program 2 times [2022-07-22 15:01:12,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:12,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661961971] [2022-07-22 15:01:12,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:12,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 15:01:13,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:13,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661961971] [2022-07-22 15:01:13,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661961971] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:01:13,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513985622] [2022-07-22 15:01:13,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 15:01:13,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:13,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:13,032 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 15:01:13,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 15:01:13,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 15:01:13,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 15:01:13,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 15:01:13,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:13,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:13,295 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 15:01:13,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 15:01:13,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:13,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-07-22 15:01:13,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:13,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:13,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:13,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:13,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:13,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:13,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:13,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:13,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:13,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:13,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 50 [2022-07-22 15:01:13,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-07-22 15:01:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 15:01:13,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:13,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_716 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_716) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-22 15:01:13,546 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_716 (Array Int Int)) (v_ArrVal_714 Int) (v_ArrVal_712 Int) (v_ArrVal_711 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_714) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_712) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_711)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_716) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-22 15:01:13,645 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-22 15:01:13,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 59 [2022-07-22 15:01:13,652 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 15:01:13,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 26 [2022-07-22 15:01:13,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 15:01:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 3 not checked. [2022-07-22 15:01:13,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513985622] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:13,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:01:13,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 21 [2022-07-22 15:01:13,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252835490] [2022-07-22 15:01:13,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:13,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-22 15:01:13,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:13,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-22 15:01:13,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=295, Unknown=2, NotChecked=70, Total=420 [2022-07-22 15:01:13,719 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:14,259 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2022-07-22 15:01:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 15:01:14,260 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-22 15:01:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:14,261 INFO L225 Difference]: With dead ends: 93 [2022-07-22 15:01:14,261 INFO L226 Difference]: Without dead ends: 80 [2022-07-22 15:01:14,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=677, Unknown=2, NotChecked=114, Total=992 [2022-07-22 15:01:14,262 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 304 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:14,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 152 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 252 Invalid, 0 Unknown, 104 Unchecked, 0.3s Time] [2022-07-22 15:01:14,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-22 15:01:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 56. [2022-07-22 15:01:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2022-07-22 15:01:14,270 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 47 [2022-07-22 15:01:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:14,271 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2022-07-22 15:01:14,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:14,272 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2022-07-22 15:01:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-22 15:01:14,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:14,276 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:14,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 15:01:14,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:14,495 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:14,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2038353598, now seen corresponding path program 1 times [2022-07-22 15:01:14,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:14,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491577693] [2022-07-22 15:01:14,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:14,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 15:01:14,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:14,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491577693] [2022-07-22 15:01:14,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491577693] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:01:14,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305544778] [2022-07-22 15:01:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:14,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:14,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:14,758 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 15:01:14,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 15:01:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:14,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-22 15:01:14,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:14,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:14,960 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 15:01:14,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 15:01:14,983 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-22 15:01:14,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 16 treesize of output 17 [2022-07-22 15:01:15,039 INFO L356 Elim1Store]: treesize reduction 181, result has 13.4 percent of original size [2022-07-22 15:01:15,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 33 treesize of output 40 [2022-07-22 15:01:15,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-07-22 15:01:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 15:01:15,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:15,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1057 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1057) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2022-07-22 15:01:15,149 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 Int) (v_ArrVal_1053 Int) (v_ArrVal_1055 Int) (v_ArrVal_1057 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1053) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_1055) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1051)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1057) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2022-07-22 15:01:15,213 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-22 15:01:15,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 61 [2022-07-22 15:01:15,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 24 [2022-07-22 15:01:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 3 not checked. [2022-07-22 15:01:15,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305544778] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:15,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:01:15,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 23 [2022-07-22 15:01:15,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46808937] [2022-07-22 15:01:15,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:15,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-22 15:01:15,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:15,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-22 15:01:15,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=366, Unknown=2, NotChecked=78, Total=506 [2022-07-22 15:01:15,264 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:15,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:15,756 INFO L93 Difference]: Finished difference Result 94 states and 127 transitions. [2022-07-22 15:01:15,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 15:01:15,756 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-22 15:01:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:15,757 INFO L225 Difference]: With dead ends: 94 [2022-07-22 15:01:15,757 INFO L226 Difference]: Without dead ends: 81 [2022-07-22 15:01:15,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=866, Unknown=2, NotChecked=130, Total=1260 [2022-07-22 15:01:15,759 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 331 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:15,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 134 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 199 Invalid, 0 Unknown, 123 Unchecked, 0.2s Time] [2022-07-22 15:01:15,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-22 15:01:15,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 58. [2022-07-22 15:01:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2022-07-22 15:01:15,772 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 47 [2022-07-22 15:01:15,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:15,772 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2022-07-22 15:01:15,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:15,773 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2022-07-22 15:01:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-22 15:01:15,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:15,774 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:15,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 15:01:15,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:16,000 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:16,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:16,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2038355520, now seen corresponding path program 1 times [2022-07-22 15:01:16,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:16,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335844126] [2022-07-22 15:01:16,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:16,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 15:01:16,079 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 15:01:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 15:01:16,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 15:01:16,169 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 15:01:16,170 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 15:01:16,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 15:01:16,174 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:16,176 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 15:01:16,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 03:01:16 BoogieIcfgContainer [2022-07-22 15:01:16,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 15:01:16,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 15:01:16,233 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 15:01:16,233 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 15:01:16,233 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:01:10" (3/4) ... [2022-07-22 15:01:16,235 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 15:01:16,303 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 15:01:16,303 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 15:01:16,304 INFO L158 Benchmark]: Toolchain (without parser) took 6476.78ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 85.6MB in the beginning and 69.2MB in the end (delta: 16.4MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB. [2022-07-22 15:01:16,304 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 81.8MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 15:01:16,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.91ms. Allocated memory is still 109.1MB. Free memory was 85.6MB in the beginning and 69.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-22 15:01:16,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.82ms. Allocated memory is still 109.1MB. Free memory was 69.1MB in the beginning and 66.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 15:01:16,305 INFO L158 Benchmark]: Boogie Preprocessor took 23.05ms. Allocated memory is still 109.1MB. Free memory was 66.9MB in the beginning and 65.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 15:01:16,305 INFO L158 Benchmark]: RCFGBuilder took 362.18ms. Allocated memory is still 109.1MB. Free memory was 65.4MB in the beginning and 78.9MB in the end (delta: -13.5MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2022-07-22 15:01:16,306 INFO L158 Benchmark]: TraceAbstraction took 5624.34ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 78.5MB in the beginning and 73.4MB in the end (delta: 5.2MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2022-07-22 15:01:16,306 INFO L158 Benchmark]: Witness Printer took 74.89ms. Allocated memory is still 167.8MB. Free memory was 72.3MB in the beginning and 69.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 15:01:16,307 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 81.8MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.91ms. Allocated memory is still 109.1MB. Free memory was 85.6MB in the beginning and 69.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.82ms. Allocated memory is still 109.1MB. Free memory was 69.1MB in the beginning and 66.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.05ms. Allocated memory is still 109.1MB. Free memory was 66.9MB in the beginning and 65.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 362.18ms. Allocated memory is still 109.1MB. Free memory was 65.4MB in the beginning and 78.9MB in the end (delta: -13.5MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5624.34ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 78.5MB in the beginning and 73.4MB in the end (delta: 5.2MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. * Witness Printer took 74.89ms. Allocated memory is still 167.8MB. Free memory was 72.3MB in the beginning and 69.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.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: 616]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L599] const int len = 5; [L600] CALL, EXPR dll_create(len) [L579] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, new_head={-1:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L590] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-1:0}, len=4, new_head={-1:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, new_head={-2:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-2:0}, len=3, new_head={-2:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, new_head={-3:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-3:0}, len=2, new_head={-3:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, new_head={-4:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-4:0}, len=1, new_head={-4:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, new_head={-5:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L590] COND TRUE \read(head) [L591] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-5:0}, len=0, new_head={-5:0}] [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={-5:0}, len=0, new_head={-5:0}] [L596] return head; VAL [\old(len)=5, \result={-5:0}, head={-5:0}, len=0, new_head={-5:0}] [L600] RET, EXPR dll_create(len) [L600] DLL head = dll_create(len); [L601] head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L601] COND TRUE head->next [L602] EXPR head->data_0 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 [L602] EXPR head->data_1 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L602] EXPR head->data_2 [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] reach_error() VAL [head={-5:0}, len=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 852 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 852 mSDsluCounter, 740 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 227 IncrementalHoareTripleChecker+Unchecked, 522 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 608 IncrementalHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 218 mSDtfsCounter, 608 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 304 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=6, InterpolantAutomatonStates: 58, 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, 8 MinimizatonAttempts, 87 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 505 ConstructedInterpolants, 6 QuantifiedInterpolants, 1776 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1547 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 392/593 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! [2022-07-22 15:01:16,343 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