/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/bubble_sort-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 20:32:10,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 20:32:10,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 20:32:10,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 20:32:10,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 20:32:10,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 20:32:10,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 20:32:10,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 20:32:10,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 20:32:10,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 20:32:10,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 20:32:10,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 20:32:10,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 20:32:10,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 20:32:10,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 20:32:10,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 20:32:10,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 20:32:10,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 20:32:10,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 20:32:10,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 20:32:10,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 20:32:10,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 20:32:10,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 20:32:10,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 20:32:10,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 20:32:10,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 20:32:10,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 20:32:10,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 20:32:10,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 20:32:10,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 20:32:10,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 20:32:10,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 20:32:10,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 20:32:10,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 20:32:10,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 20:32:10,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 20:32:10,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 20:32:10,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 20:32:10,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 20:32:10,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 20:32:10,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 20:32:10,906 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 20:32:10,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 20:32:10,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 20:32:10,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 20:32:10,915 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 20:32:10,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 20:32:10,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 20:32:10,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 20:32:10,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 20:32:10,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 20:32:10,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 20:32:10,916 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 20:32:10,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 20:32:10,917 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 20:32:10,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 20:32:10,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 20:32:10,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 20:32:10,917 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 20:32:10,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 20:32:10,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:32:10,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 20:32:10,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 20:32:10,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 20:32:10,918 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 20:32:10,918 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 20:32:11,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 20:32:11,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 20:32:11,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 20:32:11,117 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 20:32:11,119 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 20:32:11,119 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/bubble_sort-2.i [2022-01-31 20:32:11,180 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb70e30d/5e1bb46c9677442ba57b926015a475eb/FLAG9dfac8d5f [2022-01-31 20:32:11,550 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 20:32:11,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/bubble_sort-2.i [2022-01-31 20:32:11,563 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb70e30d/5e1bb46c9677442ba57b926015a475eb/FLAG9dfac8d5f [2022-01-31 20:32:11,572 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb70e30d/5e1bb46c9677442ba57b926015a475eb [2022-01-31 20:32:11,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 20:32:11,574 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 20:32:11,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 20:32:11,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 20:32:11,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 20:32:11,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:32:11" (1/1) ... [2022-01-31 20:32:11,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6951f68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:11, skipping insertion in model container [2022-01-31 20:32:11,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:32:11" (1/1) ... [2022-01-31 20:32:11,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 20:32:11,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 20:32:11,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/bubble_sort-2.i[1830,1843] [2022-01-31 20:32:11,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:32:11,827 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 20:32:11,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/bubble_sort-2.i[1830,1843] [2022-01-31 20:32:11,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:32:11,906 INFO L208 MainTranslator]: Completed translation [2022-01-31 20:32:11,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:11 WrapperNode [2022-01-31 20:32:11,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 20:32:11,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 20:32:11,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 20:32:11,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 20:32:11,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:11" (1/1) ... [2022-01-31 20:32:11,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:11" (1/1) ... [2022-01-31 20:32:11,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:11" (1/1) ... [2022-01-31 20:32:11,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:11" (1/1) ... [2022-01-31 20:32:11,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:11" (1/1) ... [2022-01-31 20:32:11,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:11" (1/1) ... [2022-01-31 20:32:11,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:11" (1/1) ... [2022-01-31 20:32:11,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 20:32:11,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 20:32:11,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 20:32:11,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 20:32:11,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:11" (1/1) ... [2022-01-31 20:32:11,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:32:12,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 20:32:12,015 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-01-31 20:32:12,021 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-01-31 20:32:12,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 20:32:12,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 20:32:12,040 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 20:32:12,040 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-01-31 20:32:12,040 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2022-01-31 20:32:12,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-01-31 20:32:12,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2022-01-31 20:32:12,040 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-01-31 20:32:12,040 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2022-01-31 20:32:12,041 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2022-01-31 20:32:12,041 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2022-01-31 20:32:12,041 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2022-01-31 20:32:12,041 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2022-01-31 20:32:12,041 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2022-01-31 20:32:12,041 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2022-01-31 20:32:12,042 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 20:32:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 20:32:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 20:32:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-01-31 20:32:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-01-31 20:32:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 20:32:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 20:32:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 20:32:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-01-31 20:32:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 20:32:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-01-31 20:32:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2022-01-31 20:32:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-31 20:32:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-01-31 20:32:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-31 20:32:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2022-01-31 20:32:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-01-31 20:32:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2022-01-31 20:32:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2022-01-31 20:32:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 20:32:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 20:32:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2022-01-31 20:32:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2022-01-31 20:32:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 20:32:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2022-01-31 20:32:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 20:32:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2022-01-31 20:32:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2022-01-31 20:32:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 20:32:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 20:32:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 20:32:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-31 20:32:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 20:32:12,202 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 20:32:12,204 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 20:32:12,348 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint failFINAL: assume true; [2022-01-31 20:32:12,508 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 20:32:12,515 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 20:32:12,515 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2022-01-31 20:32:12,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:32:12 BoogieIcfgContainer [2022-01-31 20:32:12,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 20:32:12,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 20:32:12,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 20:32:12,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 20:32:12,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:32:11" (1/3) ... [2022-01-31 20:32:12,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e12ecc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:32:12, skipping insertion in model container [2022-01-31 20:32:12,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:32:11" (2/3) ... [2022-01-31 20:32:12,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e12ecc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:32:12, skipping insertion in model container [2022-01-31 20:32:12,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:32:12" (3/3) ... [2022-01-31 20:32:12,523 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort-2.i [2022-01-31 20:32:12,527 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 20:32:12,527 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 20:32:12,553 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 20:32:12,558 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=JORDAN [2022-01-31 20:32:12,558 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 20:32:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 108 states have (on average 1.6574074074074074) internal successors, (179), 127 states have internal predecessors, (179), 33 states have call successors, (33), 14 states have call predecessors, (33), 13 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-31 20:32:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 20:32:12,574 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:32:12,574 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:32:12,575 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:32:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:32:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1791385099, now seen corresponding path program 1 times [2022-01-31 20:32:12,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:32:12,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1295213999] [2022-01-31 20:32:12,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:32:12,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:32:12,632 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:32:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:32:12,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:32:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:32:12,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 20:32:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:32:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:32:12,757 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:32:12,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1295213999] [2022-01-31 20:32:12,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1295213999] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:32:12,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:32:12,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 20:32:12,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618618873] [2022-01-31 20:32:12,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:32:12,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 20:32:12,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:32:12,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 20:32:12,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 20:32:12,790 INFO L87 Difference]: Start difference. First operand has 156 states, 108 states have (on average 1.6574074074074074) internal successors, (179), 127 states have internal predecessors, (179), 33 states have call successors, (33), 14 states have call predecessors, (33), 13 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 20:32:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:32:13,179 INFO L93 Difference]: Finished difference Result 331 states and 501 transitions. [2022-01-31 20:32:13,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 20:32:13,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-01-31 20:32:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:32:13,197 INFO L225 Difference]: With dead ends: 331 [2022-01-31 20:32:13,197 INFO L226 Difference]: Without dead ends: 164 [2022-01-31 20:32:13,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 20:32:13,207 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 255 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 20:32:13,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 142 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 20:32:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-01-31 20:32:13,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 143. [2022-01-31 20:32:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 117 states have internal predecessors, (121), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-01-31 20:32:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 166 transitions. [2022-01-31 20:32:13,266 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 166 transitions. Word has length 18 [2022-01-31 20:32:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:32:13,267 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 166 transitions. [2022-01-31 20:32:13,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 20:32:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2022-01-31 20:32:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 20:32:13,269 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:32:13,269 INFO L514 BasicCegarLoop]: 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] [2022-01-31 20:32:13,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 20:32:13,269 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:32:13,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:32:13,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2112592059, now seen corresponding path program 1 times [2022-01-31 20:32:13,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:32:13,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1796767377] [2022-01-31 20:32:13,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:32:13,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:32:13,277 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:32:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:32:13,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:32:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:32:13,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 20:32:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:32:13,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 20:32:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:32:13,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 20:32:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:32:13,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 20:32:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:32:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:32:13,647 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:32:13,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1796767377] [2022-01-31 20:32:13,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1796767377] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:32:13,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:32:13,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 20:32:13,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232039455] [2022-01-31 20:32:13,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:32:13,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 20:32:13,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:32:13,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 20:32:13,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-31 20:32:13,651 INFO L87 Difference]: Start difference. First operand 143 states and 166 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 20:32:14,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:32:14,331 INFO L93 Difference]: Finished difference Result 241 states and 289 transitions. [2022-01-31 20:32:14,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 20:32:14,332 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-01-31 20:32:14,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:32:14,335 INFO L225 Difference]: With dead ends: 241 [2022-01-31 20:32:14,336 INFO L226 Difference]: Without dead ends: 236 [2022-01-31 20:32:14,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-01-31 20:32:14,340 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 843 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 20:32:14,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [843 Valid, 134 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 20:32:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-01-31 20:32:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 199. [2022-01-31 20:32:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 172 states have internal predecessors, (193), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-01-31 20:32:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 238 transitions. [2022-01-31 20:32:14,371 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 238 transitions. Word has length 37 [2022-01-31 20:32:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:32:14,372 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 238 transitions. [2022-01-31 20:32:14,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 20:32:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 238 transitions. [2022-01-31 20:32:14,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 20:32:14,373 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:32:14,373 INFO L514 BasicCegarLoop]: 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, 1] [2022-01-31 20:32:14,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 20:32:14,373 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:32:14,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:32:14,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1799360915, now seen corresponding path program 1 times [2022-01-31 20:32:14,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:32:14,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1884972311] [2022-01-31 20:32:14,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:32:14,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:32:14,376 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:32:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 20:32:14,452 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-31 20:32:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 20:32:14,545 INFO L133 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2022-01-31 20:32:14,545 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-31 20:32:14,548 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 20:32:14,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 20:32:14,553 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-01-31 20:32:14,555 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 20:32:14,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:32:14 BoogieIcfgContainer [2022-01-31 20:32:14,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 20:32:14,578 INFO L158 Benchmark]: Toolchain (without parser) took 3003.83ms. Allocated memory was 255.9MB in the beginning and 335.5MB in the end (delta: 79.7MB). Free memory was 200.8MB in the beginning and 177.4MB in the end (delta: 23.4MB). Peak memory consumption was 104.5MB. Max. memory is 8.0GB. [2022-01-31 20:32:14,578 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory was 218.5MB in the beginning and 218.4MB in the end (delta: 88.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 20:32:14,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.31ms. Allocated memory was 255.9MB in the beginning and 335.5MB in the end (delta: 79.7MB). Free memory was 200.6MB in the beginning and 300.6MB in the end (delta: -100.0MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2022-01-31 20:32:14,579 INFO L158 Benchmark]: Boogie Preprocessor took 69.18ms. Allocated memory is still 335.5MB. Free memory was 300.6MB in the beginning and 296.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-31 20:32:14,579 INFO L158 Benchmark]: RCFGBuilder took 539.47ms. Allocated memory is still 335.5MB. Free memory was 296.9MB in the beginning and 264.9MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-01-31 20:32:14,579 INFO L158 Benchmark]: TraceAbstraction took 2058.46ms. Allocated memory is still 335.5MB. Free memory was 264.4MB in the beginning and 177.4MB in the end (delta: 87.0MB). Peak memory consumption was 88.1MB. Max. memory is 8.0GB. [2022-01-31 20:32:14,580 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.11ms. Allocated memory is still 255.9MB. Free memory was 218.5MB in the beginning and 218.4MB in the end (delta: 88.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 331.31ms. Allocated memory was 255.9MB in the beginning and 335.5MB in the end (delta: 79.7MB). Free memory was 200.6MB in the beginning and 300.6MB in the end (delta: -100.0MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 69.18ms. Allocated memory is still 335.5MB. Free memory was 300.6MB in the beginning and 296.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 539.47ms. Allocated memory is still 335.5MB. Free memory was 296.9MB in the beginning and 264.9MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2058.46ms. Allocated memory is still 335.5MB. Free memory was 264.4MB in the beginning and 177.4MB in the end (delta: 87.0MB). Peak memory consumption was 88.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 46]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L52] struct list_head gl_list = {& gl_list, & gl_list}; [L835] struct list_head const *__cil_tmp1 ; [L836] struct list_head const *__cil_tmp2 ; [L839] CALL gl_read() [L676] int tmp ; [L677] int tmp___0 ; [L680] COND TRUE 1 [L683] tmp = __VERIFIER_nondet_int() [L684] CALL gl_insert(tmp) [L622] struct node *node ; [L623] void *tmp ; [L624] unsigned int __cil_tmp4 ; [L625] unsigned int __cil_tmp5 ; [L626] unsigned int __cil_tmp6 ; [L627] struct list_head *__cil_tmp7 ; [L628] unsigned int __cil_tmp8 ; [L629] unsigned int __cil_tmp9 ; [L630] unsigned int __cil_tmp10 ; [L631] unsigned int __cil_tmp11 ; [L632] unsigned int __cil_tmp12 ; [L633] unsigned int __cil_tmp13 ; [L634] unsigned int __cil_tmp14 ; [L635] unsigned int __cil_tmp15 ; [L638] __cil_tmp4 = (unsigned int )20UL [L639] tmp = malloc(__cil_tmp4) [L640] node = (struct node *)tmp [L642] COND FALSE !(! node) [L649] *((int *)node) = value [L650] __cil_tmp5 = (unsigned int )node [L651] __cil_tmp6 = __cil_tmp5 + 4 [L652] __cil_tmp7 = (struct list_head *)__cil_tmp6 [L653] CALL list_add(__cil_tmp7, & gl_list) [L595] struct list_head *__cil_tmp3 ; [L598] EXPR \read(*head) [L598] __cil_tmp3 = *((struct list_head **)head) [L599] CALL __list_add(new, head, __cil_tmp3) [L567] unsigned int __cil_tmp4 ; [L568] unsigned int __cil_tmp5 ; [L569] unsigned int __cil_tmp6 ; [L570] unsigned int __cil_tmp7 ; [L572] __cil_tmp4 = (unsigned int )next [L573] __cil_tmp5 = __cil_tmp4 + 4 [L574] *((struct list_head **)__cil_tmp5) = new [L575] *((struct list_head **)new) = next [L576] __cil_tmp6 = (unsigned int )new [L577] __cil_tmp7 = __cil_tmp6 + 4 [L578] *((struct list_head **)__cil_tmp7) = prev [L579] *((struct list_head **)prev) = new [L599] RET __list_add(new, head, __cil_tmp3) [L653] RET list_add(__cil_tmp7, & gl_list) [L656] COND TRUE 1 [L658] __cil_tmp8 = (unsigned int )node [L659] __cil_tmp9 = __cil_tmp8 + 12 [L660] __cil_tmp10 = (unsigned int )node [L661] __cil_tmp11 = __cil_tmp10 + 12 [L662] *((struct list_head **)__cil_tmp9) = (struct list_head *)__cil_tmp11 [L663] __cil_tmp12 = (unsigned int )node [L664] __cil_tmp13 = __cil_tmp12 + 12 [L665] __cil_tmp14 = (unsigned int )node [L666] __cil_tmp15 = __cil_tmp14 + 12 [L667] *((struct list_head **)__cil_tmp13) = (struct list_head *)__cil_tmp15 [L684] RET gl_insert(tmp) [L685] tmp___0 = __VERIFIER_nondet_int() [L687] COND FALSE !(\read(tmp___0)) [L839] RET gl_read() [L840] __cil_tmp1 = (struct list_head const *)(& gl_list) [L841] CALL inspect(__cil_tmp1) [L55] struct node const *node ; [L56] unsigned int __cil_tmp3 ; [L57] struct list_head *__cil_tmp4 ; [L58] unsigned int __cil_tmp5 ; [L59] int __cil_tmp6 ; [L60] unsigned int __cil_tmp7 ; [L61] unsigned int __cil_tmp8 ; [L62] unsigned int __cil_tmp9 ; [L63] struct list_head *__cil_tmp10 ; [L64] unsigned int __cil_tmp11 ; [L65] int __cil_tmp12 ; [L66] unsigned int __cil_tmp13 ; [L67] unsigned int __cil_tmp14 ; [L68] struct list_head *__cil_tmp15 ; [L69] unsigned int __cil_tmp16 ; [L70] struct list_head *__cil_tmp17 ; [L71] unsigned int __cil_tmp18 ; [L72] int __cil_tmp19 ; [L73] unsigned int __cil_tmp20 ; [L74] unsigned int __cil_tmp21 ; [L75] unsigned int __cil_tmp22 ; [L76] struct list_head *__cil_tmp23 ; [L77] unsigned int __cil_tmp24 ; [L78] int __cil_tmp25 ; [L79] struct node *__cil_tmp26 ; [L80] unsigned int __cil_tmp27 ; [L81] unsigned int __cil_tmp28 ; [L82] struct list_head *__cil_tmp29 ; [L83] unsigned long __cil_tmp30 ; [L84] char *__cil_tmp31 ; [L85] char *__cil_tmp32 ; [L86] struct node *__cil_tmp33 ; [L87] unsigned int __cil_tmp34 ; [L88] unsigned int __cil_tmp35 ; [L89] struct list_head const *__cil_tmp36 ; [L90] unsigned int __cil_tmp37 ; [L91] unsigned int __cil_tmp38 ; [L92] unsigned int __cil_tmp39 ; [L93] struct list_head *__cil_tmp40 ; [L94] unsigned int __cil_tmp41 ; [L95] int __cil_tmp42 ; [L96] unsigned int __cil_tmp43 ; [L97] unsigned int __cil_tmp44 ; [L98] struct list_head const *__cil_tmp45 ; [L99] unsigned int __cil_tmp46 ; [L100] unsigned int __cil_tmp47 ; [L101] unsigned int __cil_tmp48 ; [L102] unsigned int __cil_tmp49 ; [L103] struct list_head *__cil_tmp50 ; [L104] unsigned int __cil_tmp51 ; [L105] int __cil_tmp52 ; [L106] unsigned int __cil_tmp53 ; [L107] unsigned int __cil_tmp54 ; [L108] struct list_head const *__cil_tmp55 ; [L109] unsigned int __cil_tmp56 ; [L110] unsigned int __cil_tmp57 ; [L111] unsigned int __cil_tmp58 ; [L112] struct list_head *__cil_tmp59 ; [L113] unsigned int __cil_tmp60 ; [L114] int __cil_tmp61 ; [L115] unsigned int __cil_tmp62 ; [L116] unsigned int __cil_tmp63 ; [L117] struct list_head const *__cil_tmp64 ; [L118] unsigned int __cil_tmp65 ; [L119] unsigned int __cil_tmp66 ; [L120] unsigned int __cil_tmp67 ; [L121] unsigned int __cil_tmp68 ; [L122] struct list_head *__cil_tmp69 ; [L123] unsigned int __cil_tmp70 ; [L124] int __cil_tmp71 ; [L125] struct node const *__cil_tmp72 ; [L126] unsigned int __cil_tmp73 ; [L127] unsigned int __cil_tmp74 ; [L128] int __cil_tmp75 ; [L129] unsigned int __cil_tmp76 ; [L130] unsigned int __cil_tmp77 ; [L131] struct list_head const *__cil_tmp78 ; [L132] struct node const *__cil_tmp79 ; [L133] unsigned int __cil_tmp80 ; [L134] unsigned int __cil_tmp81 ; [L135] int __cil_tmp82 ; [L136] int const *__cil_tmp83 ; [L137] struct node const *__cil_tmp84 ; [L138] unsigned int __cil_tmp85 ; [L139] unsigned int __cil_tmp86 ; [L140] int __cil_tmp87 ; [L141] unsigned int __cil_tmp88 ; [L142] unsigned int __cil_tmp89 ; [L143] struct list_head *__cil_tmp90 ; [L144] unsigned int __cil_tmp91 ; [L145] unsigned int __cil_tmp92 ; [L146] struct list_head *__cil_tmp93 ; [L147] unsigned int __cil_tmp94 ; [L148] unsigned int __cil_tmp95 ; [L149] int __cil_tmp96 ; [L150] unsigned int __cil_tmp97 ; [L151] unsigned int __cil_tmp98 ; [L152] unsigned int __cil_tmp99 ; [L153] struct list_head *__cil_tmp100 ; [L154] struct list_head *__cil_tmp101 ; [L155] unsigned int __cil_tmp102 ; [L156] unsigned int __cil_tmp103 ; [L157] int __cil_tmp104 ; [L158] struct list_head *__cil_tmp105 ; [L159] unsigned int __cil_tmp106 ; [L160] unsigned int __cil_tmp107 ; [L161] unsigned int __cil_tmp108 ; [L162] struct list_head const *__cil_tmp109 ; [L163] unsigned int __cil_tmp110 ; [L164] struct list_head *__cil_tmp111 ; [L165] unsigned int __cil_tmp112 ; [L166] struct node *__cil_tmp113 ; [L167] unsigned int __cil_tmp114 ; [L168] unsigned int __cil_tmp115 ; [L169] struct list_head *__cil_tmp116 ; [L170] unsigned long __cil_tmp117 ; [L171] char *__cil_tmp118 ; [L172] char *__cil_tmp119 ; [L173] struct node *__cil_tmp120 ; [L174] unsigned int __cil_tmp121 ; [L175] int __cil_tmp122 ; [L179] COND TRUE 1 [L181] COND FALSE !(! head) [L192] COND TRUE 1 [L195] __cil_tmp3 = (unsigned int )head [L196] EXPR \read(*head) [L196] __cil_tmp4 = *((struct list_head * const *)head) [L197] __cil_tmp5 = (unsigned int )__cil_tmp4 [L198] __cil_tmp6 = __cil_tmp5 != __cil_tmp3 [L199] COND TRUE ! __cil_tmp6 [L201] CALL fail() [L46] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 160 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1112 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1098 mSDsluCounter, 276 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 359 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 711 IncrementalHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 359 mSolverCounterUnsat, 267 mSDtfsCounter, 711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 58 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-31 20:32:14,602 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...