./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-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/bubble_sort_linux-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 a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:56:39,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:56:39,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:56:39,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:56:39,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:56:39,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:56:39,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:56:39,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:56:39,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:56:39,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:56:39,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:56:39,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:56:39,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:56:39,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:56:39,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:56:39,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:56:39,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:56:39,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:56:39,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:56:39,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:56:39,631 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:56:39,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:56:39,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:56:39,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:56:39,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:56:39,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:56:39,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:56:39,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:56:39,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:56:39,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:56:39,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:56:39,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:56:39,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:56:39,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:56:39,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:56:39,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:56:39,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:56:39,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:56:39,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:56:39,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:56:39,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:56:39,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:56:39,652 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:39,676 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:56:39,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:56:39,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:56:39,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:56:39,677 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:56:39,677 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:56:39,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:56:39,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:56:39,678 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:56:39,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:56:39,679 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:56:39,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 14:56:39,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:56:39,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:56:39,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:56:39,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:56:39,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:56:39,680 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:56:39,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:56:39,680 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:56:39,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:56:39,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:56:39,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:56:39,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:56:39,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:56:39,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:56:39,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:56:39,681 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:56:39,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 14:56:39,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 14:56:39,682 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:56:39,682 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:56:39,682 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:56:39,682 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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2022-07-13 14:56:39,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:56:39,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:56:39,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:56:39,895 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:56:39,896 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:56:39,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2022-07-13 14:56:39,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240dff474/4159d982dbb241aab9a248745e8b3e73/FLAG3a7e14d9a [2022-07-13 14:56:40,367 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:56:40,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2022-07-13 14:56:40,389 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240dff474/4159d982dbb241aab9a248745e8b3e73/FLAG3a7e14d9a [2022-07-13 14:56:40,743 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240dff474/4159d982dbb241aab9a248745e8b3e73 [2022-07-13 14:56:40,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:56:40,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:56:40,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:56:40,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:56:40,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:56:40,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:56:40" (1/1) ... [2022-07-13 14:56:40,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37297c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:40, skipping insertion in model container [2022-07-13 14:56:40,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:56:40" (1/1) ... [2022-07-13 14:56:40,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:56:40,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:56:41,080 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/bubble_sort_linux-1.i[33822,33835] [2022-07-13 14:56:41,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:56:41,130 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:56:41,166 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/bubble_sort_linux-1.i[33822,33835] [2022-07-13 14:56:41,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:56:41,218 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:56:41,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:41 WrapperNode [2022-07-13 14:56:41,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:56:41,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:56:41,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:56:41,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:56:41,225 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:41" (1/1) ... [2022-07-13 14:56:41,249 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:41" (1/1) ... [2022-07-13 14:56:41,274 INFO L137 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2022-07-13 14:56:41,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:56:41,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:56:41,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:56:41,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:56:41,281 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:41" (1/1) ... [2022-07-13 14:56:41,282 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:41" (1/1) ... [2022-07-13 14:56:41,296 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:41" (1/1) ... [2022-07-13 14:56:41,300 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:41" (1/1) ... [2022-07-13 14:56:41,315 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:41" (1/1) ... [2022-07-13 14:56:41,320 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:41" (1/1) ... [2022-07-13 14:56:41,323 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:41" (1/1) ... [2022-07-13 14:56:41,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:56:41,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:56:41,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:56:41,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:56:41,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:41" (1/1) ... [2022-07-13 14:56:41,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:56:41,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:56:41,389 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:41,397 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:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 14:56:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2022-07-13 14:56:41,419 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2022-07-13 14:56:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:56:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 14:56:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2022-07-13 14:56:41,420 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2022-07-13 14:56:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 14:56:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-13 14:56:41,421 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-13 14:56:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 14:56:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 14:56:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:56:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 14:56:41,421 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-07-13 14:56:41,421 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-07-13 14:56:41,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 14:56:41,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:56:41,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:56:41,557 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:56:41,559 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:56:41,820 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:56:41,825 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:56:41,825 INFO L299 CfgBuilder]: Removed 41 assume(true) statements. [2022-07-13 14:56:41,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:56:41 BoogieIcfgContainer [2022-07-13 14:56:41,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:56:41,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:56:41,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:56:41,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:56:41,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:56:40" (1/3) ... [2022-07-13 14:56:41,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6100b030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:56:41, skipping insertion in model container [2022-07-13 14:56:41,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:41" (2/3) ... [2022-07-13 14:56:41,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6100b030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:56:41, skipping insertion in model container [2022-07-13 14:56:41,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:56:41" (3/3) ... [2022-07-13 14:56:41,836 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2022-07-13 14:56:41,845 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:56:41,847 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:56:41,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:56:41,901 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@77ce8c79, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@695c7e48 [2022-07-13 14:56:41,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:56:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-13 14:56:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 14:56:41,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:41,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:41,916 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:41,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:41,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1761516263, now seen corresponding path program 1 times [2022-07-13 14:56:41,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:41,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178415891] [2022-07-13 14:56:41,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:41,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:42,006 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:42,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:42,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178415891] [2022-07-13 14:56:42,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178415891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:42,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:42,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 14:56:42,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157815852] [2022-07-13 14:56:42,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:42,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 14:56:42,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:42,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 14:56:42,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:56:42,031 INFO L87 Difference]: Start difference. First operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:42,056 INFO L93 Difference]: Finished difference Result 230 states and 397 transitions. [2022-07-13 14:56:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 14:56:42,057 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 9 [2022-07-13 14:56:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:42,062 INFO L225 Difference]: With dead ends: 230 [2022-07-13 14:56:42,063 INFO L226 Difference]: Without dead ends: 107 [2022-07-13 14:56:42,066 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:42,068 INFO L413 NwaCegarLoop]: 136 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, 136 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:42,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 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:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-13 14:56:42,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-13 14:56:42,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 97 states have internal predecessors, (102), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 14:56:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2022-07-13 14:56:42,104 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 9 [2022-07-13 14:56:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:42,104 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2022-07-13 14:56:42,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2022-07-13 14:56:42,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 14:56:42,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:42,107 INFO L195 NwaCegarLoop]: trace histogram [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:42,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 14:56:42,107 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:42,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:42,108 INFO L85 PathProgramCache]: Analyzing trace with hash 849043181, now seen corresponding path program 1 times [2022-07-13 14:56:42,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:42,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711011383] [2022-07-13 14:56:42,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:42,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:42,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 14:56:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:42,304 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:42,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:42,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711011383] [2022-07-13 14:56:42,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711011383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:42,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:42,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 14:56:42,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446881169] [2022-07-13 14:56:42,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:42,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:56:42,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:42,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:56:42,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:56:42,308 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:42,495 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2022-07-13 14:56:42,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 14:56:42,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-13 14:56:42,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:42,496 INFO L225 Difference]: With dead ends: 109 [2022-07-13 14:56:42,496 INFO L226 Difference]: Without dead ends: 106 [2022-07-13 14:56:42,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 14:56:42,498 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 238 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:42,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 196 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 14:56:42,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-13 14:56:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-13 14:56:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 96 states have internal predecessors, (101), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 14:56:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2022-07-13 14:56:42,506 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 21 [2022-07-13 14:56:42,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:42,507 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2022-07-13 14:56:42,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2022-07-13 14:56:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 14:56:42,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:42,508 INFO L195 NwaCegarLoop]: trace histogram [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:42,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 14:56:42,508 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:42,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:42,509 INFO L85 PathProgramCache]: Analyzing trace with hash 502050183, now seen corresponding path program 1 times [2022-07-13 14:56:42,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:42,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820135640] [2022-07-13 14:56:42,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:42,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:42,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 14:56:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:42,682 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:42,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:42,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820135640] [2022-07-13 14:56:42,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820135640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:42,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:42,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 14:56:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004850268] [2022-07-13 14:56:42,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:42,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 14:56:42,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:42,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 14:56:42,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 14:56:42,685 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:43,307 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2022-07-13 14:56:43,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 14:56:43,308 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-07-13 14:56:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:43,311 INFO L225 Difference]: With dead ends: 198 [2022-07-13 14:56:43,312 INFO L226 Difference]: Without dead ends: 192 [2022-07-13 14:56:43,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-07-13 14:56:43,315 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 518 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:43,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 221 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 14:56:43,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-13 14:56:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2022-07-13 14:56:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 144 states have (on average 1.2430555555555556) internal successors, (179), 158 states have internal predecessors, (179), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 14:56:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2022-07-13 14:56:43,333 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 24 [2022-07-13 14:56:43,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:43,334 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2022-07-13 14:56:43,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2022-07-13 14:56:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 14:56:43,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:43,335 INFO L195 NwaCegarLoop]: trace histogram [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:56:43,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 14:56:43,336 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:43,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1234303898, now seen corresponding path program 1 times [2022-07-13 14:56:43,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:43,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192743602] [2022-07-13 14:56:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:43,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:43,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 14:56:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:43,599 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:43,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:43,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192743602] [2022-07-13 14:56:43,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192743602] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:43,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:43,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 14:56:43,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565193673] [2022-07-13 14:56:43,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:43,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 14:56:43,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:43,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 14:56:43,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 14:56:43,602 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:44,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:44,203 INFO L93 Difference]: Finished difference Result 274 states and 329 transitions. [2022-07-13 14:56:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 14:56:44,204 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-13 14:56:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:44,205 INFO L225 Difference]: With dead ends: 274 [2022-07-13 14:56:44,205 INFO L226 Difference]: Without dead ends: 271 [2022-07-13 14:56:44,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-13 14:56:44,209 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 286 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:44,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 312 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 14:56:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-13 14:56:44,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 253. [2022-07-13 14:56:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.238532110091743) internal successors, (270), 233 states have internal predecessors, (270), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 14:56:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2022-07-13 14:56:44,253 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 27 [2022-07-13 14:56:44,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:44,254 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2022-07-13 14:56:44,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2022-07-13 14:56:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 14:56:44,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:44,255 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-13 14:56:44,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 14:56:44,256 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:44,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:44,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1680148119, now seen corresponding path program 1 times [2022-07-13 14:56:44,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:44,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440664155] [2022-07-13 14:56:44,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:44,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:44,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 14:56:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:44,500 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:44,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:44,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440664155] [2022-07-13 14:56:44,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440664155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:44,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:44,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 14:56:44,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328791910] [2022-07-13 14:56:44,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:44,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 14:56:44,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:44,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 14:56:44,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-07-13 14:56:44,503 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:45,190 INFO L93 Difference]: Finished difference Result 273 states and 327 transitions. [2022-07-13 14:56:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 14:56:45,190 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-07-13 14:56:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:45,195 INFO L225 Difference]: With dead ends: 273 [2022-07-13 14:56:45,195 INFO L226 Difference]: Without dead ends: 270 [2022-07-13 14:56:45,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-07-13 14:56:45,196 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 331 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:45,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 300 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 14:56:45,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-13 14:56:45,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2022-07-13 14:56:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2339449541284404) internal successors, (269), 233 states have internal predecessors, (269), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 14:56:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 308 transitions. [2022-07-13 14:56:45,227 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 308 transitions. Word has length 30 [2022-07-13 14:56:45,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:45,228 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 308 transitions. [2022-07-13 14:56:45,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 308 transitions. [2022-07-13 14:56:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 14:56:45,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:45,229 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-07-13 14:56:45,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 14:56:45,229 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:45,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:45,230 INFO L85 PathProgramCache]: Analyzing trace with hash -493122043, now seen corresponding path program 1 times [2022-07-13 14:56:45,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:45,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861676903] [2022-07-13 14:56:45,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:45,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:45,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 14:56:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:45,624 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:45,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:45,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861676903] [2022-07-13 14:56:45,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861676903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:45,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:45,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 14:56:45,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354734946] [2022-07-13 14:56:45,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:45,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 14:56:45,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:45,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 14:56:45,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-13 14:56:45,627 INFO L87 Difference]: Start difference. First operand 253 states and 308 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:46,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:46,496 INFO L93 Difference]: Finished difference Result 272 states and 325 transitions. [2022-07-13 14:56:46,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 14:56:46,497 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-07-13 14:56:46,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:46,498 INFO L225 Difference]: With dead ends: 272 [2022-07-13 14:56:46,498 INFO L226 Difference]: Without dead ends: 269 [2022-07-13 14:56:46,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-07-13 14:56:46,499 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 338 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:46,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 303 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 14:56:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-13 14:56:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 253. [2022-07-13 14:56:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2293577981651376) internal successors, (268), 233 states have internal predecessors, (268), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 14:56:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 307 transitions. [2022-07-13 14:56:46,510 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 307 transitions. Word has length 33 [2022-07-13 14:56:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:46,511 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 307 transitions. [2022-07-13 14:56:46,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 307 transitions. [2022-07-13 14:56:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 14:56:46,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:46,512 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:46,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 14:56:46,512 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:46,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2033122620, now seen corresponding path program 1 times [2022-07-13 14:56:46,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:46,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132583604] [2022-07-13 14:56:46,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:46,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:46,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 14:56:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:46,768 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:46,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:46,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132583604] [2022-07-13 14:56:46,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132583604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:46,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:46,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 14:56:46,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029690175] [2022-07-13 14:56:46,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:46,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 14:56:46,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:46,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 14:56:46,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-13 14:56:46,771 INFO L87 Difference]: Start difference. First operand 253 states and 307 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:47,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:47,610 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2022-07-13 14:56:47,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 14:56:47,611 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-13 14:56:47,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:47,612 INFO L225 Difference]: With dead ends: 271 [2022-07-13 14:56:47,612 INFO L226 Difference]: Without dead ends: 268 [2022-07-13 14:56:47,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-07-13 14:56:47,613 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 309 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:47,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 326 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 14:56:47,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-13 14:56:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 253. [2022-07-13 14:56:47,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.224770642201835) internal successors, (267), 233 states have internal predecessors, (267), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 14:56:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 306 transitions. [2022-07-13 14:56:47,633 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 306 transitions. Word has length 36 [2022-07-13 14:56:47,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:47,634 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 306 transitions. [2022-07-13 14:56:47,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 306 transitions. [2022-07-13 14:56:47,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 14:56:47,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:47,635 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:47,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 14:56:47,635 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:47,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:47,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1335339115, now seen corresponding path program 1 times [2022-07-13 14:56:47,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:47,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514973223] [2022-07-13 14:56:47,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:47,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:47,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 14:56:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:47,857 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:47,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:47,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514973223] [2022-07-13 14:56:47,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514973223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:47,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:47,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 14:56:47,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526050290] [2022-07-13 14:56:47,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:47,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 14:56:47,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:47,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 14:56:47,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-13 14:56:47,859 INFO L87 Difference]: Start difference. First operand 253 states and 306 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:48,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:48,558 INFO L93 Difference]: Finished difference Result 270 states and 321 transitions. [2022-07-13 14:56:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 14:56:48,558 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-07-13 14:56:48,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:48,559 INFO L225 Difference]: With dead ends: 270 [2022-07-13 14:56:48,559 INFO L226 Difference]: Without dead ends: 267 [2022-07-13 14:56:48,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2022-07-13 14:56:48,560 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 411 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:48,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 291 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 14:56:48,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-13 14:56:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2022-07-13 14:56:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2201834862385321) internal successors, (266), 233 states have internal predecessors, (266), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 14:56:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2022-07-13 14:56:48,573 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 39 [2022-07-13 14:56:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:48,573 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2022-07-13 14:56:48,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2022-07-13 14:56:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 14:56:48,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:48,574 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:48,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 14:56:48,575 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:48,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:48,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1154705564, now seen corresponding path program 1 times [2022-07-13 14:56:48,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:48,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439560956] [2022-07-13 14:56:48,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:48,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:48,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 14:56:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:48,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 14:56:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:48,877 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 14:56:48,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:48,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439560956] [2022-07-13 14:56:48,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439560956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:56:48,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732465212] [2022-07-13 14:56:48,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:48,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:56:48,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:56:48,880 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:48,907 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:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:49,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 125 conjunts are in the unsatisfiable core [2022-07-13 14:56:49,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:56:49,083 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 14:56:49,084 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 14:56:49,160 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 14:56:49,160 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 14 treesize of output 20 [2022-07-13 14:56:49,168 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-13 14:56:49,181 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 14:56:49,182 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 21 treesize of output 21 [2022-07-13 14:56:49,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 15 treesize of output 7 [2022-07-13 14:56:49,229 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 7 treesize of output 3 [2022-07-13 14:56:49,366 INFO L356 Elim1Store]: treesize reduction 77, result has 3.8 percent of original size [2022-07-13 14:56:49,367 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 14:56:49,388 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-13 14:56:49,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:56:49,586 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_2| input size 40 context size 40 output size 40 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 14:56:49,589 INFO L158 Benchmark]: Toolchain (without parser) took 8843.03ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 103.2MB in the beginning and 135.4MB in the end (delta: -32.2MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2022-07-13 14:56:49,589 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory was 53.2MB in the beginning and 53.1MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:56:49,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.80ms. Allocated memory is still 134.2MB. Free memory was 103.2MB in the beginning and 89.5MB in the end (delta: 13.6MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2022-07-13 14:56:49,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.00ms. Allocated memory is still 134.2MB. Free memory was 89.5MB in the beginning and 86.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:56:49,589 INFO L158 Benchmark]: Boogie Preprocessor took 57.31ms. Allocated memory is still 134.2MB. Free memory was 86.9MB in the beginning and 84.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:56:49,590 INFO L158 Benchmark]: RCFGBuilder took 493.62ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 84.3MB in the beginning and 129.7MB in the end (delta: -45.4MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2022-07-13 14:56:49,590 INFO L158 Benchmark]: TraceAbstraction took 7760.09ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 129.0MB in the beginning and 135.4MB in the end (delta: -6.4MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2022-07-13 14:56:49,591 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.17ms. Allocated memory is still 92.3MB. Free memory was 53.2MB in the beginning and 53.1MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.80ms. Allocated memory is still 134.2MB. Free memory was 103.2MB in the beginning and 89.5MB in the end (delta: 13.6MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.00ms. Allocated memory is still 134.2MB. Free memory was 89.5MB in the beginning and 86.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.31ms. Allocated memory is still 134.2MB. Free memory was 86.9MB in the beginning and 84.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 493.62ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 84.3MB in the beginning and 129.7MB in the end (delta: -45.4MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7760.09ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 129.0MB in the beginning and 135.4MB in the end (delta: -6.4MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_2| input size 40 context size 40 output size 40 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_2| input size 40 context size 40 output size 40: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 14:56:49,619 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bubble_sort_linux-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:56:51,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:56:51,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:56:51,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:56:51,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:56:51,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:56:51,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:56:51,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:56:51,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:56:51,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:56:51,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:56:51,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:56:51,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:56:51,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:56:51,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:56:51,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:56:51,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:56:51,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:56:51,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:56:51,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:56:51,340 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:56:51,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:56:51,342 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:56:51,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:56:51,344 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:56:51,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:56:51,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:56:51,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:56:51,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:56:51,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:56:51,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:56:51,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:56:51,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:56:51,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:56:51,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:56:51,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:56:51,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:56:51,355 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:56:51,355 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:56:51,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:56:51,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:56:51,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:56:51,363 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 14:56:51,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:56:51,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:56:51,395 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:56:51,395 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:56:51,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:56:51,396 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:56:51,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:56:51,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:56:51,397 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:56:51,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:56:51,398 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:56:51,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:56:51,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:56:51,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:56:51,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:56:51,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:56:51,399 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 14:56:51,399 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 14:56:51,399 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 14:56:51,399 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:56:51,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:56:51,400 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:56:51,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:56:51,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:56:51,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:56:51,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:56:51,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:56:51,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:56:51,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:56:51,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:56:51,401 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 14:56:51,401 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 14:56:51,402 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:56:51,402 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:56:51,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:56:51,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 14:56:51,402 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2022-07-13 14:56:51,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:56:51,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:56:51,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:56:51,704 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:56:51,705 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:56:51,706 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2022-07-13 14:56:51,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b04477fff/8392de1d6e2f4f3693a684997c1bbb71/FLAG3e21d5a30 [2022-07-13 14:56:52,141 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:56:52,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2022-07-13 14:56:52,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b04477fff/8392de1d6e2f4f3693a684997c1bbb71/FLAG3e21d5a30 [2022-07-13 14:56:52,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b04477fff/8392de1d6e2f4f3693a684997c1bbb71 [2022-07-13 14:56:52,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:56:52,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:56:52,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:56:52,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:56:52,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:56:52,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:56:52" (1/1) ... [2022-07-13 14:56:52,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51982056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:52, skipping insertion in model container [2022-07-13 14:56:52,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:56:52" (1/1) ... [2022-07-13 14:56:52,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:56:52,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:56:52,892 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/bubble_sort_linux-1.i[33822,33835] [2022-07-13 14:56:52,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:56:52,956 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 14:56:52,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:56:52,990 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/bubble_sort_linux-1.i[33822,33835] [2022-07-13 14:56:53,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:56:53,013 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:56:53,039 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/bubble_sort_linux-1.i[33822,33835] [2022-07-13 14:56:53,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:56:53,090 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:56:53,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:53 WrapperNode [2022-07-13 14:56:53,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:56:53,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:56:53,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:56:53,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:56:53,096 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:53" (1/1) ... [2022-07-13 14:56:53,117 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:53" (1/1) ... [2022-07-13 14:56:53,142 INFO L137 Inliner]: procedures = 235, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 113 [2022-07-13 14:56:53,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:56:53,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:56:53,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:56:53,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:56:53,149 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:53" (1/1) ... [2022-07-13 14:56:53,149 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:53" (1/1) ... [2022-07-13 14:56:53,152 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:53" (1/1) ... [2022-07-13 14:56:53,152 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:53" (1/1) ... [2022-07-13 14:56:53,160 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:53" (1/1) ... [2022-07-13 14:56:53,179 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:53" (1/1) ... [2022-07-13 14:56:53,181 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:53" (1/1) ... [2022-07-13 14:56:53,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:56:53,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:56:53,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:56:53,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:56:53,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:53" (1/1) ... [2022-07-13 14:56:53,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:56:53,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:56:53,233 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:53,236 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:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 14:56:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 14:56:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2022-07-13 14:56:53,258 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2022-07-13 14:56:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:56:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 14:56:53,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 14:56:53,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 14:56:53,259 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2022-07-13 14:56:53,259 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2022-07-13 14:56:53,259 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-13 14:56:53,259 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-13 14:56:53,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 14:56:53,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:56:53,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 14:56:53,260 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-07-13 14:56:53,260 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-07-13 14:56:53,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:56:53,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:56:53,347 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:56:53,349 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:56:53,743 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:56:53,750 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:56:53,750 INFO L299 CfgBuilder]: Removed 41 assume(true) statements. [2022-07-13 14:56:53,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:56:53 BoogieIcfgContainer [2022-07-13 14:56:53,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:56:53,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:56:53,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:56:53,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:56:53,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:56:52" (1/3) ... [2022-07-13 14:56:53,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f50080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:56:53, skipping insertion in model container [2022-07-13 14:56:53,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:53" (2/3) ... [2022-07-13 14:56:53,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f50080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:56:53, skipping insertion in model container [2022-07-13 14:56:53,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:56:53" (3/3) ... [2022-07-13 14:56:53,757 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2022-07-13 14:56:53,785 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:56:53,785 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:56:53,817 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:56:53,845 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@7bfc2a1d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5ab54c22 [2022-07-13 14:56:53,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:56:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 88 states have (on average 1.75) internal successors, (154), 107 states have internal predecessors, (154), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-13 14:56:53,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 14:56:53,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:53,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:53,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:53,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:53,871 INFO L85 PathProgramCache]: Analyzing trace with hash 844459879, now seen corresponding path program 1 times [2022-07-13 14:56:53,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:56:53,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379176814] [2022-07-13 14:56:53,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:53,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:56:53,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:56:53,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:56:53,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 14:56:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:53,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 14:56:53,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:56:53,986 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:53,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:56:53,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:56:53,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379176814] [2022-07-13 14:56:53,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379176814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:53,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:53,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 14:56:53,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874679152] [2022-07-13 14:56:53,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:53,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 14:56:53,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:56:54,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 14:56:54,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:56:54,009 INFO L87 Difference]: Start difference. First operand has 117 states, 88 states have (on average 1.75) internal successors, (154), 107 states have internal predecessors, (154), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:54,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:54,051 INFO L93 Difference]: Finished difference Result 228 states and 395 transitions. [2022-07-13 14:56:54,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 14:56:54,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 9 [2022-07-13 14:56:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:54,060 INFO L225 Difference]: With dead ends: 228 [2022-07-13 14:56:54,060 INFO L226 Difference]: Without dead ends: 106 [2022-07-13 14:56:54,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:56:54,071 INFO L413 NwaCegarLoop]: 135 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, 135 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:54,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 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:54,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-13 14:56:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-13 14:56:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 96 states have internal predecessors, (101), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 14:56:54,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2022-07-13 14:56:54,107 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 9 [2022-07-13 14:56:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:54,107 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2022-07-13 14:56:54,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:54,107 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2022-07-13 14:56:54,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 14:56:54,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:54,109 INFO L195 NwaCegarLoop]: trace histogram [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:54,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 14:56:54,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:56:54,317 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:54,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:54,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1622181416, now seen corresponding path program 1 times [2022-07-13 14:56:54,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:56:54,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378322253] [2022-07-13 14:56:54,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:54,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:56:54,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:56:54,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:56:54,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 14:56:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:54,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 14:56:54,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:56:54,516 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:54,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:56:54,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:56:54,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378322253] [2022-07-13 14:56:54,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378322253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:54,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:54,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:56:54,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145669560] [2022-07-13 14:56:54,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:54,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:56:54,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:56:54,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:56:54,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:56:54,522 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:54,647 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-07-13 14:56:54,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:56:54,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-13 14:56:54,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:54,650 INFO L225 Difference]: With dead ends: 108 [2022-07-13 14:56:54,650 INFO L226 Difference]: Without dead ends: 105 [2022-07-13 14:56:54,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:56:54,651 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 169 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:54,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 253 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 14:56:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-13 14:56:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-13 14:56:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 95 states have internal predecessors, (100), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 14:56:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2022-07-13 14:56:54,661 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 20 [2022-07-13 14:56:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:54,662 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2022-07-13 14:56:54,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2022-07-13 14:56:54,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 14:56:54,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:54,676 INFO L195 NwaCegarLoop]: trace histogram [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:54,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 14:56:54,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:56:54,886 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:54,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:54,887 INFO L85 PathProgramCache]: Analyzing trace with hash -845475890, now seen corresponding path program 1 times [2022-07-13 14:56:54,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:56:54,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593066640] [2022-07-13 14:56:54,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:54,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:56:54,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:56:54,889 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:56:54,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 14:56:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:55,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 14:56:55,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:56:55,114 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 14:56:55,116 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-13 14:56:55,328 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-13 14:56:55,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-07-13 14:56:55,347 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 8 treesize of output 7 [2022-07-13 14:56:55,365 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 8 treesize of output 7 [2022-07-13 14:56:55,380 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 8 treesize of output 7 [2022-07-13 14:56:55,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:56:55,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:56:55,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:56:55,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 81 treesize of output 74 [2022-07-13 14:56:55,546 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-13 14:56:55,564 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 14:56:55,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:56:55,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:56:55,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:56:55,698 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-13 14:56:55,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 97 [2022-07-13 14:56:55,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:56:55,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:56:55,829 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-13 14:56:55,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 92 [2022-07-13 14:56:55,842 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-13 14:56:55,874 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-13 14:56:56,420 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 14:56:56,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:56:56,530 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 0 case distinctions, treesize of input 25 treesize of output 23 [2022-07-13 14:56:56,533 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 16 treesize of output 12 [2022-07-13 14:56:56,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 14:56:56,598 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 16 treesize of output 11 [2022-07-13 14:56:56,613 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:56,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:56:56,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:56:56,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593066640] [2022-07-13 14:56:56,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593066640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:56,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:56,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 14:56:56,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279109201] [2022-07-13 14:56:56,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:56,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 14:56:56,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:56:56,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 14:56:56,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-13 14:56:56,615 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:57,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:57,185 INFO L93 Difference]: Finished difference Result 210 states and 248 transitions. [2022-07-13 14:56:57,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 14:56:57,187 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-07-13 14:56:57,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:57,188 INFO L225 Difference]: With dead ends: 210 [2022-07-13 14:56:57,188 INFO L226 Difference]: Without dead ends: 207 [2022-07-13 14:56:57,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-13 14:56:57,189 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 168 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:57,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 846 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 260 Invalid, 0 Unknown, 117 Unchecked, 0.5s Time] [2022-07-13 14:56:57,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-13 14:56:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2022-07-13 14:56:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 157 states have (on average 1.2356687898089171) internal successors, (194), 172 states have internal predecessors, (194), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-13 14:56:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 228 transitions. [2022-07-13 14:56:57,211 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 228 transitions. Word has length 23 [2022-07-13 14:56:57,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:57,212 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 228 transitions. [2022-07-13 14:56:57,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 228 transitions. [2022-07-13 14:56:57,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 14:56:57,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:57,213 INFO L195 NwaCegarLoop]: trace histogram [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:56:57,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 14:56:57,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:56:57,423 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:57,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:57,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2145302357, now seen corresponding path program 1 times [2022-07-13 14:56:57,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:56:57,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766529806] [2022-07-13 14:56:57,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:57,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:56:57,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:56:57,428 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:56:57,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 14:56:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:57,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-13 14:56:57,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:56:57,629 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 14:56:57,629 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-13 14:56:57,674 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 14 treesize of output 16 [2022-07-13 14:56:57,683 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 14 treesize of output 16 [2022-07-13 14:56:57,692 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 7 treesize of output 3 [2022-07-13 14:56:57,696 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 7 treesize of output 3 [2022-07-13 14:56:57,983 INFO L356 Elim1Store]: treesize reduction 77, result has 3.8 percent of original size [2022-07-13 14:56:57,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:56:57,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766529806] [2022-07-13 14:56:57,985 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 14:56:58,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 14:56:58,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:56:58,186 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_2| input size 56 context size 56 output size 56 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 14:56:58,188 INFO L158 Benchmark]: Toolchain (without parser) took 5683.24ms. Allocated memory was 73.4MB in the beginning and 130.0MB in the end (delta: 56.6MB). Free memory was 54.0MB in the beginning and 76.2MB in the end (delta: -22.2MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2022-07-13 14:56:58,188 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 73.4MB. Free memory is still 54.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:56:58,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.66ms. Allocated memory is still 73.4MB. Free memory was 53.9MB in the beginning and 32.7MB in the end (delta: 21.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-13 14:56:58,188 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.14ms. Allocated memory is still 73.4MB. Free memory was 32.7MB in the beginning and 55.2MB in the end (delta: -22.5MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2022-07-13 14:56:58,188 INFO L158 Benchmark]: Boogie Preprocessor took 40.96ms. Allocated memory is still 73.4MB. Free memory was 55.2MB in the beginning and 52.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:56:58,189 INFO L158 Benchmark]: RCFGBuilder took 567.34ms. Allocated memory is still 73.4MB. Free memory was 52.3MB in the beginning and 30.0MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-13 14:56:58,189 INFO L158 Benchmark]: TraceAbstraction took 4434.32ms. Allocated memory was 73.4MB in the beginning and 130.0MB in the end (delta: 56.6MB). Free memory was 29.2MB in the beginning and 76.2MB in the end (delta: -46.9MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2022-07-13 14:56:58,190 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.16ms. Allocated memory is still 73.4MB. Free memory is still 54.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.66ms. Allocated memory is still 73.4MB. Free memory was 53.9MB in the beginning and 32.7MB in the end (delta: 21.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.14ms. Allocated memory is still 73.4MB. Free memory was 32.7MB in the beginning and 55.2MB in the end (delta: -22.5MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.96ms. Allocated memory is still 73.4MB. Free memory was 55.2MB in the beginning and 52.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 567.34ms. Allocated memory is still 73.4MB. Free memory was 52.3MB in the beginning and 30.0MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4434.32ms. Allocated memory was 73.4MB in the beginning and 130.0MB in the end (delta: 56.6MB). Free memory was 29.2MB in the beginning and 76.2MB in the end (delta: -46.9MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_2| input size 56 context size 56 output size 56 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_2| input size 56 context size 56 output size 56: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 14:56:58,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_2| input size 56 context size 56 output size 56