./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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-2.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 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:27:30,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:27:30,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:27:30,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:27:30,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:27:30,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:27:30,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:27:30,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:27:30,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:27:30,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:27:30,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:27:30,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:27:30,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:27:30,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:27:30,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:27:30,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:27:30,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:27:30,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:27:30,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:27:30,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:27:30,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:27:30,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:27:30,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:27:30,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:27:30,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:27:30,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:27:30,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:27:30,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:27:30,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:27:30,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:27:30,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:27:30,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:27:30,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:27:30,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:27:30,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:27:30,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:27:30,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:27:30,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:27:30,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:27:30,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:27:30,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:27:30,924 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:27:30,947 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:27:30,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:27:30,949 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:27:30,949 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:27:30,950 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:27:30,950 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:27:30,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:27:30,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:27:30,951 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:27:30,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:27:30,952 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:27:30,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:27:30,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:27:30,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:27:30,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:27:30,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:27:30,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:27:30,953 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:27:30,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:27:30,953 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:27:30,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:27:30,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:27:30,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:27:30,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:27:30,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:27:30,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:27:30,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:27:30,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:27:30,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:27:30,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:27:30,954 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:27:30,955 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:27:30,955 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:27:30,955 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:27:30,955 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:27:30,955 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2023-02-15 10:27:31,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:27:31,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:27:31,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:27:31,166 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:27:31,166 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:27:31,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2023-02-15 10:27:32,224 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:27:32,428 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:27:32,431 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2023-02-15 10:27:32,439 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccc14d727/3e3d5562031d41c0a2157976afaf0cff/FLAGfbbb8509a [2023-02-15 10:27:32,452 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccc14d727/3e3d5562031d41c0a2157976afaf0cff [2023-02-15 10:27:32,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:27:32,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:27:32,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:27:32,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:27:32,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:27:32,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:27:32" (1/1) ... [2023-02-15 10:27:32,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b05495e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:32, skipping insertion in model container [2023-02-15 10:27:32,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:27:32" (1/1) ... [2023-02-15 10:27:32,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:27:32,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:27:32,752 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-02-15 10:27:32,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:27:32,798 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:27:32,822 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-02-15 10:27:32,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:27:32,880 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:27:32,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:32 WrapperNode [2023-02-15 10:27:32,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:27:32,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:27:32,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:27:32,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:27:32,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:32" (1/1) ... [2023-02-15 10:27:32,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:32" (1/1) ... [2023-02-15 10:27:32,920 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2023-02-15 10:27:32,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:27:32,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:27:32,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:27:32,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:27:32,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:32" (1/1) ... [2023-02-15 10:27:32,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:32" (1/1) ... [2023-02-15 10:27:32,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:32" (1/1) ... [2023-02-15 10:27:32,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:32" (1/1) ... [2023-02-15 10:27:32,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:32" (1/1) ... [2023-02-15 10:27:32,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:32" (1/1) ... [2023-02-15 10:27:32,962 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:32" (1/1) ... [2023-02-15 10:27:32,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:32" (1/1) ... [2023-02-15 10:27:32,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:27:32,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:27:32,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:27:32,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:27:32,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:32" (1/1) ... [2023-02-15 10:27:32,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:27:32,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:27:32,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:27:32,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:27:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 10:27:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-02-15 10:27:33,013 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-02-15 10:27:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:27:33,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 10:27:33,017 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-02-15 10:27:33,017 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-02-15 10:27:33,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:27:33,017 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-15 10:27:33,017 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-15 10:27:33,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:27:33,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:27:33,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:27:33,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 10:27:33,018 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-02-15 10:27:33,018 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-02-15 10:27:33,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:27:33,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:27:33,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:27:33,112 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:27:33,114 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:27:33,365 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:27:33,370 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:27:33,370 INFO L300 CfgBuilder]: Removed 41 assume(true) statements. [2023-02-15 10:27:33,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:27:33 BoogieIcfgContainer [2023-02-15 10:27:33,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:27:33,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:27:33,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:27:33,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:27:33,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:27:32" (1/3) ... [2023-02-15 10:27:33,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580cb312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:27:33, skipping insertion in model container [2023-02-15 10:27:33,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:32" (2/3) ... [2023-02-15 10:27:33,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580cb312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:27:33, skipping insertion in model container [2023-02-15 10:27:33,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:27:33" (3/3) ... [2023-02-15 10:27:33,377 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2023-02-15 10:27:33,388 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:27:33,388 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:27:33,430 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:27:33,435 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@41bf8dcc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:27:33,436 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:27:33,439 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) [2023-02-15 10:27:33,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 10:27:33,445 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:33,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:27:33,446 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:33,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:33,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1761516263, now seen corresponding path program 1 times [2023-02-15 10:27:33,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:33,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632141676] [2023-02-15 10:27:33,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:33,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:33,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:33,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632141676] [2023-02-15 10:27:33,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632141676] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:33,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:33,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:27:33,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864237640] [2023-02-15 10:27:33,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:33,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:27:33,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:33,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:27:33,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:27:33,608 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) [2023-02-15 10:27:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:33,637 INFO L93 Difference]: Finished difference Result 230 states and 397 transitions. [2023-02-15 10:27:33,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:27:33,638 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 [2023-02-15 10:27:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:33,643 INFO L225 Difference]: With dead ends: 230 [2023-02-15 10:27:33,644 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 10:27:33,647 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 [2023-02-15 10:27:33,649 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 [2023-02-15 10:27:33,649 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] [2023-02-15 10:27:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 10:27:33,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-15 10:27:33,675 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) [2023-02-15 10:27:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2023-02-15 10:27:33,677 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 9 [2023-02-15 10:27:33,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:33,678 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2023-02-15 10:27:33,678 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) [2023-02-15 10:27:33,678 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2023-02-15 10:27:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 10:27:33,679 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:33,679 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] [2023-02-15 10:27:33,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:27:33,680 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:33,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:33,680 INFO L85 PathProgramCache]: Analyzing trace with hash 849043181, now seen corresponding path program 1 times [2023-02-15 10:27:33,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:33,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21541523] [2023-02-15 10:27:33,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:33,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:33,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:33,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:33,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21541523] [2023-02-15 10:27:33,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21541523] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:33,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:33,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 10:27:33,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558382479] [2023-02-15 10:27:33,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:33,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:27:33,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:33,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:27:33,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:27:33,960 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) [2023-02-15 10:27:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:34,219 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2023-02-15 10:27:34,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:27:34,220 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 [2023-02-15 10:27:34,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:34,230 INFO L225 Difference]: With dead ends: 109 [2023-02-15 10:27:34,230 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 10:27:34,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:27:34,232 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 242 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:34,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 133 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:27:34,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 10:27:34,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-15 10:27:34,241 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) [2023-02-15 10:27:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2023-02-15 10:27:34,242 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 21 [2023-02-15 10:27:34,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:34,243 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2023-02-15 10:27:34,243 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) [2023-02-15 10:27:34,244 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2023-02-15 10:27:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:27:34,244 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:34,244 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] [2023-02-15 10:27:34,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:27:34,245 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:34,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash 502050183, now seen corresponding path program 1 times [2023-02-15 10:27:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:34,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987485075] [2023-02-15 10:27:34,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:34,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:34,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:34,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:34,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987485075] [2023-02-15 10:27:34,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987485075] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:34,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:34,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 10:27:34,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100009733] [2023-02-15 10:27:34,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:34,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:27:34,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:34,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:27:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:27:34,767 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) [2023-02-15 10:27:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:35,382 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2023-02-15 10:27:35,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 10:27:35,383 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 [2023-02-15 10:27:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:35,388 INFO L225 Difference]: With dead ends: 198 [2023-02-15 10:27:35,388 INFO L226 Difference]: Without dead ends: 192 [2023-02-15 10:27:35,390 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 [2023-02-15 10:27:35,393 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 533 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:35,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 157 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 10:27:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-15 10:27:35,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2023-02-15 10:27:35,412 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) [2023-02-15 10:27:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2023-02-15 10:27:35,413 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 24 [2023-02-15 10:27:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:35,413 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2023-02-15 10:27:35,414 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) [2023-02-15 10:27:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2023-02-15 10:27:35,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 10:27:35,414 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:35,414 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] [2023-02-15 10:27:35,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 10:27:35,415 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:35,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:35,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1234303898, now seen corresponding path program 1 times [2023-02-15 10:27:35,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:35,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073679258] [2023-02-15 10:27:35,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:35,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:36,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:36,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:36,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073679258] [2023-02-15 10:27:36,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073679258] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:36,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:36,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 10:27:36,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197468865] [2023-02-15 10:27:36,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:36,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:27:36,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:36,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:27:36,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:27:36,284 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) [2023-02-15 10:27:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:36,875 INFO L93 Difference]: Finished difference Result 274 states and 329 transitions. [2023-02-15 10:27:36,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 10:27:36,876 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 [2023-02-15 10:27:36,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:36,877 INFO L225 Difference]: With dead ends: 274 [2023-02-15 10:27:36,877 INFO L226 Difference]: Without dead ends: 271 [2023-02-15 10:27:36,877 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 [2023-02-15 10:27:36,878 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 322 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:36,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 225 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 10:27:36,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-02-15 10:27:36,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 253. [2023-02-15 10:27:36,917 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) [2023-02-15 10:27:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2023-02-15 10:27:36,920 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 27 [2023-02-15 10:27:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:36,920 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2023-02-15 10:27:36,920 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) [2023-02-15 10:27:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2023-02-15 10:27:36,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 10:27:36,922 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:36,922 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] [2023-02-15 10:27:36,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 10:27:36,922 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:36,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:36,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1680148119, now seen corresponding path program 1 times [2023-02-15 10:27:36,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:36,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382147773] [2023-02-15 10:27:36,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:36,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:37,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:37,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:37,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382147773] [2023-02-15 10:27:37,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382147773] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:37,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:37,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 10:27:37,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629009369] [2023-02-15 10:27:37,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:37,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:27:37,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:37,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:27:37,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:27:37,609 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 7 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) [2023-02-15 10:27:38,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:38,197 INFO L93 Difference]: Finished difference Result 273 states and 327 transitions. [2023-02-15 10:27:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 10:27:38,200 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 7 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 [2023-02-15 10:27:38,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:38,201 INFO L225 Difference]: With dead ends: 273 [2023-02-15 10:27:38,201 INFO L226 Difference]: Without dead ends: 270 [2023-02-15 10:27:38,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:27:38,202 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 346 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:38,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 247 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 10:27:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-15 10:27:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2023-02-15 10:27:38,220 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) [2023-02-15 10:27:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 308 transitions. [2023-02-15 10:27:38,221 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 308 transitions. Word has length 30 [2023-02-15 10:27:38,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:38,222 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 308 transitions. [2023-02-15 10:27:38,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 7 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) [2023-02-15 10:27:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 308 transitions. [2023-02-15 10:27:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 10:27:38,222 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:38,223 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] [2023-02-15 10:27:38,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 10:27:38,223 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:38,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:38,223 INFO L85 PathProgramCache]: Analyzing trace with hash -493122043, now seen corresponding path program 1 times [2023-02-15 10:27:38,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:38,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479017988] [2023-02-15 10:27:38,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:38,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:38,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:39,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:39,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479017988] [2023-02-15 10:27:39,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479017988] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:39,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:39,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 10:27:39,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565854034] [2023-02-15 10:27:39,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:39,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 10:27:39,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:39,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 10:27:39,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:27:39,022 INFO L87 Difference]: Start difference. First operand 253 states and 308 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 8 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) [2023-02-15 10:27:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:39,694 INFO L93 Difference]: Finished difference Result 272 states and 325 transitions. [2023-02-15 10:27:39,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 10:27:39,695 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 8 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 [2023-02-15 10:27:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:39,696 INFO L225 Difference]: With dead ends: 272 [2023-02-15 10:27:39,696 INFO L226 Difference]: Without dead ends: 269 [2023-02-15 10:27:39,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-02-15 10:27:39,697 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 340 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:39,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 271 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 10:27:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-15 10:27:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 253. [2023-02-15 10:27:39,714 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) [2023-02-15 10:27:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 307 transitions. [2023-02-15 10:27:39,716 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 307 transitions. Word has length 33 [2023-02-15 10:27:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:39,716 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 307 transitions. [2023-02-15 10:27:39,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 8 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) [2023-02-15 10:27:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 307 transitions. [2023-02-15 10:27:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 10:27:39,717 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:39,717 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] [2023-02-15 10:27:39,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 10:27:39,717 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:39,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:39,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2033122620, now seen corresponding path program 1 times [2023-02-15 10:27:39,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:39,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681259095] [2023-02-15 10:27:39,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:39,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:40,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:40,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:40,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681259095] [2023-02-15 10:27:40,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681259095] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:40,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:40,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 10:27:40,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611088686] [2023-02-15 10:27:40,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:40,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 10:27:40,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:40,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 10:27:40,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:27:40,726 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) [2023-02-15 10:27:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:41,485 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2023-02-15 10:27:41,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 10:27:41,485 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 [2023-02-15 10:27:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:41,486 INFO L225 Difference]: With dead ends: 271 [2023-02-15 10:27:41,486 INFO L226 Difference]: Without dead ends: 268 [2023-02-15 10:27:41,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-02-15 10:27:41,487 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 333 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:41,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 271 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 10:27:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-02-15 10:27:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 253. [2023-02-15 10:27:41,516 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) [2023-02-15 10:27:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 306 transitions. [2023-02-15 10:27:41,517 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 306 transitions. Word has length 36 [2023-02-15 10:27:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:41,517 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 306 transitions. [2023-02-15 10:27:41,517 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) [2023-02-15 10:27:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 306 transitions. [2023-02-15 10:27:41,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 10:27:41,518 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:41,518 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] [2023-02-15 10:27:41,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 10:27:41,519 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:41,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:41,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1335339115, now seen corresponding path program 1 times [2023-02-15 10:27:41,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:41,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703259842] [2023-02-15 10:27:41,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:41,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:41,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:42,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:42,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703259842] [2023-02-15 10:27:42,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703259842] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:42,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:42,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 10:27:42,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089908849] [2023-02-15 10:27:42,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:42,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 10:27:42,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:42,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 10:27:42,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:27:42,147 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) [2023-02-15 10:27:42,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:42,824 INFO L93 Difference]: Finished difference Result 270 states and 321 transitions. [2023-02-15 10:27:42,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 10:27:42,824 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 [2023-02-15 10:27:42,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:42,825 INFO L225 Difference]: With dead ends: 270 [2023-02-15 10:27:42,825 INFO L226 Difference]: Without dead ends: 267 [2023-02-15 10:27:42,826 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 [2023-02-15 10:27:42,826 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 424 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:42,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 250 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 10:27:42,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-15 10:27:42,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2023-02-15 10:27:42,845 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) [2023-02-15 10:27:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2023-02-15 10:27:42,846 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 39 [2023-02-15 10:27:42,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:42,847 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2023-02-15 10:27:42,848 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) [2023-02-15 10:27:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2023-02-15 10:27:42,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 10:27:42,850 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:42,850 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] [2023-02-15 10:27:42,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 10:27:42,850 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:42,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:42,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1154705564, now seen corresponding path program 1 times [2023-02-15 10:27:42,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:42,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165503630] [2023-02-15 10:27:42,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:42,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:43,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:44,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 10:27:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:27:44,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:44,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165503630] [2023-02-15 10:27:44,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165503630] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:27:44,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124696330] [2023-02-15 10:27:44,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:44,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:27:44,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:27:44,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:27:44,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:27:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:44,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 157 conjunts are in the unsatisfiable core [2023-02-15 10:27:44,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:27:44,466 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:27:44,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 10:27:44,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:27:44,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-02-15 10:27:44,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:27:44,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:27:44,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:44,718 INFO L321 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2023-02-15 10:27:44,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 143 [2023-02-15 10:27:44,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 97 [2023-02-15 10:27:44,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 10:27:44,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 54 [2023-02-15 10:27:44,751 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:27:44,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 55 [2023-02-15 10:27:44,769 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 11 [2023-02-15 10:27:44,771 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:27:44,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:44,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-15 10:27:44,828 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:27:44,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-15 10:27:44,837 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 10:27:44,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 26 [2023-02-15 10:27:44,884 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:27:44,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 10:27:44,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-15 10:27:44,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 10:27:44,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-02-15 10:27:44,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 10:27:45,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2023-02-15 10:27:45,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2023-02-15 10:27:45,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:45,018 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:27:45,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2023-02-15 10:27:45,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:45,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2023-02-15 10:27:45,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 10:27:45,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:45,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-02-15 10:27:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:45,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:27:45,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124696330] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:27:45,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:27:45,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 26 [2023-02-15 10:27:45,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735646475] [2023-02-15 10:27:45,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:27:45,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 10:27:45,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:45,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 10:27:45,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=820, Unknown=12, NotChecked=0, Total=930 [2023-02-15 10:27:45,509 INFO L87 Difference]: Start difference. First operand 253 states and 305 transitions. Second operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 17 states have internal predecessors, (55), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 10:27:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:47,543 INFO L93 Difference]: Finished difference Result 276 states and 325 transitions. [2023-02-15 10:27:47,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 10:27:47,545 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 17 states have internal predecessors, (55), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-02-15 10:27:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:47,546 INFO L225 Difference]: With dead ends: 276 [2023-02-15 10:27:47,546 INFO L226 Difference]: Without dead ends: 273 [2023-02-15 10:27:47,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=232, Invalid=1477, Unknown=13, NotChecked=0, Total=1722 [2023-02-15 10:27:47,549 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 778 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 1929 mSolverCounterSat, 179 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1929 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:47,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 373 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1929 Invalid, 2 Unknown, 0 Unchecked, 1.5s Time] [2023-02-15 10:27:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-15 10:27:47,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 257. [2023-02-15 10:27:47,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.2126696832579185) internal successors, (268), 236 states have internal predecessors, (268), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:27:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 307 transitions. [2023-02-15 10:27:47,576 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 307 transitions. Word has length 40 [2023-02-15 10:27:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:47,577 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 307 transitions. [2023-02-15 10:27:47,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 17 states have internal predecessors, (55), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 10:27:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 307 transitions. [2023-02-15 10:27:47,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 10:27:47,579 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:47,580 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, 1, 1, 1] [2023-02-15 10:27:47,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 10:27:47,790 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 [2023-02-15 10:27:47,790 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:47,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:47,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1293265745, now seen corresponding path program 1 times [2023-02-15 10:27:47,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:47,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732046923] [2023-02-15 10:27:47,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:47,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:48,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:48,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:48,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732046923] [2023-02-15 10:27:48,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732046923] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:48,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:48,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 10:27:48,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712388084] [2023-02-15 10:27:48,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:48,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 10:27:48,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:48,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 10:27:48,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:27:48,644 INFO L87 Difference]: Start difference. First operand 257 states and 307 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 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) [2023-02-15 10:27:49,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:49,535 INFO L93 Difference]: Finished difference Result 273 states and 321 transitions. [2023-02-15 10:27:49,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 10:27:49,536 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 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 42 [2023-02-15 10:27:49,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:49,537 INFO L225 Difference]: With dead ends: 273 [2023-02-15 10:27:49,537 INFO L226 Difference]: Without dead ends: 270 [2023-02-15 10:27:49,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2023-02-15 10:27:49,538 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 379 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:49,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 295 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 10:27:49,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-15 10:27:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 257. [2023-02-15 10:27:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.2081447963800904) internal successors, (267), 236 states have internal predecessors, (267), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:27:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2023-02-15 10:27:49,564 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 42 [2023-02-15 10:27:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:49,565 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2023-02-15 10:27:49,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 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) [2023-02-15 10:27:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2023-02-15 10:27:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 10:27:49,565 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:49,566 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, 1, 1, 1] [2023-02-15 10:27:49,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 10:27:49,566 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:49,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:49,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1188127317, now seen corresponding path program 1 times [2023-02-15 10:27:49,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:49,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235575998] [2023-02-15 10:27:49,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:49,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:50,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:50,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 10:27:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:27:50,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:50,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235575998] [2023-02-15 10:27:50,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235575998] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:27:50,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243874435] [2023-02-15 10:27:50,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:50,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:27:50,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:27:50,581 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:27:50,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:27:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:50,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 152 conjunts are in the unsatisfiable core [2023-02-15 10:27:50,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:27:50,763 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:27:50,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 10:27:50,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:27:50,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:27:50,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:27:50,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:27:50,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:50,947 INFO L321 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2023-02-15 10:27:50,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 138 [2023-02-15 10:27:50,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 94 [2023-02-15 10:27:50,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 10:27:50,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 54 [2023-02-15 10:27:50,965 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:27:50,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 55 [2023-02-15 10:27:51,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:51,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-15 10:27:51,040 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:27:51,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 49 [2023-02-15 10:27:51,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-15 10:27:51,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:51,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-15 10:27:51,110 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:27:51,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 10:27:51,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-15 10:27:51,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 10:27:51,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 10:27:51,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 10:27:51,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2023-02-15 10:27:51,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2023-02-15 10:27:51,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:51,277 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:27:51,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2023-02-15 10:27:51,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:51,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-02-15 10:27:51,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 10:27:51,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-15 10:27:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:51,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:27:51,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243874435] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:27:51,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:27:51,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2023-02-15 10:27:51,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844472418] [2023-02-15 10:27:51,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:27:51,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 10:27:51,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:51,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 10:27:51,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=749, Unknown=8, NotChecked=0, Total=870 [2023-02-15 10:27:51,719 INFO L87 Difference]: Start difference. First operand 257 states and 306 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 17 states have internal predecessors, (68), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 10:27:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:55,249 INFO L93 Difference]: Finished difference Result 274 states and 321 transitions. [2023-02-15 10:27:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 10:27:55,249 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 17 states have internal predecessors, (68), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2023-02-15 10:27:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:55,250 INFO L225 Difference]: With dead ends: 274 [2023-02-15 10:27:55,250 INFO L226 Difference]: Without dead ends: 271 [2023-02-15 10:27:55,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=235, Invalid=1316, Unknown=9, NotChecked=0, Total=1560 [2023-02-15 10:27:55,251 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 659 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 121 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:55,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 382 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1793 Invalid, 17 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 10:27:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-02-15 10:27:55,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 257. [2023-02-15 10:27:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.2036199095022624) internal successors, (266), 236 states have internal predecessors, (266), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:27:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 305 transitions. [2023-02-15 10:27:55,274 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 305 transitions. Word has length 43 [2023-02-15 10:27:55,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:55,274 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 305 transitions. [2023-02-15 10:27:55,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 17 states have internal predecessors, (68), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 10:27:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 305 transitions. [2023-02-15 10:27:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 10:27:55,275 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:55,275 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, 1, 1, 1, 1, 1, 1] [2023-02-15 10:27:55,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:27:55,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-15 10:27:55,481 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:55,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:55,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2001574846, now seen corresponding path program 1 times [2023-02-15 10:27:55,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:55,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567806097] [2023-02-15 10:27:55,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:55,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 10:27:55,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 10:27:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 10:27:55,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 10:27:55,531 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 10:27:55,532 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 10:27:55,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 10:27:55,537 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:27:55,539 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 10:27:55,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:27:55 BoogieIcfgContainer [2023-02-15 10:27:55,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 10:27:55,574 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 10:27:55,574 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 10:27:55,574 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 10:27:55,574 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:27:33" (3/4) ... [2023-02-15 10:27:55,576 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 10:27:55,604 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 10:27:55,604 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 10:27:55,605 INFO L158 Benchmark]: Toolchain (without parser) took 23149.50ms. Allocated memory was 159.4MB in the beginning and 524.3MB in the end (delta: 364.9MB). Free memory was 110.9MB in the beginning and 347.8MB in the end (delta: -236.9MB). Peak memory consumption was 129.4MB. Max. memory is 16.1GB. [2023-02-15 10:27:55,605 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:27:55,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.14ms. Allocated memory is still 159.4MB. Free memory was 110.5MB in the beginning and 125.7MB in the end (delta: -15.2MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2023-02-15 10:27:55,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.55ms. Allocated memory is still 159.4MB. Free memory was 125.7MB in the beginning and 126.5MB in the end (delta: -882.9kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 10:27:55,605 INFO L158 Benchmark]: Boogie Preprocessor took 44.75ms. Allocated memory is still 159.4MB. Free memory was 126.5MB in the beginning and 124.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:27:55,606 INFO L158 Benchmark]: RCFGBuilder took 405.28ms. Allocated memory is still 159.4MB. Free memory was 124.4MB in the beginning and 99.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-02-15 10:27:55,606 INFO L158 Benchmark]: TraceAbstraction took 22201.05ms. Allocated memory was 159.4MB in the beginning and 524.3MB in the end (delta: 364.9MB). Free memory was 99.3MB in the beginning and 350.9MB in the end (delta: -251.7MB). Peak memory consumption was 112.1MB. Max. memory is 16.1GB. [2023-02-15 10:27:55,606 INFO L158 Benchmark]: Witness Printer took 30.34ms. Allocated memory is still 524.3MB. Free memory was 350.9MB in the beginning and 347.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 10:27:55,607 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.14ms. Allocated memory is still 111.1MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.14ms. Allocated memory is still 159.4MB. Free memory was 110.5MB in the beginning and 125.7MB in the end (delta: -15.2MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.55ms. Allocated memory is still 159.4MB. Free memory was 125.7MB in the beginning and 126.5MB in the end (delta: -882.9kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.75ms. Allocated memory is still 159.4MB. Free memory was 126.5MB in the beginning and 124.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 405.28ms. Allocated memory is still 159.4MB. Free memory was 124.4MB in the beginning and 99.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 22201.05ms. Allocated memory was 159.4MB in the beginning and 524.3MB in the end (delta: 364.9MB). Free memory was 99.3MB in the beginning and 350.9MB in the end (delta: -251.7MB). Peak memory consumption was 112.1MB. Max. memory is 16.1GB. * Witness Printer took 30.34ms. Allocated memory is still 524.3MB. Free memory was 350.9MB in the beginning and 347.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 840]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; VAL [gl_list={3:0}] [L949] CALL gl_read() [L909] CALL gl_insert(__VERIFIER_nondet_int()) [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L902] node->value = value VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L903] CALL list_add(&node->linkage, &gl_list) VAL [gl_list={3:0}] [L890] EXPR head->next [L890] CALL __list_add(new, head, head->next) [L878] next->prev = new [L879] new->next = next [L880] new->prev = prev [L881] prev->next = new VAL [gl_list={3:0}, new={-1:4}, new={-1:4}, next={3:0}, next={3:0}, prev={3:0}, prev={3:0}] [L890] RET __list_add(new, head, head->next) [L903] RET list_add(&node->linkage, &gl_list) VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L904] (&node->nested)->next = (&node->nested) [L904] (&node->nested)->next = (&node->nested) VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L909] RET gl_insert(__VERIFIER_nondet_int()) [L911] COND FALSE !(__VERIFIER_nondet_int()) [L949] RET gl_read() [L950] CALL inspect(&gl_list) VAL [gl_list={3:0}, head={3:0}] [L853] COND FALSE !(!(head)) VAL [gl_list={3:0}, head={3:0}, head={3:0}] [L854] EXPR head->next VAL [gl_list={3:0}, head={3:0}, head={3:0}, head->next={-1:4}] [L854] COND FALSE !(!(head->next != head)) [L855] EXPR head->prev VAL [gl_list={3:0}, head={3:0}, head={3:0}, head->prev={-1:4}] [L855] COND FALSE !(!(head->prev != head)) [L856] EXPR head->prev [L856] head = head->prev [L857] COND FALSE !(!(head)) VAL [gl_list={3:0}, head={-1:4}, head={3:0}] [L858] EXPR head->next VAL [gl_list={3:0}, head={3:0}, head={-1:4}, head->next={3:0}] [L858] COND FALSE !(!(head->next != head)) [L859] EXPR head->prev VAL [gl_list={3:0}, head={3:0}, head={-1:4}, head->prev={3:0}] [L859] COND FALSE !(!(head->prev != head)) [L860] const struct node *node = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [gl_list={3:0}, head={3:0}, head={-1:4}, node={-1:0}] [L861] COND FALSE !(!(node)) VAL [gl_list={3:0}, head={-1:4}, head={3:0}, node={-1:0}] [L862] EXPR node->nested.next VAL [gl_list={3:0}, head={-1:4}, head={3:0}, node={-1:0}, node->nested.next={-1:12}] [L862] COND FALSE !(!(node->nested.next == &node->nested)) [L863] EXPR node->nested.prev VAL [gl_list={3:0}, head={3:0}, head={-1:4}, node={-1:0}, node->nested.prev={55:53}] [L863] COND TRUE !(node->nested.prev == &node->nested) [L863] CALL fail() VAL [gl_list={3:0}] [L840] reach_error() VAL [gl_list={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 4374 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4356 mSDsluCounter, 2740 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2278 mSDsCounter, 715 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11047 IncrementalHoareTripleChecker+Invalid, 11781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 715 mSolverCounterUnsat, 462 mSDtfsCounter, 11047 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=257occurred in iteration=9, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 143 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 414 ConstructedInterpolants, 14 QuantifiedInterpolants, 10066 SizeOfPredicates, 90 NumberOfNonLiveVariables, 838 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 2/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-15 10:27:55,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE