./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:18:19,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:18:19,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:18:19,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:18:19,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:18:19,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:18:19,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:18:19,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:18:19,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:18:19,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:18:19,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:18:19,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:18:19,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:18:19,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:18:19,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:18:19,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:18:19,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:18:19,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:18:19,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:18:19,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:18:19,889 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:18:19,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:18:19,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:18:19,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:18:19,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:18:19,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:18:19,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:18:19,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:18:19,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:18:19,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:18:19,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:18:19,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:18:19,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:18:19,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:18:19,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:18:19,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:18:19,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:18:19,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:18:19,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:18:19,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:18:19,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:18:19,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:18:19,919 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 02:18:19,950 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:18:19,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:18:19,951 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:18:19,951 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:18:19,952 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:18:19,952 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:18:19,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:18:19,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:18:19,954 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:18:19,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:18:19,955 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:18:19,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 02:18:19,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:18:19,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:18:19,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:18:19,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:18:19,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:18:19,966 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:18:19,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:18:19,966 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:18:19,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:18:19,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:18:19,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:18:19,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:18:19,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:18:19,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:18:19,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:18:19,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:18:19,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 02:18:19,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 02:18:19,969 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:18:19,969 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:18:19,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:18:19,970 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2022-07-21 02:18:20,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:18:20,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:18:20,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:18:20,356 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:18:20,357 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:18:20,358 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2022-07-21 02:18:20,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0988159/edddbd5bdc1e4b06b36d09b4be49be93/FLAG827631c95 [2022-07-21 02:18:20,933 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:18:20,935 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2022-07-21 02:18:20,952 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0988159/edddbd5bdc1e4b06b36d09b4be49be93/FLAG827631c95 [2022-07-21 02:18:21,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e0988159/edddbd5bdc1e4b06b36d09b4be49be93 [2022-07-21 02:18:21,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:18:21,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:18:21,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:18:21,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:18:21,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:18:21,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:18:21" (1/1) ... [2022-07-21 02:18:21,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@482a0398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:21, skipping insertion in model container [2022-07-21 02:18:21,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:18:21" (1/1) ... [2022-07-21 02:18:21,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:18:21,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:18:21,595 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2022-07-21 02:18:21,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:18:21,614 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:18:21,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2022-07-21 02:18:21,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:18:21,726 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:18:21,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:21 WrapperNode [2022-07-21 02:18:21,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:18:21,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:18:21,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:18:21,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:18:21,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:21" (1/1) ... [2022-07-21 02:18:21,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:21" (1/1) ... [2022-07-21 02:18:21,790 INFO L137 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 172 [2022-07-21 02:18:21,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:18:21,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:18:21,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:18:21,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:18:21,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:21" (1/1) ... [2022-07-21 02:18:21,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:21" (1/1) ... [2022-07-21 02:18:21,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:21" (1/1) ... [2022-07-21 02:18:21,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:21" (1/1) ... [2022-07-21 02:18:21,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:21" (1/1) ... [2022-07-21 02:18:21,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:21" (1/1) ... [2022-07-21 02:18:21,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:21" (1/1) ... [2022-07-21 02:18:21,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:18:21,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:18:21,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:18:21,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:18:21,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:21" (1/1) ... [2022-07-21 02:18:21,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:18:21,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:18:21,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 02:18:21,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 02:18:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 02:18:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 02:18:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 02:18:21,921 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 02:18:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:18:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:18:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 02:18:21,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:18:21,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:18:21,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:18:21,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 02:18:21,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 02:18:21,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:18:21,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:18:22,026 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:18:22,027 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:18:22,342 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:18:22,347 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:18:22,348 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-21 02:18:22,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:18:22 BoogieIcfgContainer [2022-07-21 02:18:22,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:18:22,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:18:22,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:18:22,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:18:22,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:18:21" (1/3) ... [2022-07-21 02:18:22,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2664da65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:18:22, skipping insertion in model container [2022-07-21 02:18:22,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:21" (2/3) ... [2022-07-21 02:18:22,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2664da65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:18:22, skipping insertion in model container [2022-07-21 02:18:22,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:18:22" (3/3) ... [2022-07-21 02:18:22,364 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2022-07-21 02:18:22,377 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:18:22,378 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:18:22,444 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:18:22,455 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@36aac990, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3d066cc0 [2022-07-21 02:18:22,456 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:18:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:18:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 02:18:22,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:22,479 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:18:22,479 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:22,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:22,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1111347289, now seen corresponding path program 1 times [2022-07-21 02:18:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:22,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580077251] [2022-07-21 02:18:22,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:22,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:22,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:22,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:18:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:18:22,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:22,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580077251] [2022-07-21 02:18:22,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580077251] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:18:22,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:18:22,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:18:22,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659646473] [2022-07-21 02:18:22,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:18:22,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:18:22,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:18:22,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:18:22,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:18:22,879 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:18:22,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:22,969 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2022-07-21 02:18:22,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:18:22,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-21 02:18:22,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:22,977 INFO L225 Difference]: With dead ends: 77 [2022-07-21 02:18:22,978 INFO L226 Difference]: Without dead ends: 34 [2022-07-21 02:18:22,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:18:22,984 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:22,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:18:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-21 02:18:23,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-21 02:18:23,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:18:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-07-21 02:18:23,017 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 25 [2022-07-21 02:18:23,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:23,023 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-07-21 02:18:23,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:18:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-07-21 02:18:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 02:18:23,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:23,025 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:18:23,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 02:18:23,025 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:23,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:23,026 INFO L85 PathProgramCache]: Analyzing trace with hash -234931549, now seen corresponding path program 1 times [2022-07-21 02:18:23,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:23,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452307875] [2022-07-21 02:18:23,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:23,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:23,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:23,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:18:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:18:23,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:23,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452307875] [2022-07-21 02:18:23,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452307875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:18:23,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:18:23,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:18:23,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615700657] [2022-07-21 02:18:23,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:18:23,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:18:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:18:23,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:18:23,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:18:23,128 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:18:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:23,174 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-07-21 02:18:23,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:18:23,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-21 02:18:23,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:23,176 INFO L225 Difference]: With dead ends: 64 [2022-07-21 02:18:23,176 INFO L226 Difference]: Without dead ends: 37 [2022-07-21 02:18:23,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:18:23,178 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:23,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 97 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:18:23,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-21 02:18:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-07-21 02:18:23,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:18:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-07-21 02:18:23,187 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 25 [2022-07-21 02:18:23,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:23,188 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-07-21 02:18:23,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:18:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-07-21 02:18:23,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 02:18:23,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:23,193 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:18:23,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 02:18:23,193 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:23,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1702704619, now seen corresponding path program 1 times [2022-07-21 02:18:23,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:23,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15955170] [2022-07-21 02:18:23,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:23,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:23,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:23,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:18:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:23,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 02:18:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:18:23,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:23,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15955170] [2022-07-21 02:18:23,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15955170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:18:23,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:18:23,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:18:23,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594740172] [2022-07-21 02:18:23,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:18:23,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:18:23,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:18:23,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:18:23,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:18:23,386 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 02:18:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:23,471 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-07-21 02:18:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:18:23,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-07-21 02:18:23,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:23,473 INFO L225 Difference]: With dead ends: 65 [2022-07-21 02:18:23,475 INFO L226 Difference]: Without dead ends: 51 [2022-07-21 02:18:23,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:18:23,477 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 22 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:23,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 122 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:18:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-21 02:18:23,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2022-07-21 02:18:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:18:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-07-21 02:18:23,489 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 33 [2022-07-21 02:18:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:23,489 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-07-21 02:18:23,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 02:18:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-07-21 02:18:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 02:18:23,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:23,492 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:18:23,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 02:18:23,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:23,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1515040147, now seen corresponding path program 1 times [2022-07-21 02:18:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:23,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722250216] [2022-07-21 02:18:23,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:23,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:24,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:24,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:18:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:24,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 02:18:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:18:24,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:24,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722250216] [2022-07-21 02:18:24,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722250216] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:24,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026289957] [2022-07-21 02:18:24,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:24,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:24,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:18:24,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:18:24,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 02:18:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:24,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-21 02:18:24,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:24,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:18:24,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:18:25,093 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:18:25,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 02:18:25,221 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:18:25,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:18:25,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:18:25,405 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-21 02:18:25,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-07-21 02:18:25,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 02:18:25,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:18:25,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-21 02:18:25,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-07-21 02:18:25,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-07-21 02:18:26,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:26,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:18:26,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:26,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-07-21 02:18:26,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:26,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 02:18:26,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:26,050 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 02:18:26,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-07-21 02:18:26,367 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-21 02:18:26,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 67 [2022-07-21 02:18:26,392 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-21 02:18:26,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 96 [2022-07-21 02:18:26,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:26,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-07-21 02:18:26,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2022-07-21 02:18:26,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:26,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 02:18:26,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-21 02:18:26,547 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 02:18:26,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 27 [2022-07-21 02:18:26,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 [2022-07-21 02:18:26,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:18:26,640 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:18:26,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:18:26,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_433 Int) (v_ArrVal_430 Int) (v_ArrVal_428 (Array Int Int)) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_430)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_428) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_433)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-07-21 02:18:26,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_433 Int) (v_ArrVal_430 Int) (v_ArrVal_428 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_430)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_428) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_433)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (<= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) is different from false [2022-07-21 02:18:26,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_433 Int) (v_ArrVal_430 Int) (v_ArrVal_428 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_430)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_428) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_433)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6|))) is different from false [2022-07-21 02:18:26,836 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| Int) (v_ArrVal_433 Int) (v_ArrVal_430 Int) (v_ArrVal_428 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| Int) (v_ArrVal_443 (Array Int Int)) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_444))) (or (< (select (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8|) 0)) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_443))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_445))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_430))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_428) (select (select (store (store .cse3 .cse2 (store (select .cse3 .cse2) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store .cse0 .cse2 (store (select .cse0 .cse2) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_433)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_434) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2022-07-21 02:18:26,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026289957] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:26,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:18:26,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2022-07-21 02:18:26,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939584246] [2022-07-21 02:18:26,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:18:26,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-21 02:18:26,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:18:26,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-21 02:18:26,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1761, Unknown=5, NotChecked=348, Total=2256 [2022-07-21 02:18:26,842 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 43 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:18:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:27,589 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2022-07-21 02:18:27,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 02:18:27,590 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2022-07-21 02:18:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:27,592 INFO L225 Difference]: With dead ends: 61 [2022-07-21 02:18:27,592 INFO L226 Difference]: Without dead ends: 59 [2022-07-21 02:18:27,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=192, Invalid=2269, Unknown=5, NotChecked=396, Total=2862 [2022-07-21 02:18:27,594 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:27,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 407 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 676 Invalid, 0 Unknown, 59 Unchecked, 0.4s Time] [2022-07-21 02:18:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-21 02:18:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2022-07-21 02:18:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:18:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-07-21 02:18:27,602 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 34 [2022-07-21 02:18:27,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:27,602 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-07-21 02:18:27,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:18:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-07-21 02:18:27,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 02:18:27,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:27,604 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:18:27,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 02:18:27,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:27,825 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:27,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:27,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1814087211, now seen corresponding path program 2 times [2022-07-21 02:18:27,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:27,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937868178] [2022-07-21 02:18:27,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:27,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:27,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:27,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:18:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:27,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 02:18:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 02:18:27,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:27,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937868178] [2022-07-21 02:18:27,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937868178] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:27,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738539513] [2022-07-21 02:18:27,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:18:27,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:27,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:18:27,931 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:18:27,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 02:18:28,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:18:28,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:18:28,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 02:18:28,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:18:28,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:18:28,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738539513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:18:28,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 02:18:28,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-21 02:18:28,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532313157] [2022-07-21 02:18:28,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:18:28,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 02:18:28,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:18:28,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 02:18:28,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:18:28,157 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 02:18:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:28,185 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-07-21 02:18:28,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 02:18:28,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-07-21 02:18:28,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:28,189 INFO L225 Difference]: With dead ends: 68 [2022-07-21 02:18:28,189 INFO L226 Difference]: Without dead ends: 50 [2022-07-21 02:18:28,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-21 02:18:28,191 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 73 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:28,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 65 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:18:28,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-21 02:18:28,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-07-21 02:18:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:18:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2022-07-21 02:18:28,207 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 35 [2022-07-21 02:18:28,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:28,208 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2022-07-21 02:18:28,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 02:18:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2022-07-21 02:18:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 02:18:28,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:28,210 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:18:28,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 02:18:28,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:28,411 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:28,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:28,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1514019345, now seen corresponding path program 1 times [2022-07-21 02:18:28,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:28,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926915321] [2022-07-21 02:18:28,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:28,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:28,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:28,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:18:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:28,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 02:18:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 02:18:28,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:28,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926915321] [2022-07-21 02:18:28,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926915321] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:28,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840961832] [2022-07-21 02:18:28,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:28,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:28,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:18:28,498 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:18:28,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 02:18:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:28,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:18:28,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:18:28,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:18:28,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840961832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:18:28,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 02:18:28,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-21 02:18:28,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222656398] [2022-07-21 02:18:28,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:18:28,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:18:28,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:18:28,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:18:28,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:18:28,699 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 02:18:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:28,720 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2022-07-21 02:18:28,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:18:28,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-07-21 02:18:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:28,721 INFO L225 Difference]: With dead ends: 66 [2022-07-21 02:18:28,721 INFO L226 Difference]: Without dead ends: 49 [2022-07-21 02:18:28,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:18:28,723 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 26 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:28,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:18:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-21 02:18:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-07-21 02:18:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:18:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2022-07-21 02:18:28,743 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 35 [2022-07-21 02:18:28,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:28,744 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2022-07-21 02:18:28,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 02:18:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2022-07-21 02:18:28,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 02:18:28,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:28,747 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:18:28,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 02:18:28,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:28,972 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:28,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:28,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1637752339, now seen corresponding path program 1 times [2022-07-21 02:18:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:28,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834683006] [2022-07-21 02:18:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:28,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:29,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:29,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:18:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:29,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 02:18:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:18:29,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:29,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834683006] [2022-07-21 02:18:29,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834683006] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:29,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822130258] [2022-07-21 02:18:29,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:29,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:29,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:18:29,071 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:18:29,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 02:18:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:29,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 02:18:29,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:29,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:18:29,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:18:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:18:29,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:18:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:18:29,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822130258] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:18:29,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:18:29,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-07-21 02:18:29,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751177873] [2022-07-21 02:18:29,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:18:29,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 02:18:29,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:18:29,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 02:18:29,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 02:18:29,376 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 02:18:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:29,480 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2022-07-21 02:18:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 02:18:29,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-07-21 02:18:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:29,482 INFO L225 Difference]: With dead ends: 78 [2022-07-21 02:18:29,482 INFO L226 Difference]: Without dead ends: 63 [2022-07-21 02:18:29,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 02:18:29,483 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:29,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 167 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:18:29,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-21 02:18:29,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2022-07-21 02:18:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:18:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-07-21 02:18:29,496 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 36 [2022-07-21 02:18:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:29,496 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-07-21 02:18:29,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 02:18:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-07-21 02:18:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 02:18:29,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:29,497 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:18:29,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 02:18:29,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:29,722 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:29,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:29,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1695010641, now seen corresponding path program 1 times [2022-07-21 02:18:29,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:29,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872606456] [2022-07-21 02:18:29,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:29,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:29,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:18:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:29,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 02:18:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:18:29,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:29,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872606456] [2022-07-21 02:18:29,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872606456] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:29,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809220942] [2022-07-21 02:18:29,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:29,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:29,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:18:29,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:18:29,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 02:18:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:30,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-21 02:18:30,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:30,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:18:30,362 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 02:18:30,397 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_1214 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1214))))) is different from true [2022-07-21 02:18:30,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:30,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-21 02:18:30,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 02:18:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-07-21 02:18:30,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:18:30,580 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1217 (Array Int Int)) (|v_node_create_~temp~0#1.base_19| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_1217) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (< |v_node_create_~temp~0#1.base_19| |c_#StackHeapBarrier|)) (<= (+ .cse0 1) 0) (<= 1 .cse0)))) is different from false [2022-07-21 02:18:30,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809220942] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:30,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:18:30,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-07-21 02:18:30,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349304915] [2022-07-21 02:18:30,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:18:30,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-21 02:18:30,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:18:30,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-21 02:18:30,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=528, Unknown=2, NotChecked=94, Total=702 [2022-07-21 02:18:30,583 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 02:18:30,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:30,873 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2022-07-21 02:18:30,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 02:18:30,873 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2022-07-21 02:18:30,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:30,874 INFO L225 Difference]: With dead ends: 63 [2022-07-21 02:18:30,874 INFO L226 Difference]: Without dead ends: 47 [2022-07-21 02:18:30,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=865, Unknown=2, NotChecked=122, Total=1122 [2022-07-21 02:18:30,875 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:30,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 254 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 168 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2022-07-21 02:18:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-21 02:18:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-21 02:18:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:18:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2022-07-21 02:18:30,882 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 36 [2022-07-21 02:18:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:30,883 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-07-21 02:18:30,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 02:18:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-07-21 02:18:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 02:18:30,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:30,884 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:18:30,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 02:18:31,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:31,108 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:31,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:31,108 INFO L85 PathProgramCache]: Analyzing trace with hash 108256579, now seen corresponding path program 1 times [2022-07-21 02:18:31,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:31,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134028422] [2022-07-21 02:18:31,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:31,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:31,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:31,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:18:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:31,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 02:18:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 02:18:31,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:31,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134028422] [2022-07-21 02:18:31,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134028422] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:31,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724066607] [2022-07-21 02:18:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:31,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:31,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:18:31,260 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:18:31,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 02:18:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:31,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 02:18:31,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:18:31,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:18:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:18:31,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724066607] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:18:31,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:18:31,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-07-21 02:18:31,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535993068] [2022-07-21 02:18:31,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:18:31,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 02:18:31,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:18:31,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 02:18:31,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-07-21 02:18:31,599 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-21 02:18:31,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:31,817 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2022-07-21 02:18:31,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 02:18:31,817 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 38 [2022-07-21 02:18:31,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:31,818 INFO L225 Difference]: With dead ends: 64 [2022-07-21 02:18:31,818 INFO L226 Difference]: Without dead ends: 51 [2022-07-21 02:18:31,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-07-21 02:18:31,819 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 106 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:31,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 214 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:18:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-21 02:18:31,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-07-21 02:18:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:18:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-07-21 02:18:31,826 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 38 [2022-07-21 02:18:31,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:31,826 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-07-21 02:18:31,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-21 02:18:31,826 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-07-21 02:18:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 02:18:31,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:31,827 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:18:31,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 02:18:32,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:32,048 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:32,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:32,049 INFO L85 PathProgramCache]: Analyzing trace with hash 108212869, now seen corresponding path program 1 times [2022-07-21 02:18:32,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:32,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026491601] [2022-07-21 02:18:32,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:32,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:32,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:32,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:18:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:32,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 02:18:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:18:32,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:32,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026491601] [2022-07-21 02:18:32,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026491601] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:32,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136906290] [2022-07-21 02:18:32,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:32,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:32,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:18:32,502 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:18:32,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 02:18:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:32,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 146 conjunts are in the unsatisfiable core [2022-07-21 02:18:32,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:32,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:18:33,146 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 02:18:33,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 02:18:33,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:18:33,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:18:33,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-07-21 02:18:33,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:33,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:18:33,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-07-21 02:18:33,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:18:33,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:33,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2022-07-21 02:18:33,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:33,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:33,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:33,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 02:18:33,700 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-21 02:18:33,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 02:18:33,985 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 02:18:33,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 79 [2022-07-21 02:18:34,007 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-21 02:18:34,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 143 [2022-07-21 02:18:34,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:34,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 35 [2022-07-21 02:18:34,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:34,031 INFO L356 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-07-21 02:18:34,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 87 [2022-07-21 02:18:34,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2022-07-21 02:18:34,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:34,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:34,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-07-21 02:18:34,202 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-21 02:18:34,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 49 [2022-07-21 02:18:34,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:34,266 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 02:18:34,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-21 02:18:34,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:18:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:18:34,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:18:34,415 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1574 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1568)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1566))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1565))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1574))) (select (select .cse1 .cse2) .cse3)) (+ 4 (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-07-21 02:18:34,432 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1574 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1568)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1566))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1565))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1574))) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))) is different from false [2022-07-21 02:18:34,441 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1574 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1568)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1566))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_1565))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1574))) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4))))))) is different from false [2022-07-21 02:18:34,549 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:18:34,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 298 [2022-07-21 02:18:34,564 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:18:34,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2968 treesize of output 2840 [2022-07-21 02:18:34,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3232 treesize of output 2712 [2022-07-21 02:18:35,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 3 [2022-07-21 02:18:35,291 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:18:35,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1208 treesize of output 1482 [2022-07-21 02:18:51,296 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_71 Int) (v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1566 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| Int) (v_ArrVal_1584 (Array Int Int)) (v_ArrVal_1583 (Array Int Int))) (let ((.cse1 (let ((.cse47 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_ArrVal_1583)) (.cse44 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_ArrVal_1584))) (let ((.cse45 (select (select .cse44 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse46 (select (select .cse47 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse43 (store (store .cse47 .cse45 (store (select .cse47 .cse45) .cse46 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_ArrVal_1568))) (select (select .cse43 (select (select (store (store .cse44 .cse45 (store (select .cse44 .cse45) .cse46 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_ArrVal_1566) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse43 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (.cse42 (not (= |c_ULTIMATE.start_sll_circular_insert_~data#1| v_arrayElimCell_71)))) (or (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| |c_#StackHeapBarrier|)) (let ((.cse0 (and (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (= (let ((.cse31 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_10)) (.cse28 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_9))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse30 (select (select .cse31 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse27 (store (store .cse31 .cse29 (store (select .cse31 .cse29) .cse30 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_6))) (select (select .cse27 (select (select (store (store .cse28 .cse29 (store (select .cse28 .cse29) .cse30 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 0)) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (= (let ((.cse36 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_10)) (.cse33 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_9))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse35 (select (select .cse36 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse32 (store (store .cse36 .cse34 (store (select .cse36 .cse34) .cse35 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_6))) (select (select .cse32 (select (select (store (store .cse33 .cse34 (store (select .cse33 .cse34) .cse35 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_ArrVal_1583)) (.cse38 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_ArrVal_1584))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse40 (select (select .cse41 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse37 (store (store .cse41 .cse39 (store (select .cse41 .cse39) .cse40 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_ArrVal_1568))) (select (select .cse37 (select (select (store (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_ArrVal_1566) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) .cse42))) (and (or .cse0 (not (= (+ .cse1 4) 0))) (or .cse0 (forall ((v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_17))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= .cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_18))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse3 (store (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_16))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse6 .cse2 (store (select .cse6 .cse2) .cse5 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_15) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) (or .cse0 (forall ((v_prenex_14 (Array Int Int)) (v_prenex_13 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int))) (= (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_14)) (.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_13))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse10 (select (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse7 (store (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_12))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse11 .cse9 (store (select .cse11 .cse9) .cse10 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_11) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17|))) (or .cse0 (= |c_ULTIMATE.start_main_~uneq~0#1| v_arrayElimCell_71)) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_10)) (.cse23 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_9))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse25 (select (select .cse26 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse22 (store (store .cse26 .cse24 (store (select .cse26 .cse24) .cse25 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_6)) (.cse12 (store (store .cse23 .cse24 (store (select .cse23 .cse24) .cse25 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_prenex_7))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse12 .cse13) .cse14) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17|)) (let ((.cse16 (select (select .cse22 .cse13) .cse14))) (let ((.cse15 (= .cse16 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_ArrVal_1583)) (.cse18 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_ArrVal_1584))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse20 (select (select .cse21 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse17 (store (store .cse21 .cse19 (store (select .cse21 .cse19) .cse20 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_ArrVal_1568))) (select (select .cse17 (select (select (store (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17| v_ArrVal_1566) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (and (or .cse15 (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_insert_~data#1|)) (not (= (+ .cse16 4) 0)) (or (= .cse16 0) (and .cse15 (= |c_ULTIMATE.start_main_~uneq~0#1| v_arrayElimCell_71)))))))))))))) (and (= .cse1 0) .cse42) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_17|) 0))))) is different from false [2022-07-21 02:18:51,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136906290] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:51,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:18:51,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 40 [2022-07-21 02:18:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837280916] [2022-07-21 02:18:51,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:18:51,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-21 02:18:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:18:51,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-21 02:18:51,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1679, Unknown=5, NotChecked=340, Total=2162 [2022-07-21 02:18:51,333 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 40 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 32 states have internal predecessors, (59), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 02:18:51,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:51,961 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-07-21 02:18:51,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 02:18:51,962 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 32 states have internal predecessors, (59), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2022-07-21 02:18:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:51,963 INFO L225 Difference]: With dead ends: 51 [2022-07-21 02:18:51,963 INFO L226 Difference]: Without dead ends: 49 [2022-07-21 02:18:51,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=205, Invalid=2256, Unknown=5, NotChecked=396, Total=2862 [2022-07-21 02:18:51,965 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:51,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 349 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 490 Invalid, 0 Unknown, 29 Unchecked, 0.3s Time] [2022-07-21 02:18:51,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-21 02:18:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-07-21 02:18:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:18:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-07-21 02:18:51,981 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 38 [2022-07-21 02:18:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:51,982 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-07-21 02:18:51,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 32 states have internal predecessors, (59), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 02:18:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-07-21 02:18:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 02:18:51,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:51,987 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:18:52,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 02:18:52,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:52,204 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:52,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:52,205 INFO L85 PathProgramCache]: Analyzing trace with hash 913373856, now seen corresponding path program 1 times [2022-07-21 02:18:52,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:52,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994855716] [2022-07-21 02:18:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:52,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:52,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:52,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:18:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:52,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 02:18:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:18:53,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:53,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994855716] [2022-07-21 02:18:53,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994855716] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:53,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630671308] [2022-07-21 02:18:53,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:53,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:53,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:18:53,240 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:18:53,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 02:18:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:53,429 WARN L261 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 188 conjunts are in the unsatisfiable core [2022-07-21 02:18:53,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:53,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:18:53,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:18:53,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 02:18:53,617 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 02:18:53,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 02:18:53,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-07-21 02:18:53,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:53,968 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 02:18:53,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-07-21 02:18:53,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:18:54,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:18:54,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:18:54,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:18:54,219 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 02:18:54,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 94 treesize of output 60 [2022-07-21 02:18:54,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-21 02:18:54,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-07-21 02:18:54,457 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 02:18:54,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 52 [2022-07-21 02:18:54,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:54,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-21 02:18:54,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:54,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-21 02:18:54,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:54,716 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 02:18:54,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 126 treesize of output 100 [2022-07-21 02:18:54,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:54,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 02:18:54,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:54,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:54,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:54,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:54,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2022-07-21 02:18:54,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:54,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:54,748 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 02:18:54,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-07-21 02:18:55,168 INFO L356 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2022-07-21 02:18:55,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 48 [2022-07-21 02:18:55,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:55,277 INFO L356 Elim1Store]: treesize reduction 124, result has 43.9 percent of original size [2022-07-21 02:18:55,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 165 treesize of output 163 [2022-07-21 02:18:55,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:55,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:55,346 INFO L356 Elim1Store]: treesize reduction 88, result has 45.3 percent of original size [2022-07-21 02:18:55,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 89 [2022-07-21 02:18:55,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 02:19:01,601 INFO L356 Elim1Store]: treesize reduction 133, result has 12.5 percent of original size [2022-07-21 02:19:01,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 829 treesize of output 334 [2022-07-21 02:19:01,649 INFO L356 Elim1Store]: treesize reduction 151, result has 6.2 percent of original size [2022-07-21 02:19:01,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 297 treesize of output 220 [2022-07-21 02:19:01,977 INFO L356 Elim1Store]: treesize reduction 54, result has 46.5 percent of original size [2022-07-21 02:19:01,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 74 [2022-07-21 02:19:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:19:02,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:19:03,998 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| Int) (v_ArrVal_1779 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| Int) (v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1798 (Array Int Int)) (v_ArrVal_1797 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.base| Int) (v_ArrVal_1786 Int)) (let ((.cse6 (let ((.cse13 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1798))) (let ((.cse12 (select .cse13 |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (let ((.cse11 (store .cse13 |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse12 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0)))) (store .cse11 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| (store (select .cse11 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20|) 0 (select .cse12 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))))))) (.cse5 (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1797))) (let ((.cse9 (select .cse10 |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (let ((.cse8 (store .cse10 |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse9 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20|)))) (store .cse8 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| (store (select .cse8 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20|) 0 (select .cse9 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))))))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (store (let ((.cse7 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1799))) (store .cse7 |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select .cse7 |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_ArrVal_1786))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| v_ArrVal_1779)) (.cse1 (select (select .cse5 .cse3) .cse4)) (.cse2 (select (select .cse6 .cse3) .cse4))) (or (< (select (select .cse0 .cse1) (+ .cse2 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse3) (+ 4 .cse4)))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 (select (select .cse5 .cse1) .cse2)) (+ (select (select .cse6 .cse1) .cse2) 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_20|) 0))))))) is different from false [2022-07-21 02:19:04,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630671308] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:19:04,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:19:04,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29] total 51 [2022-07-21 02:19:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515383261] [2022-07-21 02:19:04,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:19:04,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-21 02:19:04,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:19:04,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-21 02:19:04,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3278, Unknown=80, NotChecked=116, Total=3660 [2022-07-21 02:19:04,005 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 51 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 41 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:19:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:19:13,307 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-07-21 02:19:13,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 02:19:13,308 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 41 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2022-07-21 02:19:13,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:19:13,309 INFO L225 Difference]: With dead ends: 56 [2022-07-21 02:19:13,309 INFO L226 Difference]: Without dead ends: 54 [2022-07-21 02:19:13,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=322, Invalid=4853, Unknown=85, NotChecked=142, Total=5402 [2022-07-21 02:19:13,311 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 02:19:13,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 314 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 692 Invalid, 0 Unknown, 83 Unchecked, 0.5s Time] [2022-07-21 02:19:13,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-21 02:19:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-07-21 02:19:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:19:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2022-07-21 02:19:13,319 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 40 [2022-07-21 02:19:13,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:19:13,319 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2022-07-21 02:19:13,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 41 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:19:13,319 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-07-21 02:19:13,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 02:19:13,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:19:13,320 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:19:13,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 02:19:13,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-21 02:19:13,524 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:19:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:19:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2056878043, now seen corresponding path program 3 times [2022-07-21 02:19:13,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:19:13,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431162686] [2022-07-21 02:19:13,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:13,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:19:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:13,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:19:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:13,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:19:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:13,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 02:19:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:13,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 02:19:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-21 02:19:13,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:19:13,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431162686] [2022-07-21 02:19:13,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431162686] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:19:13,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115359128] [2022-07-21 02:19:13,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 02:19:13,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:19:13,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:19:13,616 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:19:13,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 02:19:13,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 02:19:13,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:19:13,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:19:13,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-21 02:19:13,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:19:13,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115359128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:19:13,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 02:19:13,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-21 02:19:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306200820] [2022-07-21 02:19:13,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:19:13,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:19:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:19:13,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:19:13,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:19:13,951 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 02:19:13,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:19:13,965 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-07-21 02:19:13,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:19:13,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-07-21 02:19:13,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:19:13,967 INFO L225 Difference]: With dead ends: 65 [2022-07-21 02:19:13,967 INFO L226 Difference]: Without dead ends: 36 [2022-07-21 02:19:13,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:19:13,968 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:19:13,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 51 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:19:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-21 02:19:13,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-21 02:19:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:19:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-07-21 02:19:13,975 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 42 [2022-07-21 02:19:13,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:19:13,976 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-07-21 02:19:13,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 02:19:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-07-21 02:19:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 02:19:13,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:19:13,978 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:19:13,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 02:19:14,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:19:14,184 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:19:14,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:19:14,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1703615957, now seen corresponding path program 1 times [2022-07-21 02:19:14,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:19:14,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723790700] [2022-07-21 02:19:14,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:14,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:19:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:14,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:19:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:19:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:14,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 02:19:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:19:14,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:19:14,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723790700] [2022-07-21 02:19:14,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723790700] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:19:14,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213281233] [2022-07-21 02:19:14,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:14,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:19:14,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:19:14,317 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:19:14,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 02:19:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:14,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 02:19:14,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 02:19:14,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:19:14,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213281233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:19:14,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 02:19:14,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2022-07-21 02:19:14,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67052026] [2022-07-21 02:19:14,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:19:14,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 02:19:14,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:19:14,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 02:19:14,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-21 02:19:14,636 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 02:19:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:19:14,677 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-07-21 02:19:14,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 02:19:14,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-21 02:19:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:19:14,679 INFO L225 Difference]: With dead ends: 45 [2022-07-21 02:19:14,679 INFO L226 Difference]: Without dead ends: 42 [2022-07-21 02:19:14,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-21 02:19:14,681 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 20 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:19:14,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 143 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:19:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-21 02:19:14,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-07-21 02:19:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:19:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-07-21 02:19:14,689 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 43 [2022-07-21 02:19:14,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:19:14,690 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-07-21 02:19:14,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 02:19:14,690 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-07-21 02:19:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 02:19:14,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:19:14,691 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:19:14,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 02:19:14,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 02:19:14,893 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:19:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:19:14,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1272528310, now seen corresponding path program 1 times [2022-07-21 02:19:14,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:19:14,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534535602] [2022-07-21 02:19:14,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:14,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:19:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:15,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:19:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:15,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:19:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:15,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 02:19:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:19:15,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:19:15,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534535602] [2022-07-21 02:19:15,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534535602] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:19:15,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531813428] [2022-07-21 02:19:15,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:15,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:19:15,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:19:15,670 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:19:15,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 02:19:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:16,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 161 conjunts are in the unsatisfiable core [2022-07-21 02:19:16,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:16,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:19:16,286 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 02:19:16,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 02:19:16,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-21 02:19:16,488 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 535629 column 46: unknown constant v_#valid_BEFORE_CALL_18 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 02:19:16,491 INFO L158 Benchmark]: Toolchain (without parser) took 55232.56ms. Allocated memory was 56.6MB in the beginning and 205.5MB in the end (delta: 148.9MB). Free memory was 33.6MB in the beginning and 145.6MB in the end (delta: -112.0MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2022-07-21 02:19:16,492 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:19:16,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.84ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 33.4MB in the beginning and 50.8MB in the end (delta: -17.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 02:19:16,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.11ms. Allocated memory is still 75.5MB. Free memory was 50.6MB in the beginning and 48.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:19:16,492 INFO L158 Benchmark]: Boogie Preprocessor took 48.56ms. Allocated memory is still 75.5MB. Free memory was 48.3MB in the beginning and 46.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:19:16,492 INFO L158 Benchmark]: RCFGBuilder took 507.61ms. Allocated memory is still 75.5MB. Free memory was 46.4MB in the beginning and 47.0MB in the end (delta: -580.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 02:19:16,493 INFO L158 Benchmark]: TraceAbstraction took 54139.71ms. Allocated memory was 75.5MB in the beginning and 205.5MB in the end (delta: 130.0MB). Free memory was 46.5MB in the beginning and 145.6MB in the end (delta: -99.1MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2022-07-21 02:19:16,494 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.24ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 464.84ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 33.4MB in the beginning and 50.8MB in the end (delta: -17.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.11ms. Allocated memory is still 75.5MB. Free memory was 50.6MB in the beginning and 48.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.56ms. Allocated memory is still 75.5MB. Free memory was 48.3MB in the beginning and 46.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 507.61ms. Allocated memory is still 75.5MB. Free memory was 46.4MB in the beginning and 47.0MB in the end (delta: -580.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 54139.71ms. Allocated memory was 75.5MB in the beginning and 205.5MB in the end (delta: 130.0MB). Free memory was 46.5MB in the beginning and 145.6MB in the end (delta: -99.1MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 535629 column 46: unknown constant v_#valid_BEFORE_CALL_18 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 535629 column 46: unknown constant v_#valid_BEFORE_CALL_18: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 02:19:16,523 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 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:19:18,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:19:18,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:19:18,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:19:18,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:19:18,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:19:18,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:19:18,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:19:18,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:19:18,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:19:18,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:19:18,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:19:18,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:19:18,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:19:18,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:19:18,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:19:18,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:19:18,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:19:18,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:19:18,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:19:18,526 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:19:18,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:19:18,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:19:18,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:19:18,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:19:18,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:19:18,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:19:18,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:19:18,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:19:18,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:19:18,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:19:18,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:19:18,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:19:18,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:19:18,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:19:18,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:19:18,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:19:18,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:19:18,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:19:18,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:19:18,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:19:18,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:19:18,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 02:19:18,581 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:19:18,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:19:18,582 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:19:18,582 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:19:18,583 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:19:18,583 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:19:18,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:19:18,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:19:18,584 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:19:18,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:19:18,585 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:19:18,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:19:18,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:19:18,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:19:18,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:19:18,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:19:18,586 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 02:19:18,587 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 02:19:18,587 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 02:19:18,587 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:19:18,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:19:18,587 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:19:18,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:19:18,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:19:18,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:19:18,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:19:18,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:19:18,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:19:18,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:19:18,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:19:18,589 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 02:19:18,589 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 02:19:18,590 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:19:18,590 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:19:18,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:19:18,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 02:19:18,590 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2022-07-21 02:19:18,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:19:18,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:19:18,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:19:18,932 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:19:18,933 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:19:18,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2022-07-21 02:19:18,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cc642cb5/5d33d69de0034d379f505692cd80e0c2/FLAG6b54b38d0 [2022-07-21 02:19:19,484 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:19:19,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2022-07-21 02:19:19,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cc642cb5/5d33d69de0034d379f505692cd80e0c2/FLAG6b54b38d0 [2022-07-21 02:19:20,008 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cc642cb5/5d33d69de0034d379f505692cd80e0c2 [2022-07-21 02:19:20,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:19:20,012 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:19:20,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:19:20,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:19:20,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:19:20,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:19:20" (1/1) ... [2022-07-21 02:19:20,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a37d370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:19:20, skipping insertion in model container [2022-07-21 02:19:20,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:19:20" (1/1) ... [2022-07-21 02:19:20,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:19:20,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:19:20,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2022-07-21 02:19:20,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:19:20,385 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:19:20,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2022-07-21 02:19:20,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:19:20,472 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:19:20,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:19:20 WrapperNode [2022-07-21 02:19:20,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:19:20,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:19:20,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:19:20,474 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:19:20,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:19:20" (1/1) ... [2022-07-21 02:19:20,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:19:20" (1/1) ... [2022-07-21 02:19:20,545 INFO L137 Inliner]: procedures = 130, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 173 [2022-07-21 02:19:20,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:19:20,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:19:20,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:19:20,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:19:20,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:19:20" (1/1) ... [2022-07-21 02:19:20,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:19:20" (1/1) ... [2022-07-21 02:19:20,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:19:20" (1/1) ... [2022-07-21 02:19:20,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:19:20" (1/1) ... [2022-07-21 02:19:20,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:19:20" (1/1) ... [2022-07-21 02:19:20,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:19:20" (1/1) ... [2022-07-21 02:19:20,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:19:20" (1/1) ... [2022-07-21 02:19:20,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:19:20,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:19:20,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:19:20,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:19:20,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:19:20" (1/1) ... [2022-07-21 02:19:20,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:19:20,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:19:20,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 02:19:20,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 02:19:20,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 02:19:20,696 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 02:19:20,696 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 02:19:20,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:19:20,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:19:20,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 02:19:20,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:19:20,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:19:20,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:19:20,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 02:19:20,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 02:19:20,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 02:19:20,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:19:20,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:19:20,872 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:19:20,873 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:19:21,220 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:19:21,229 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:19:21,229 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-21 02:19:21,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:19:21 BoogieIcfgContainer [2022-07-21 02:19:21,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:19:21,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:19:21,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:19:21,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:19:21,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:19:20" (1/3) ... [2022-07-21 02:19:21,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a2bc5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:19:21, skipping insertion in model container [2022-07-21 02:19:21,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:19:20" (2/3) ... [2022-07-21 02:19:21,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a2bc5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:19:21, skipping insertion in model container [2022-07-21 02:19:21,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:19:21" (3/3) ... [2022-07-21 02:19:21,239 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2022-07-21 02:19:21,251 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:19:21,251 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:19:21,298 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:19:21,304 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7bd4c1fb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@afafc8a [2022-07-21 02:19:21,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:19:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:19:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 02:19:21,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:19:21,321 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:19:21,322 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:19:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:19:21,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1111347289, now seen corresponding path program 1 times [2022-07-21 02:19:21,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:19:21,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843716448] [2022-07-21 02:19:21,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:21,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:19:21,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:19:21,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:19:21,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 02:19:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:21,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 02:19:21,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:19:21,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:19:21,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:19:21,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843716448] [2022-07-21 02:19:21,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843716448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:19:21,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:19:21,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 02:19:21,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54415727] [2022-07-21 02:19:21,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:19:21,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 02:19:21,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:19:21,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 02:19:21,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 02:19:21,669 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 02:19:21,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:19:21,693 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2022-07-21 02:19:21,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 02:19:21,695 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-21 02:19:21,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:19:21,705 INFO L225 Difference]: With dead ends: 77 [2022-07-21 02:19:21,705 INFO L226 Difference]: Without dead ends: 34 [2022-07-21 02:19:21,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 02:19:21,721 INFO L413 NwaCegarLoop]: 55 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, 55 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:19:21,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:19:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-21 02:19:21,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-21 02:19:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:19:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-07-21 02:19:21,766 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 25 [2022-07-21 02:19:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:19:21,767 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-07-21 02:19:21,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 02:19:21,768 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-07-21 02:19:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 02:19:21,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:19:21,770 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:19:21,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-21 02:19:21,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:19:21,982 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:19:21,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:19:21,983 INFO L85 PathProgramCache]: Analyzing trace with hash -234931549, now seen corresponding path program 1 times [2022-07-21 02:19:21,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:19:21,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501085705] [2022-07-21 02:19:21,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:21,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:19:21,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:19:21,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:19:21,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 02:19:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:22,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 02:19:22,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:19:22,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:19:22,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:19:22,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501085705] [2022-07-21 02:19:22,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501085705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:19:22,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:19:22,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:19:22,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757645448] [2022-07-21 02:19:22,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:19:22,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:19:22,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:19:22,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:19:22,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:19:22,221 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:19:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:19:22,247 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-07-21 02:19:22,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:19:22,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-21 02:19:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:19:22,250 INFO L225 Difference]: With dead ends: 64 [2022-07-21 02:19:22,250 INFO L226 Difference]: Without dead ends: 37 [2022-07-21 02:19:22,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:19:22,252 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:19:22,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:19:22,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-21 02:19:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-07-21 02:19:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:19:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-07-21 02:19:22,259 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 25 [2022-07-21 02:19:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:19:22,259 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-07-21 02:19:22,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 02:19:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-07-21 02:19:22,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 02:19:22,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:19:22,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:19:22,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 02:19:22,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:19:22,473 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:19:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:19:22,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1702704619, now seen corresponding path program 1 times [2022-07-21 02:19:22,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:19:22,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46104696] [2022-07-21 02:19:22,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:22,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:19:22,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:19:22,476 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:19:22,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 02:19:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:22,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:19:22,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:19:22,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:19:22,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:19:22,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46104696] [2022-07-21 02:19:22,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46104696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:19:22,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:19:22,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:19:22,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555864796] [2022-07-21 02:19:22,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:19:22,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:19:22,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:19:22,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:19:22,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:19:22,690 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 02:19:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:19:22,735 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-07-21 02:19:22,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:19:22,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-07-21 02:19:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:19:22,737 INFO L225 Difference]: With dead ends: 53 [2022-07-21 02:19:22,737 INFO L226 Difference]: Without dead ends: 36 [2022-07-21 02:19:22,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:19:22,739 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 27 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:19:22,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:19:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-21 02:19:22,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-21 02:19:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:19:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-07-21 02:19:22,745 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 33 [2022-07-21 02:19:22,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:19:22,746 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-07-21 02:19:22,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 02:19:22,746 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-07-21 02:19:22,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 02:19:22,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:19:22,747 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:19:22,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 02:19:22,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:19:22,960 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:19:22,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:19:22,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1515040147, now seen corresponding path program 1 times [2022-07-21 02:19:22,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:19:22,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652177596] [2022-07-21 02:19:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:22,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:19:22,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:19:22,963 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:19:22,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 02:19:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:23,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-21 02:19:23,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:23,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:19:23,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:19:23,816 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:19:23,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2022-07-21 02:19:23,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 02:19:23,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:19:24,165 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:19:24,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 40 [2022-07-21 02:19:24,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 02:19:24,498 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:19:24,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 32 [2022-07-21 02:19:24,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-21 02:19:24,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-07-21 02:19:24,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:19:24,981 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-21 02:19:24,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 67 [2022-07-21 02:19:25,026 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:19:25,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2022-07-21 02:19:25,061 INFO L356 Elim1Store]: treesize reduction 8, result has 70.4 percent of original size [2022-07-21 02:19:25,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2022-07-21 02:19:25,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 02:19:25,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-07-21 02:19:25,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-07-21 02:19:25,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-07-21 02:19:25,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:25,980 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-21 02:19:25,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 95 [2022-07-21 02:19:25,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-21 02:19:26,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:26,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2022-07-21 02:19:26,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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 [2022-07-21 02:19:26,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 02:19:26,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-07-21 02:19:26,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 [2022-07-21 02:19:26,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:19:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:19:26,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:19:26,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_246 (_ BitVec 32)) (v_ArrVal_248 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_246)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_247) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_244) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-21 02:19:26,546 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_246 (_ BitVec 32)) (v_ArrVal_248 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_ArrVal_246)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_247) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_244) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_249) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-21 02:19:26,571 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_246 (_ BitVec 32)) (v_ArrVal_248 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_246)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_247) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_244) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_249) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_243) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-21 02:19:27,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:19:27,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652177596] [2022-07-21 02:19:27,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652177596] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:19:27,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1542340461] [2022-07-21 02:19:27,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:27,067 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 02:19:27,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 02:19:27,075 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 02:19:27,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-07-21 02:19:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:27,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-21 02:19:27,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:27,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:19:27,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:19:27,926 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:19:27,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2022-07-21 02:19:28,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 02:19:28,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:19:28,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 10 [2022-07-21 02:19:28,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-21 02:19:28,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:19:28,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 02:19:29,150 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:19:29,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 02:19:29,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:19:29,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:29,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-21 02:19:29,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:29,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 02:19:29,260 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-21 02:19:29,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2022-07-21 02:19:29,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:29,903 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-21 02:19:29,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 74 [2022-07-21 02:19:29,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-21 02:19:29,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:29,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:29,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-21 02:19:29,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 02:19:30,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-07-21 02:19:30,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:19:30,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 [2022-07-21 02:19:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:19:30,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:19:30,409 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_340)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_337) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-21 02:19:30,449 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (_ BitVec 32)) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_ArrVal_340)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_337) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_341) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_339) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-21 02:19:30,471 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_340 (_ BitVec 32)) (v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_340)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_337) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_341) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_338) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_339) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-21 02:19:31,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1542340461] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:19:31,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:19:31,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 37 [2022-07-21 02:19:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720247801] [2022-07-21 02:19:31,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:19:31,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-21 02:19:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:19:31,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-21 02:19:31,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1577, Unknown=12, NotChecked=510, Total=2256 [2022-07-21 02:19:31,417 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 37 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 28 states have internal predecessors, (45), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:19:32,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:19:32,780 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2022-07-21 02:19:32,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 02:19:32,782 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 28 states have internal predecessors, (45), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 34 [2022-07-21 02:19:32,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:19:32,784 INFO L225 Difference]: With dead ends: 58 [2022-07-21 02:19:32,784 INFO L226 Difference]: Without dead ends: 56 [2022-07-21 02:19:32,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=218, Invalid=2344, Unknown=12, NotChecked=618, Total=3192 [2022-07-21 02:19:32,786 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 381 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:19:32,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 490 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 381 Unchecked, 0.3s Time] [2022-07-21 02:19:32,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-21 02:19:32,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2022-07-21 02:19:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:19:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-07-21 02:19:32,806 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 34 [2022-07-21 02:19:32,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:19:32,807 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2022-07-21 02:19:32,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 28 states have internal predecessors, (45), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:19:32,807 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-07-21 02:19:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 02:19:32,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:19:32,810 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:19:32,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 02:19:33,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-07-21 02:19:33,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-21 02:19:33,224 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:19:33,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:19:33,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1814087211, now seen corresponding path program 2 times [2022-07-21 02:19:33,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:19:33,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085555409] [2022-07-21 02:19:33,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:19:33,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:19:33,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:19:33,227 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:19:33,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 02:19:33,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:19:33,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:19:33,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 02:19:33,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:19:33,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:19:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:19:33,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:19:33,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085555409] [2022-07-21 02:19:33,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085555409] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:19:33,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:19:33,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-21 02:19:33,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165175386] [2022-07-21 02:19:33,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:19:33,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 02:19:33,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:19:33,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 02:19:33,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 02:19:33,838 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 02:19:33,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:19:33,889 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2022-07-21 02:19:33,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 02:19:33,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2022-07-21 02:19:33,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:19:33,890 INFO L225 Difference]: With dead ends: 72 [2022-07-21 02:19:33,890 INFO L226 Difference]: Without dead ends: 54 [2022-07-21 02:19:33,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-21 02:19:33,892 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 100 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:19:33,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 104 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:19:33,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-21 02:19:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-07-21 02:19:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:19:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2022-07-21 02:19:33,900 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 35 [2022-07-21 02:19:33,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:19:33,900 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-07-21 02:19:33,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 02:19:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-07-21 02:19:33,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 02:19:33,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:19:33,902 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:19:33,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-21 02:19:34,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:19:34,116 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:19:34,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:19:34,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1637752339, now seen corresponding path program 1 times [2022-07-21 02:19:34,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:19:34,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340490445] [2022-07-21 02:19:34,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:34,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:19:34,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:19:34,119 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:19:34,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 02:19:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:34,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 02:19:34,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:34,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:19:34,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:19:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:19:34,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:19:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:19:34,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:19:34,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340490445] [2022-07-21 02:19:34,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340490445] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:19:34,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:19:34,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-07-21 02:19:34,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272983109] [2022-07-21 02:19:34,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:19:34,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 02:19:34,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:19:34,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 02:19:34,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:19:34,462 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 02:19:34,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:19:34,729 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2022-07-21 02:19:34,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:19:34,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-07-21 02:19:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:19:34,730 INFO L225 Difference]: With dead ends: 83 [2022-07-21 02:19:34,730 INFO L226 Difference]: Without dead ends: 68 [2022-07-21 02:19:34,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-21 02:19:34,731 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:19:34,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 136 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 02:19:34,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-21 02:19:34,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2022-07-21 02:19:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:19:34,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-07-21 02:19:34,742 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 36 [2022-07-21 02:19:34,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:19:34,742 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-07-21 02:19:34,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-21 02:19:34,743 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-07-21 02:19:34,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 02:19:34,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:19:34,744 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:19:34,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-21 02:19:34,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:19:34,956 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:19:34,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:19:34,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1695010641, now seen corresponding path program 1 times [2022-07-21 02:19:34,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:19:34,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959584296] [2022-07-21 02:19:34,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:34,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:19:34,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:19:34,958 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:19:34,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-21 02:19:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:35,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 02:19:35,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:35,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:19:35,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-21 02:19:35,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:35,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-21 02:19:35,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 02:19:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:19:35,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:19:35,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:19:35,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959584296] [2022-07-21 02:19:35,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959584296] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:19:35,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [74150704] [2022-07-21 02:19:35,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:35,694 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 02:19:35,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 02:19:35,696 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 02:19:35,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-07-21 02:19:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:35,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 02:19:35,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:36,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-21 02:19:36,400 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:19:36,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-07-21 02:19:36,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 02:19:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:19:36,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:19:36,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [74150704] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:19:36,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:19:36,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2022-07-21 02:19:36,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249958541] [2022-07-21 02:19:36,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:19:36,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 02:19:36,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:19:36,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 02:19:36,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=505, Unknown=9, NotChecked=0, Total=600 [2022-07-21 02:19:36,640 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 18 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 02:19:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:19:37,226 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2022-07-21 02:19:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 02:19:37,226 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 18 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2022-07-21 02:19:37,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:19:37,227 INFO L225 Difference]: With dead ends: 68 [2022-07-21 02:19:37,227 INFO L226 Difference]: Without dead ends: 52 [2022-07-21 02:19:37,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=680, Unknown=10, NotChecked=0, Total=812 [2022-07-21 02:19:37,228 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 02:19:37,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 373 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 38 Unchecked, 0.5s Time] [2022-07-21 02:19:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-21 02:19:37,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-21 02:19:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:19:37,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-07-21 02:19:37,236 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 36 [2022-07-21 02:19:37,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:19:37,236 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-07-21 02:19:37,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 18 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 02:19:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-07-21 02:19:37,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 02:19:37,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:19:37,238 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:19:37,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 02:19:37,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-07-21 02:19:37,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-21 02:19:37,651 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:19:37,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:19:37,652 INFO L85 PathProgramCache]: Analyzing trace with hash 108256579, now seen corresponding path program 1 times [2022-07-21 02:19:37,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:19:37,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107612254] [2022-07-21 02:19:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:37,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:19:37,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:19:37,654 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:19:37,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 02:19:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:37,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:19:37,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:37,893 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 02:19:37,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:19:37,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:19:37,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107612254] [2022-07-21 02:19:37,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107612254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:19:37,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:19:37,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 02:19:37,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217532623] [2022-07-21 02:19:37,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:19:37,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:19:37,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:19:37,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:19:37,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:19:37,896 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 02:19:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:19:37,975 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-07-21 02:19:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:19:37,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2022-07-21 02:19:37,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:19:37,976 INFO L225 Difference]: With dead ends: 69 [2022-07-21 02:19:37,976 INFO L226 Difference]: Without dead ends: 56 [2022-07-21 02:19:37,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 02:19:37,977 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 39 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:19:37,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 99 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:19:37,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-21 02:19:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-07-21 02:19:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:19:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-07-21 02:19:37,986 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 38 [2022-07-21 02:19:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:19:37,986 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-07-21 02:19:37,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 02:19:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-07-21 02:19:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 02:19:37,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:19:37,987 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:19:37,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 02:19:38,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:19:38,195 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:19:38,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:19:38,196 INFO L85 PathProgramCache]: Analyzing trace with hash 108212869, now seen corresponding path program 1 times [2022-07-21 02:19:38,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:19:38,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362178587] [2022-07-21 02:19:38,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:38,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:19:38,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:19:38,197 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:19:38,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 02:19:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:38,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-21 02:19:38,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:38,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:19:38,753 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:19:38,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2022-07-21 02:19:38,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:19:38,890 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:19:38,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-07-21 02:19:38,998 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:19:38,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 26 [2022-07-21 02:19:39,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-21 02:19:39,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:19:39,268 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-21 02:19:39,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 51 [2022-07-21 02:19:39,293 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-21 02:19:39,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-07-21 02:19:39,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-21 02:19:39,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:19:39,856 INFO L356 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2022-07-21 02:19:39,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 90 [2022-07-21 02:19:39,911 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-21 02:19:39,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 154 [2022-07-21 02:19:39,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:39,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 35 [2022-07-21 02:19:39,963 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-21 02:19:39,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 106 [2022-07-21 02:19:40,005 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-07-21 02:19:40,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 120 [2022-07-21 02:19:40,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2022-07-21 02:19:40,480 INFO L356 Elim1Store]: treesize reduction 20, result has 45.9 percent of original size [2022-07-21 02:19:40,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 76 [2022-07-21 02:19:40,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2022-07-21 02:19:40,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:19:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:19:40,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:19:40,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_790)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_795))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_793))) (select (select .cse1 .cse2) .cse3)) (bvadd (_ bv4 32) (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2022-07-21 02:19:41,159 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_790)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_795))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_788))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_793))) (select (select .cse1 .cse2) .cse3)) (bvadd (_ bv4 32) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-07-21 02:19:44,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_790)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_795))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_788))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_793))) (select (select .cse2 .cse3) .cse4)) (bvadd (select (select .cse5 .cse3) .cse4) (_ bv4 32)))))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2022-07-21 02:19:51,121 WARN L233 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 66 DAG size of output: 58 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-21 02:19:51,121 INFO L356 Elim1Store]: treesize reduction 60, result has 76.7 percent of original size [2022-07-21 02:19:51,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1198366 treesize of output 1127691 [2022-07-21 02:19:52,281 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:19:52,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1127454 treesize of output 1045542 [2022-07-21 02:19:55,023 INFO L244 Elim1Store]: Index analysis took 1398 ms [2022-07-21 02:20:30,450 WARN L233 SmtUtils]: Spent 35.42s on a formula simplification. DAG size of input: 285 DAG size of output: 217 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-21 02:20:30,451 INFO L356 Elim1Store]: treesize reduction 2668, result has 67.6 percent of original size [2022-07-21 02:20:30,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 11570598 treesize of output 10322792 [2022-07-21 02:20:35,647 INFO L244 Elim1Store]: Index analysis took 613 ms [2022-07-21 02:20:46,257 WARN L233 SmtUtils]: Spent 10.60s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-21 02:20:46,258 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:20:46,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 11879549 treesize of output 11510499 [2022-07-21 02:20:57,927 WARN L233 SmtUtils]: Spent 11.66s on a formula simplification. DAG size of input: 2958 DAG size of output: 2956 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 02:21:03,829 WARN L233 SmtUtils]: Spent 5.88s on a formula simplification that was a NOOP. DAG size: 2950 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 02:21:05,069 INFO L244 Elim1Store]: Index analysis took 764 ms [2022-07-21 02:21:15,085 WARN L233 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-21 02:21:15,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:21:15,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 11507338 treesize of output 11236188 [2022-07-21 02:21:21,058 WARN L233 SmtUtils]: Spent 5.97s on a formula simplification that was a NOOP. DAG size: 3021 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 02:21:26,926 WARN L233 SmtUtils]: Spent 5.86s on a formula simplification that was a NOOP. DAG size: 3012 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 02:21:49,810 INFO L244 Elim1Store]: Index analysis took 20777 ms