./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/heap-manipulation/sll_to_dll_rev-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 f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:56:50,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:56:50,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:56:50,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:56:50,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:56:50,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:56:50,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:56:50,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:56:50,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:56:50,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:56:50,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:56:50,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:56:50,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:56:50,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:56:50,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:56:50,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:56:50,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:56:50,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:56:50,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:56:50,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:56:50,734 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:56:50,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:56:50,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:56:50,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:56:50,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:56:50,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:56:50,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:56:50,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:56:50,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:56:50,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:56:50,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:56:50,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:56:50,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:56:50,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:56:50,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:56:50,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:56:50,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:56:50,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:56:50,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:56:50,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:56:50,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:56:50,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:56:50,752 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 14:56:50,767 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:56:50,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:56:50,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:56:50,768 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:56:50,768 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:56:50,769 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:56:50,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:56:50,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:56:50,770 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:56:50,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:56:50,770 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:56:50,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 14:56:50,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:56:50,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:56:50,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:56:50,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:56:50,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:56:50,772 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:56:50,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:56:50,772 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:56:50,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:56:50,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:56:50,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:56:50,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:56:50,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:56:50,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:56:50,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:56:50,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:56:50,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 14:56:50,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 14:56:50,775 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:56:50,775 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:56:50,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:56:50,775 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 -> f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f [2022-07-13 14:56:50,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:56:51,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:56:51,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:56:51,015 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:56:51,016 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:56:51,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2022-07-13 14:56:51,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57fe3c9da/dc016bfdb87347cc8c858358d9208ad1/FLAG5b24d6fd1 [2022-07-13 14:56:51,471 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:56:51,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2022-07-13 14:56:51,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57fe3c9da/dc016bfdb87347cc8c858358d9208ad1/FLAG5b24d6fd1 [2022-07-13 14:56:51,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57fe3c9da/dc016bfdb87347cc8c858358d9208ad1 [2022-07-13 14:56:51,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:56:51,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:56:51,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:56:51,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:56:51,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:56:51,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:56:51" (1/1) ... [2022-07-13 14:56:51,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45becb29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:51, skipping insertion in model container [2022-07-13 14:56:51,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:56:51" (1/1) ... [2022-07-13 14:56:51,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:56:51,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:56:51,735 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/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2022-07-13 14:56:51,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:56:51,772 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:56:51,820 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/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2022-07-13 14:56:51,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:56:51,857 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:56:51,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:51 WrapperNode [2022-07-13 14:56:51,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:56:51,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:56:51,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:56:51,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:56:51,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:51" (1/1) ... [2022-07-13 14:56:51,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:51" (1/1) ... [2022-07-13 14:56:51,913 INFO L137 Inliner]: procedures = 129, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 200 [2022-07-13 14:56:51,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:56:51,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:56:51,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:56:51,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:56:51,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:51" (1/1) ... [2022-07-13 14:56:51,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:51" (1/1) ... [2022-07-13 14:56:51,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:51" (1/1) ... [2022-07-13 14:56:51,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:51" (1/1) ... [2022-07-13 14:56:51,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:51" (1/1) ... [2022-07-13 14:56:51,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:51" (1/1) ... [2022-07-13 14:56:51,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:51" (1/1) ... [2022-07-13 14:56:51,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:56:51,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:56:51,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:56:51,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:56:51,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:51" (1/1) ... [2022-07-13 14:56:51,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:56:51,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:56:51,981 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-13 14:56:51,995 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-13 14:56:52,010 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-13 14:56:52,010 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-13 14:56:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 14:56:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:56:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:56:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 14:56:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 14:56:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2022-07-13 14:56:52,011 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2022-07-13 14:56:52,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:56:52,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 14:56:52,012 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2022-07-13 14:56:52,012 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2022-07-13 14:56:52,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 14:56:52,012 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2022-07-13 14:56:52,012 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2022-07-13 14:56:52,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:56:52,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:56:52,098 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:56:52,099 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:56:52,361 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:56:52,366 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:56:52,369 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2022-07-13 14:56:52,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:56:52 BoogieIcfgContainer [2022-07-13 14:56:52,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:56:52,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:56:52,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:56:52,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:56:52,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:56:51" (1/3) ... [2022-07-13 14:56:52,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735bf187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:56:52, skipping insertion in model container [2022-07-13 14:56:52,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:51" (2/3) ... [2022-07-13 14:56:52,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735bf187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:56:52, skipping insertion in model container [2022-07-13 14:56:52,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:56:52" (3/3) ... [2022-07-13 14:56:52,379 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2022-07-13 14:56:52,388 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:56:52,388 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:56:52,434 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:56:52,441 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@dce0a7c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@25205360 [2022-07-13 14:56:52,441 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:56:52,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 75 states have (on average 1.68) internal successors, (126), 83 states have internal predecessors, (126), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-13 14:56:52,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 14:56:52,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:52,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:52,455 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:52,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:52,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1660370747, now seen corresponding path program 1 times [2022-07-13 14:56:52,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:52,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55304045] [2022-07-13 14:56:52,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:52,569 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-13 14:56:52,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:52,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55304045] [2022-07-13 14:56:52,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55304045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:52,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:52,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 14:56:52,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137238356] [2022-07-13 14:56:52,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:52,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 14:56:52,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:52,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 14:56:52,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:56:52,595 INFO L87 Difference]: Start difference. First operand has 96 states, 75 states have (on average 1.68) internal successors, (126), 83 states have internal predecessors, (126), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:56:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:52,617 INFO L93 Difference]: Finished difference Result 188 states and 326 transitions. [2022-07-13 14:56:52,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 14:56:52,618 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 14:56:52,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:52,623 INFO L225 Difference]: With dead ends: 188 [2022-07-13 14:56:52,623 INFO L226 Difference]: Without dead ends: 88 [2022-07-13 14:56:52,626 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-13 14:56:52,628 INFO L413 NwaCegarLoop]: 115 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, 115 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-13 14:56:52,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:56:52,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-13 14:56:52,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-13 14:56:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 76 states have internal predecessors, (83), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-13 14:56:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2022-07-13 14:56:52,655 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 16 [2022-07-13 14:56:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:52,655 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2022-07-13 14:56:52,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:56:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2022-07-13 14:56:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 14:56:52,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:52,657 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:52,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 14:56:52,657 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:52,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash -871113262, now seen corresponding path program 1 times [2022-07-13 14:56:52,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:52,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864034145] [2022-07-13 14:56:52,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:52,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:53,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 14:56:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:53,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 14:56:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 14:56:53,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:53,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864034145] [2022-07-13 14:56:53,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864034145] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:56:53,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507736995] [2022-07-13 14:56:53,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:53,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:56:53,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:56:53,434 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-13 14:56:53,435 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-13 14:56:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:53,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-13 14:56:53,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:56:53,610 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 14 treesize of output 12 [2022-07-13 14:56:53,719 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-13 14:56:53,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-13 14:56:53,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 14:56:53,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 14:56:53,799 INFO L356 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2022-07-13 14:56:53,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 34 [2022-07-13 14:56:53,801 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 22 treesize of output 16 [2022-07-13 14:56:53,817 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) (let ((.cse0 (not (= .cse1 0)))) (or (and .cse0 (not (= .cse1 |c_chain_node_#in~ppnode#1.base|))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) (and (= .cse2 (select v_DerPreprocessor_2 |c_chain_node_#in~ppnode#1.offset|)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_2) .cse2 v_DerPreprocessor_1) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_2) .cse2) v_DerPreprocessor_1)))) .cse0)))) is different from true [2022-07-13 14:56:53,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-13 14:56:54,074 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 24 treesize of output 19 [2022-07-13 14:56:54,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-13 14:56:54,209 WARN L855 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_245 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (and (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_245) |c_chain_node_#in~ppnode#1.base| v_ArrVal_246) |c_#memory_$Pointer$.base|) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-07-13 14:56:54,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:56:54,251 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 14:56:54,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2022-07-13 14:56:54,255 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 9 treesize of output 7 [2022-07-13 14:56:54,292 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 16 treesize of output 8 [2022-07-13 14:56:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-13 14:56:54,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:56:54,357 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_chain_node_~node~0#1.base_4| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (or (not (< |v_chain_node_~node~0#1.base_4| |c_#StackHeapBarrier|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_4| v_ArrVal_254) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|) 0)))) is different from false [2022-07-13 14:56:54,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507736995] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:56:54,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 14:56:54,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 27 [2022-07-13 14:56:54,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26851261] [2022-07-13 14:56:54,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 14:56:54,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 14:56:54,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:54,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 14:56:54,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=526, Unknown=7, NotChecked=144, Total=756 [2022-07-13 14:56:54,363 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 27 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 24 states have internal predecessors, (48), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:56:54,637 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) (let ((.cse0 (not (= .cse1 0)))) (and (or (and .cse0 (not (= .cse1 |c_chain_node_#in~ppnode#1.base|))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) (and (= .cse2 (select v_DerPreprocessor_2 |c_chain_node_#in~ppnode#1.offset|)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_2) .cse2 v_DerPreprocessor_1) |c_chain_node_#in~ppnode#1.base| v_DerPreprocessor_2) .cse2) v_DerPreprocessor_1)))) .cse0)) .cse0))) is different from true [2022-07-13 14:56:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:55,023 INFO L93 Difference]: Finished difference Result 163 states and 200 transitions. [2022-07-13 14:56:55,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 14:56:55,024 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 24 states have internal predecessors, (48), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2022-07-13 14:56:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:55,027 INFO L225 Difference]: With dead ends: 163 [2022-07-13 14:56:55,027 INFO L226 Difference]: Without dead ends: 160 [2022-07-13 14:56:55,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=991, Unknown=10, NotChecked=268, Total=1406 [2022-07-13 14:56:55,029 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 65 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 396 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:55,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1862 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 780 Invalid, 0 Unknown, 396 Unchecked, 0.4s Time] [2022-07-13 14:56:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-13 14:56:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 117. [2022-07-13 14:56:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 101 states have internal predecessors, (113), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 14:56:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2022-07-13 14:56:55,050 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 142 transitions. Word has length 33 [2022-07-13 14:56:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:55,051 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 142 transitions. [2022-07-13 14:56:55,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 24 states have internal predecessors, (48), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:56:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 142 transitions. [2022-07-13 14:56:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 14:56:55,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:55,052 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:55,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 14:56:55,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:56:55,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:55,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:55,256 INFO L85 PathProgramCache]: Analyzing trace with hash 371633244, now seen corresponding path program 1 times [2022-07-13 14:56:55,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:55,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360083119] [2022-07-13 14:56:55,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:55,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:55,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 14:56:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:55,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 14:56:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 14:56:55,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:55,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360083119] [2022-07-13 14:56:55,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360083119] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:56:55,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258465745] [2022-07-13 14:56:55,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:55,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:56:55,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:56:55,858 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-13 14:56:55,859 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-13 14:56:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:55,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-13 14:56:55,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:56:56,001 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 10 treesize of output 8 [2022-07-13 14:56:56,054 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-13 14:56:56,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-13 14:56:56,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 14:56:56,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-13 14:56:56,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-07-13 14:56:56,089 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 9 treesize of output 7 [2022-07-13 14:56:56,189 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 14:56:56,189 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 1 case distinctions, treesize of input 24 treesize of output 19 [2022-07-13 14:56:56,250 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-13 14:56:56,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2022-07-13 14:56:56,265 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 9 treesize of output 7 [2022-07-13 14:56:56,297 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 8 treesize of output 4 [2022-07-13 14:56:56,396 WARN L855 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_477 (Array Int Int)) (|chain_node_~node~0#1.offset| Int)) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (not (= |chain_node_~node~0#1.base| 0)) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_477 |chain_node_~node~0#1.offset| (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_477) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|))) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 14:56:56,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:56:56,514 INFO L356 Elim1Store]: treesize reduction 151, result has 32.9 percent of original size [2022-07-13 14:56:56,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 127 treesize of output 302 [2022-07-13 14:56:56,624 INFO L356 Elim1Store]: treesize reduction 55, result has 38.2 percent of original size [2022-07-13 14:56:56,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 218 [2022-07-13 14:56:56,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-07-13 14:56:57,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2022-07-13 14:57:02,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:57:02,614 INFO L356 Elim1Store]: treesize reduction 32, result has 48.4 percent of original size [2022-07-13 14:57:02,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1039 treesize of output 917 [2022-07-13 14:57:03,423 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 9 treesize of output 7 [2022-07-13 14:57:03,712 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 14:57:05,118 INFO L356 Elim1Store]: treesize reduction 73, result has 19.8 percent of original size [2022-07-13 14:57:05,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 525 treesize of output 366 [2022-07-13 14:57:05,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 282 [2022-07-13 14:57:06,151 INFO L356 Elim1Store]: treesize reduction 28, result has 22.2 percent of original size [2022-07-13 14:57:06,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 280 treesize of output 173 [2022-07-13 14:57:06,383 INFO L356 Elim1Store]: treesize reduction 28, result has 22.2 percent of original size [2022-07-13 14:57:06,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 101 [2022-07-13 14:57:17,601 WARN L233 SmtUtils]: Spent 9.57s on a formula simplification. DAG size of input: 103 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 14:57:17,767 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 14:57:17,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 185 treesize of output 192 [2022-07-13 14:57:17,818 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 14:57:17,818 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 70 treesize of output 54 [2022-07-13 14:57:18,056 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 12 treesize of output 8 [2022-07-13 14:57:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-13 14:57:18,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:57:18,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258465745] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:57:18,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 14:57:18,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2022-07-13 14:57:18,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351017992] [2022-07-13 14:57:18,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 14:57:18,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-13 14:57:18,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:57:18,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-13 14:57:18,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=771, Unknown=14, NotChecked=56, Total=930 [2022-07-13 14:57:18,281 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. Second operand has 29 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 25 states have internal predecessors, (50), 7 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:57:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:57:24,729 INFO L93 Difference]: Finished difference Result 130 states and 157 transitions. [2022-07-13 14:57:24,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 14:57:24,729 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 25 states have internal predecessors, (50), 7 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 35 [2022-07-13 14:57:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:57:24,730 INFO L225 Difference]: With dead ends: 130 [2022-07-13 14:57:24,730 INFO L226 Difference]: Without dead ends: 127 [2022-07-13 14:57:24,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=194, Invalid=1596, Unknown=20, NotChecked=82, Total=1892 [2022-07-13 14:57:24,732 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 111 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 366 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 14:57:24,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1087 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1237 Invalid, 0 Unknown, 366 Unchecked, 0.6s Time] [2022-07-13 14:57:24,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-13 14:57:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2022-07-13 14:57:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 101 states have internal predecessors, (112), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 14:57:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 141 transitions. [2022-07-13 14:57:24,741 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 141 transitions. Word has length 35 [2022-07-13 14:57:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:57:24,741 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 141 transitions. [2022-07-13 14:57:24,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 25 states have internal predecessors, (50), 7 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:57:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 141 transitions. [2022-07-13 14:57:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 14:57:24,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:57:24,743 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:57:24,759 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-13 14:57:24,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-13 14:57:24,947 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:57:24,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:57:24,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1899770360, now seen corresponding path program 1 times [2022-07-13 14:57:24,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:57:24,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817424664] [2022-07-13 14:57:24,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:57:24,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:57:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:57:24,989 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 14:57:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:57:25,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 14:57:25,043 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 14:57:25,044 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:57:25,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 14:57:25,048 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-07-13 14:57:25,050 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:57:25,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:57:25 BoogieIcfgContainer [2022-07-13 14:57:25,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:57:25,109 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:57:25,109 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:57:25,109 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:57:25,109 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:56:52" (3/4) ... [2022-07-13 14:57:25,111 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 14:57:25,144 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 14:57:25,145 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:57:25,145 INFO L158 Benchmark]: Toolchain (without parser) took 33652.45ms. Allocated memory was 92.3MB in the beginning and 262.1MB in the end (delta: 169.9MB). Free memory was 47.1MB in the beginning and 217.0MB in the end (delta: -169.9MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. [2022-07-13 14:57:25,145 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 92.3MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:57:25,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.95ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 46.9MB in the beginning and 92.6MB in the end (delta: -45.8MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2022-07-13 14:57:25,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.81ms. Allocated memory is still 119.5MB. Free memory was 92.6MB in the beginning and 89.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:57:25,146 INFO L158 Benchmark]: Boogie Preprocessor took 40.64ms. Allocated memory is still 119.5MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:57:25,146 INFO L158 Benchmark]: RCFGBuilder took 415.86ms. Allocated memory is still 119.5MB. Free memory was 87.7MB in the beginning and 66.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-13 14:57:25,146 INFO L158 Benchmark]: TraceAbstraction took 32736.00ms. Allocated memory was 119.5MB in the beginning and 262.1MB in the end (delta: 142.6MB). Free memory was 66.1MB in the beginning and 220.1MB in the end (delta: -154.0MB). Peak memory consumption was 136.4MB. Max. memory is 16.1GB. [2022-07-13 14:57:25,147 INFO L158 Benchmark]: Witness Printer took 35.88ms. Allocated memory is still 262.1MB. Free memory was 220.1MB in the beginning and 217.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:57:25,151 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.37ms. Allocated memory is still 92.3MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.95ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 46.9MB in the beginning and 92.6MB in the end (delta: -45.8MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.81ms. Allocated memory is still 119.5MB. Free memory was 92.6MB in the beginning and 89.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.64ms. Allocated memory is still 119.5MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 415.86ms. Allocated memory is still 119.5MB. Free memory was 87.7MB in the beginning and 66.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32736.00ms. Allocated memory was 119.5MB in the beginning and 262.1MB in the end (delta: 142.6MB). Free memory was 66.1MB in the beginning and 220.1MB in the end (delta: -154.0MB). Peak memory consumption was 136.4MB. Max. memory is 16.1GB. * Witness Printer took 35.88ms. Allocated memory is still 262.1MB. Free memory was 220.1MB in the beginning and 217.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: 565]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L639] const struct node *p1, *p2; [L640] CALL, EXPR create_sll(&p1, &p2) [L588] struct node *list = ((void *)0); VAL [list={6:0}, pp1={5:0}, pp1={5:0}, pp2={7:0}, pp2={7:0}] [L590] CALL chain_node(&list) [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) VAL [ptr={-1:0}] [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; VAL [\result={-1:0}, ptr={-1:0}] [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node VAL [node={-1:0}, ppnode={6:0}, ppnode={6:0}] [L590] RET chain_node(&list) VAL [list={6:0}, pp1={5:0}, pp1={5:0}, pp2={7:0}, pp2={7:0}] [L591] COND FALSE !(__VERIFIER_nondet_int()) [L592] EXPR \read(*list) [L592] *pp2 = list [L593] COND FALSE !(__VERIFIER_nondet_int()) [L595] EXPR \read(*list) [L595] *pp1 = list [L597] CALL chain_node(&list) [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) VAL [ptr={3:0}] [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; VAL [\result={3:0}, ptr={3:0}] [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node VAL [node={3:0}, ppnode={6:0}, ppnode={6:0}] [L597] RET chain_node(&list) VAL [list={6:0}, pp1={5:0}, pp1={5:0}, pp2={7:0}, pp2={7:0}] [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR \read(*list) [L599] return list; [L588] struct node *list = ((void *)0); [L599] return list; VAL [\result={3:0}, pp1={5:0}, pp1={5:0}, pp2={7:0}, pp2={7:0}] [L640] RET, EXPR create_sll(&p1, &p2) [L640] struct node *list = create_sll(&p1, &p2); [L642] EXPR \read(*p1) [L642] EXPR \read(*p2) VAL [\read(*p1)={-1:0}, \read(*p2)={-1:0}, list={3:0}, p1={5:0}, p2={7:0}] [L642] CALL check_seq_next(p1, p2) VAL [beg={-1:0}, end={-1:0}] [L626] COND FALSE !(!(beg)) VAL [beg={-1:0}, beg={-1:0}, end={-1:0}, end={-1:0}] [L627] COND FALSE !(!(end)) VAL [beg={-1:0}, beg={-1:0}, end={-1:0}, end={-1:0}] [L628] EXPR beg->next [L628] beg = beg->next [L628] COND TRUE end != beg VAL [beg={-1:0}, beg={0:0}, end={-1:0}, end={-1:0}] [L629] COND TRUE !(beg) VAL [beg={0:0}, beg={-1:0}, end={-1:0}, end={-1:0}] [L629] CALL fail() [L565] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 3064 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 762 IncrementalHoareTripleChecker+Unchecked, 2689 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2017 IncrementalHoareTripleChecker+Invalid, 2850 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 375 mSDtfsCounter, 2017 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=2, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 53 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 147 ConstructedInterpolants, 14 QuantifiedInterpolants, 4590 SizeOfPredicates, 48 NumberOfNonLiveVariables, 680 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 10/24 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-13 14:57:25,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE