./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 64bit --witnessprinter.graph.data.programhash f91d2143e2aa98b5d48c7de2c4b17a3507ecfb748f26bae9be6d0588f4557bb1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 04:32:25,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:32:25,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-09 04:32:25,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:32:25,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:32:25,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:32:25,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:32:25,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:32:25,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 04:32:25,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 04:32:25,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:32:25,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:32:25,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 04:32:25,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 04:32:25,656 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 04:32:25,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:32:25,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:32:25,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:32:25,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:32:25,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:32:25,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:32:25,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:32:25,659 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:32:25,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:32:25,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:32:25,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:32:25,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 04:32:25,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:32:25,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:32:25,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 04:32:25,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:32:25,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:32:25,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:32:25,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 04:32:25,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:32:25,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:32:25,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 04:32:25,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 04:32:25,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:32:25,663 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f91d2143e2aa98b5d48c7de2c4b17a3507ecfb748f26bae9be6d0588f4557bb1 [2024-11-09 04:32:25,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:32:25,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:32:25,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:32:25,911 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:32:25,911 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:32:25,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2024-11-09 04:32:27,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:32:27,596 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:32:27,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2024-11-09 04:32:27,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8792c9a23/7606ba63442440dba49b01644c4ba02a/FLAGb1bd7fe14 [2024-11-09 04:32:27,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8792c9a23/7606ba63442440dba49b01644c4ba02a [2024-11-09 04:32:27,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:32:27,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:32:27,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:32:27,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:32:27,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:32:27,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:32:27" (1/1) ... [2024-11-09 04:32:27,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30187751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:27, skipping insertion in model container [2024-11-09 04:32:27,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:32:27" (1/1) ... [2024-11-09 04:32:27,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:32:28,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2024-11-09 04:32:28,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:32:28,483 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:32:28,618 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6057] [2024-11-09 04:32:28,620 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6060] [2024-11-09 04:32:28,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6063] [2024-11-09 04:32:28,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6066] [2024-11-09 04:32:28,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6069] [2024-11-09 04:32:28,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2024-11-09 04:32:28,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:32:28,679 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:32:28,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:28 WrapperNode [2024-11-09 04:32:28,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:32:28,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:32:28,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:32:28,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:32:28,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:28" (1/1) ... [2024-11-09 04:32:28,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:28" (1/1) ... [2024-11-09 04:32:28,754 INFO L138 Inliner]: procedures = 69, calls = 171, calls flagged for inlining = 23, calls inlined = 16, statements flattened = 366 [2024-11-09 04:32:28,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:32:28,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:32:28,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:32:28,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:32:28,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:28" (1/1) ... [2024-11-09 04:32:28,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:28" (1/1) ... [2024-11-09 04:32:28,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:28" (1/1) ... [2024-11-09 04:32:28,813 INFO L175 MemorySlicer]: Split 100 memory accesses to 7 slices as follows [2, 1, 3, 9, 78, 3, 4]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 0, 4, 0, 3, 0]. The 81 writes are split as follows [0, 1, 0, 0, 78, 0, 2]. [2024-11-09 04:32:28,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:28" (1/1) ... [2024-11-09 04:32:28,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:28" (1/1) ... [2024-11-09 04:32:28,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:28" (1/1) ... [2024-11-09 04:32:28,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:28" (1/1) ... [2024-11-09 04:32:28,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:28" (1/1) ... [2024-11-09 04:32:28,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:28" (1/1) ... [2024-11-09 04:32:28,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:32:28,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:32:28,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:32:28,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:32:28,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:28" (1/1) ... [2024-11-09 04:32:28,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 04:32:28,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:32:28,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 04:32:28,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 04:32:28,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:32:28,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-09 04:32:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-09 04:32:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-09 04:32:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-09 04:32:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-09 04:32:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-09 04:32:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-09 04:32:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:32:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-11-09 04:32:28,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-11-09 04:32:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 04:32:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 04:32:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 04:32:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 04:32:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 04:32:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 04:32:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 04:32:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-09 04:32:28,942 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-09 04:32:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 04:32:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 04:32:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 04:32:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 04:32:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 04:32:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-09 04:32:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-09 04:32:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2024-11-09 04:32:28,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2024-11-09 04:32:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:32:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 04:32:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 04:32:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 04:32:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-09 04:32:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-09 04:32:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-09 04:32:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-09 04:32:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-11-09 04:32:28,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-11-09 04:32:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2024-11-09 04:32:28,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2024-11-09 04:32:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 04:32:28,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 04:32:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 04:32:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 04:32:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 04:32:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 04:32:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 04:32:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 04:32:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 04:32:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:32:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:32:28,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:32:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2024-11-09 04:32:28,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2024-11-09 04:32:29,148 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:32:29,150 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:32:29,170 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-11-09 04:32:34,144 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-11-09 04:32:34,145 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:32:34,159 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:32:34,160 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:32:34,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:32:34 BoogieIcfgContainer [2024-11-09 04:32:34,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:32:34,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:32:34,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:32:34,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:32:34,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:32:27" (1/3) ... [2024-11-09 04:32:34,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b4f3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:32:34, skipping insertion in model container [2024-11-09 04:32:34,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:32:28" (2/3) ... [2024-11-09 04:32:34,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b4f3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:32:34, skipping insertion in model container [2024-11-09 04:32:34,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:32:34" (3/3) ... [2024-11-09 04:32:34,169 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2024-11-09 04:32:34,182 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:32:34,182 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:32:34,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:32:34,243 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@298d9f2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:32:34,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:32:34,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 78 states have internal predecessors, (100), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 04:32:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 04:32:34,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:34,255 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:34,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:34,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:34,262 INFO L85 PathProgramCache]: Analyzing trace with hash 245989502, now seen corresponding path program 1 times [2024-11-09 04:32:34,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:32:34,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235412255] [2024-11-09 04:32:34,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:34,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:35,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:32:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:35,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:32:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:35,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:32:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:35,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 04:32:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:35,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:32:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:35,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:32:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:35,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 04:32:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:35,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 04:32:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 04:32:35,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:32:35,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235412255] [2024-11-09 04:32:35,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235412255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:35,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:35,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:32:35,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249319351] [2024-11-09 04:32:35,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:35,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:32:35,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:32:35,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:32:35,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:32:35,594 INFO L87 Difference]: Start difference. First operand has 92 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 78 states have internal predecessors, (100), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:32:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:36,032 INFO L93 Difference]: Finished difference Result 183 states and 247 transitions. [2024-11-09 04:32:36,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:32:36,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2024-11-09 04:32:36,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:36,045 INFO L225 Difference]: With dead ends: 183 [2024-11-09 04:32:36,045 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 04:32:36,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:32:36,054 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 66 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:36,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 235 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:32:36,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 04:32:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-11-09 04:32:36,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.328358208955224) internal successors, (89), 68 states have internal predecessors, (89), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 04:32:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2024-11-09 04:32:36,101 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 61 [2024-11-09 04:32:36,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:36,104 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2024-11-09 04:32:36,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:32:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2024-11-09 04:32:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 04:32:36,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:36,108 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:36,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:32:36,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:36,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1815893242, now seen corresponding path program 1 times [2024-11-09 04:32:36,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:32:36,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23047616] [2024-11-09 04:32:36,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:36,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:36,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:32:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:36,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:32:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:36,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:32:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:36,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 04:32:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:36,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:32:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:36,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:32:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:36,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 04:32:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:36,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 04:32:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 04:32:36,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:32:36,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23047616] [2024-11-09 04:32:36,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23047616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:36,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:36,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:32:36,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302317683] [2024-11-09 04:32:36,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:36,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:36,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:32:36,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:36,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:36,942 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 04:32:40,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:32:44,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:32:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:45,894 INFO L93 Difference]: Finished difference Result 182 states and 246 transitions. [2024-11-09 04:32:45,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:32:45,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2024-11-09 04:32:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:45,897 INFO L225 Difference]: With dead ends: 182 [2024-11-09 04:32:45,897 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 04:32:45,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:32:45,898 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 112 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:45,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 331 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 117 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-09 04:32:45,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 04:32:45,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2024-11-09 04:32:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 107 states have internal predecessors, (145), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 04:32:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 163 transitions. [2024-11-09 04:32:45,916 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 163 transitions. Word has length 61 [2024-11-09 04:32:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:45,916 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 163 transitions. [2024-11-09 04:32:45,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 04:32:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 163 transitions. [2024-11-09 04:32:45,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 04:32:45,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:45,918 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:45,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:32:45,918 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:45,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:45,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1948637714, now seen corresponding path program 1 times [2024-11-09 04:32:45,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:32:45,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907305570] [2024-11-09 04:32:45,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:45,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:46,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:32:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:46,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:32:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:46,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:32:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:46,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 04:32:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:46,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:32:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:46,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:32:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:46,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 04:32:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:46,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 04:32:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 04:32:46,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:32:46,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907305570] [2024-11-09 04:32:46,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907305570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:46,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:46,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:32:46,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166429472] [2024-11-09 04:32:46,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:46,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:46,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:32:46,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:46,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:46,612 INFO L87 Difference]: Start difference. First operand 123 states and 163 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 04:32:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:47,435 INFO L93 Difference]: Finished difference Result 137 states and 177 transitions. [2024-11-09 04:32:47,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:32:47,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2024-11-09 04:32:47,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:47,438 INFO L225 Difference]: With dead ends: 137 [2024-11-09 04:32:47,438 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 04:32:47,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-09 04:32:47,444 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 156 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:47,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 218 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 04:32:47,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 04:32:47,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2024-11-09 04:32:47,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 107 states have internal predecessors, (144), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 04:32:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 162 transitions. [2024-11-09 04:32:47,455 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 162 transitions. Word has length 64 [2024-11-09 04:32:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:47,455 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 162 transitions. [2024-11-09 04:32:47,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 04:32:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 162 transitions. [2024-11-09 04:32:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 04:32:47,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:47,457 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:47,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 04:32:47,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:47,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2005896016, now seen corresponding path program 1 times [2024-11-09 04:32:47,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:32:47,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723075866] [2024-11-09 04:32:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:47,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:32:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:48,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:32:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:48,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:32:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:48,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 04:32:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:48,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:32:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:48,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:32:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:48,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 04:32:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:48,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 04:32:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 04:32:48,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:32:48,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723075866] [2024-11-09 04:32:48,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723075866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:48,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:48,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:32:48,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849845229] [2024-11-09 04:32:48,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:48,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:48,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:32:48,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:48,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:48,171 INFO L87 Difference]: Start difference. First operand 123 states and 162 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:32:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:48,889 INFO L93 Difference]: Finished difference Result 310 states and 425 transitions. [2024-11-09 04:32:48,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:32:48,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 64 [2024-11-09 04:32:48,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:48,891 INFO L225 Difference]: With dead ends: 310 [2024-11-09 04:32:48,891 INFO L226 Difference]: Without dead ends: 213 [2024-11-09 04:32:48,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-09 04:32:48,892 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 155 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:48,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 268 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 04:32:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-09 04:32:48,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2024-11-09 04:32:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 184 states have (on average 1.3858695652173914) internal successors, (255), 185 states have internal predecessors, (255), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 04:32:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 277 transitions. [2024-11-09 04:32:48,912 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 277 transitions. Word has length 64 [2024-11-09 04:32:48,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:48,912 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 277 transitions. [2024-11-09 04:32:48,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:32:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 277 transitions. [2024-11-09 04:32:48,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 04:32:48,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:48,914 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:48,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 04:32:48,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:48,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:48,915 INFO L85 PathProgramCache]: Analyzing trace with hash -933583417, now seen corresponding path program 1 times [2024-11-09 04:32:48,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:32:48,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803216820] [2024-11-09 04:32:48,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:48,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:49,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:32:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:49,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:32:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:49,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:32:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:49,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 04:32:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:49,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:32:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:49,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:32:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:49,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 04:32:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:49,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 04:32:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 04:32:49,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:32:49,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803216820] [2024-11-09 04:32:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803216820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:32:49,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:32:49,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:32:49,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751762837] [2024-11-09 04:32:49,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:32:49,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:32:49,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:32:49,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:32:49,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:32:49,627 INFO L87 Difference]: Start difference. First operand 205 states and 277 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 04:32:53,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:32:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:32:54,464 INFO L93 Difference]: Finished difference Result 451 states and 621 transitions. [2024-11-09 04:32:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:32:54,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 70 [2024-11-09 04:32:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:32:54,466 INFO L225 Difference]: With dead ends: 451 [2024-11-09 04:32:54,466 INFO L226 Difference]: Without dead ends: 276 [2024-11-09 04:32:54,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-09 04:32:54,468 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 98 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:32:54,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 365 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-09 04:32:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-09 04:32:54,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 265. [2024-11-09 04:32:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 244 states have (on average 1.389344262295082) internal successors, (339), 245 states have internal predecessors, (339), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 04:32:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 361 transitions. [2024-11-09 04:32:54,485 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 361 transitions. Word has length 70 [2024-11-09 04:32:54,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:32:54,486 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 361 transitions. [2024-11-09 04:32:54,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 04:32:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 361 transitions. [2024-11-09 04:32:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 04:32:54,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:32:54,487 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-11-09 04:32:54,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 04:32:54,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:32:54,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:32:54,488 INFO L85 PathProgramCache]: Analyzing trace with hash 213591439, now seen corresponding path program 1 times [2024-11-09 04:32:54,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:32:54,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653254147] [2024-11-09 04:32:54,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:54,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:32:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:55,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:32:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:55,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:32:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:55,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:32:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:55,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 04:32:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:55,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:32:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:55,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:32:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:55,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 04:32:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:55,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 04:32:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:32:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 04:32:55,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:32:55,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653254147] [2024-11-09 04:32:55,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653254147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:32:55,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842062598] [2024-11-09 04:32:55,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:32:55,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:55,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:32:55,677 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) [2024-11-09 04:32:55,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:33:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:11,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 04:33:11,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:33:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 04:33:11,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:33:11,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842062598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:11,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:33:11,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-09 04:33:11,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259055387] [2024-11-09 04:33:11,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:11,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:33:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:33:11,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:33:11,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:11,906 INFO L87 Difference]: Start difference. First operand 265 states and 361 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:33:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:11,984 INFO L93 Difference]: Finished difference Result 512 states and 704 transitions. [2024-11-09 04:33:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:33:11,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 81 [2024-11-09 04:33:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:11,988 INFO L225 Difference]: With dead ends: 512 [2024-11-09 04:33:11,988 INFO L226 Difference]: Without dead ends: 266 [2024-11-09 04:33:11,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:33:11,991 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:11,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:33:11,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-09 04:33:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-11-09 04:33:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 245 states have (on average 1.3877551020408163) internal successors, (340), 246 states have internal predecessors, (340), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 04:33:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 362 transitions. [2024-11-09 04:33:12,017 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 362 transitions. Word has length 81 [2024-11-09 04:33:12,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:12,017 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 362 transitions. [2024-11-09 04:33:12,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:33:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 362 transitions. [2024-11-09 04:33:12,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 04:33:12,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:12,019 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-11-09 04:33:12,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 04:33:12,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 04:33:12,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:33:12,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:12,221 INFO L85 PathProgramCache]: Analyzing trace with hash 380634059, now seen corresponding path program 1 times [2024-11-09 04:33:12,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:33:12,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469708318] [2024-11-09 04:33:12,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:12,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:13,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:33:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:13,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:33:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:13,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:33:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:13,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 04:33:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:13,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:33:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:13,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:33:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:13,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 04:33:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:13,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 04:33:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 04:33:13,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:33:13,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469708318] [2024-11-09 04:33:13,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469708318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:33:13,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549296021] [2024-11-09 04:33:13,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:13,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:33:13,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:33:13,620 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) [2024-11-09 04:33:13,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:33:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:15,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 1391 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 04:33:15,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:33:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 04:33:16,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:33:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 04:33:16,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549296021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:33:16,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:33:16,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 14 [2024-11-09 04:33:16,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628325237] [2024-11-09 04:33:16,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:33:16,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 04:33:16,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:33:16,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 04:33:16,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:33:16,756 INFO L87 Difference]: Start difference. First operand 266 states and 362 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 04:33:20,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:33:22,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:22,798 INFO L93 Difference]: Finished difference Result 519 states and 714 transitions. [2024-11-09 04:33:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 04:33:22,801 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2024-11-09 04:33:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:22,802 INFO L225 Difference]: With dead ends: 519 [2024-11-09 04:33:22,802 INFO L226 Difference]: Without dead ends: 269 [2024-11-09 04:33:22,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2024-11-09 04:33:22,804 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 47 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:22,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 562 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 208 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2024-11-09 04:33:22,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-09 04:33:22,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-09 04:33:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 248 states have (on average 1.3830645161290323) internal successors, (343), 249 states have internal predecessors, (343), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 04:33:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 365 transitions. [2024-11-09 04:33:22,822 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 365 transitions. Word has length 83 [2024-11-09 04:33:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:22,822 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 365 transitions. [2024-11-09 04:33:22,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 04:33:22,823 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 365 transitions. [2024-11-09 04:33:22,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 04:33:22,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:22,824 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-11-09 04:33:22,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 04:33:23,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 04:33:23,025 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:33:23,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:23,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1160672399, now seen corresponding path program 2 times [2024-11-09 04:33:23,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:33:23,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563080704] [2024-11-09 04:33:23,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:23,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:24,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:33:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:24,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:33:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:24,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:33:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:24,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 04:33:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:24,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:33:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:24,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:33:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:24,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 04:33:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:24,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 04:33:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 04:33:24,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:33:24,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563080704] [2024-11-09 04:33:24,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563080704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:24,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:24,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 04:33:24,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749835679] [2024-11-09 04:33:24,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:24,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:33:24,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:33:24,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:33:24,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:33:24,706 INFO L87 Difference]: Start difference. First operand 269 states and 365 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 04:33:25,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:25,822 INFO L93 Difference]: Finished difference Result 510 states and 701 transitions. [2024-11-09 04:33:25,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:33:25,823 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 89 [2024-11-09 04:33:25,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:25,824 INFO L225 Difference]: With dead ends: 510 [2024-11-09 04:33:25,824 INFO L226 Difference]: Without dead ends: 275 [2024-11-09 04:33:25,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:33:25,825 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 54 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:25,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 404 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 04:33:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-09 04:33:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-11-09 04:33:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 254 states have (on average 1.3661417322834646) internal successors, (347), 255 states have internal predecessors, (347), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 04:33:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 369 transitions. [2024-11-09 04:33:25,842 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 369 transitions. Word has length 89 [2024-11-09 04:33:25,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:25,842 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 369 transitions. [2024-11-09 04:33:25,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 04:33:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 369 transitions. [2024-11-09 04:33:25,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 04:33:25,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:25,843 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-11-09 04:33:25,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 04:33:25,843 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:33:25,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:25,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1840730769, now seen corresponding path program 1 times [2024-11-09 04:33:25,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:33:25,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529085261] [2024-11-09 04:33:25,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:25,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:26,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:33:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:26,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:33:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:26,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:33:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:26,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 04:33:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:26,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:33:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:26,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:33:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:26,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 04:33:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:26,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 04:33:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-09 04:33:26,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:33:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529085261] [2024-11-09 04:33:26,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529085261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:33:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226864898] [2024-11-09 04:33:26,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:26,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:33:26,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:33:26,652 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) [2024-11-09 04:33:26,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 04:33:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:27,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 1482 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 04:33:27,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:33:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 04:33:27,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:33:27,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226864898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:27,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:33:27,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-09 04:33:27,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233605766] [2024-11-09 04:33:27,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:27,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:33:27,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:33:27,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:33:27,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:33:27,510 INFO L87 Difference]: Start difference. First operand 275 states and 369 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 04:33:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:27,550 INFO L93 Difference]: Finished difference Result 503 states and 688 transitions. [2024-11-09 04:33:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:33:27,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 89 [2024-11-09 04:33:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:27,553 INFO L225 Difference]: With dead ends: 503 [2024-11-09 04:33:27,554 INFO L226 Difference]: Without dead ends: 262 [2024-11-09 04:33:27,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:33:27,556 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:27,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:33:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-09 04:33:27,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-11-09 04:33:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 245 states have (on average 1.363265306122449) internal successors, (334), 246 states have internal predecessors, (334), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 04:33:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 352 transitions. [2024-11-09 04:33:27,567 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 352 transitions. Word has length 89 [2024-11-09 04:33:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:27,567 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 352 transitions. [2024-11-09 04:33:27,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 04:33:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 352 transitions. [2024-11-09 04:33:27,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 04:33:27,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:27,568 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-11-09 04:33:27,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 04:33:27,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:33:27,769 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:33:27,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:27,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1835436395, now seen corresponding path program 1 times [2024-11-09 04:33:27,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:33:27,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375226109] [2024-11-09 04:33:27,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:27,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:28,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:33:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:28,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:33:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:28,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:33:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:28,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 04:33:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:28,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:33:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:28,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:33:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:28,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 04:33:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:28,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 04:33:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 04:33:28,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:33:28,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375226109] [2024-11-09 04:33:28,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375226109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:28,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:28,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 04:33:28,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919856035] [2024-11-09 04:33:28,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:28,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:33:28,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:33:28,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:33:28,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:33:28,771 INFO L87 Difference]: Start difference. First operand 262 states and 352 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:33:32,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:33:34,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:34,060 INFO L93 Difference]: Finished difference Result 393 states and 533 transitions. [2024-11-09 04:33:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:33:34,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 91 [2024-11-09 04:33:34,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:34,063 INFO L225 Difference]: With dead ends: 393 [2024-11-09 04:33:34,063 INFO L226 Difference]: Without dead ends: 390 [2024-11-09 04:33:34,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-09 04:33:34,065 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 177 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:34,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 475 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 112 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2024-11-09 04:33:34,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-09 04:33:34,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 383. [2024-11-09 04:33:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 362 states have (on average 1.3784530386740332) internal successors, (499), 363 states have internal predecessors, (499), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-09 04:33:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 523 transitions. [2024-11-09 04:33:34,079 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 523 transitions. Word has length 91 [2024-11-09 04:33:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:34,079 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 523 transitions. [2024-11-09 04:33:34,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 04:33:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 523 transitions. [2024-11-09 04:33:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 04:33:34,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:34,081 INFO L215 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-11-09 04:33:34,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 04:33:34,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:33:34,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1410908753, now seen corresponding path program 1 times [2024-11-09 04:33:34,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:33:34,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364689834] [2024-11-09 04:33:34,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:34,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:34,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:33:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:34,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:33:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:34,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:33:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:34,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 04:33:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:34,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:33:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:34,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:33:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:34,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 04:33:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:34,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 04:33:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 04:33:34,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:33:34,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364689834] [2024-11-09 04:33:34,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364689834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:34,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:33:34,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:33:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176602832] [2024-11-09 04:33:34,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:34,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:33:34,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:33:34,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:33:34,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:33:34,773 INFO L87 Difference]: Start difference. First operand 383 states and 523 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 04:33:38,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 04:33:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:39,579 INFO L93 Difference]: Finished difference Result 635 states and 874 transitions. [2024-11-09 04:33:39,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:33:39,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 98 [2024-11-09 04:33:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:39,583 INFO L225 Difference]: With dead ends: 635 [2024-11-09 04:33:39,583 INFO L226 Difference]: Without dead ends: 383 [2024-11-09 04:33:39,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:33:39,585 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 37 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:39,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 339 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-11-09 04:33:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-09 04:33:39,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2024-11-09 04:33:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 362 states have (on average 1.367403314917127) internal successors, (495), 363 states have internal predecessors, (495), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-09 04:33:39,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 519 transitions. [2024-11-09 04:33:39,603 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 519 transitions. Word has length 98 [2024-11-09 04:33:39,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:39,603 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 519 transitions. [2024-11-09 04:33:39,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 04:33:39,604 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 519 transitions. [2024-11-09 04:33:39,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 04:33:39,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:39,605 INFO L215 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-11-09 04:33:39,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 04:33:39,605 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:33:39,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:39,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1862990189, now seen corresponding path program 1 times [2024-11-09 04:33:39,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:33:39,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612275277] [2024-11-09 04:33:39,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:39,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:40,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:33:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:41,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:33:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:41,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:33:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:41,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 04:33:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:41,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:33:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:41,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:33:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:41,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 04:33:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:41,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 04:33:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-09 04:33:41,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:33:41,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612275277] [2024-11-09 04:33:41,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612275277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:33:41,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446553786] [2024-11-09 04:33:41,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:41,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:33:41,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:33:41,173 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) [2024-11-09 04:33:41,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 04:33:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:42,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 04:33:42,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:33:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 04:33:42,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:33:42,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446553786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:33:42,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:33:42,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-09 04:33:42,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967301846] [2024-11-09 04:33:42,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:33:42,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:33:42,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:33:42,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:33:42,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:33:42,460 INFO L87 Difference]: Start difference. First operand 383 states and 519 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 04:33:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:33:42,603 INFO L93 Difference]: Finished difference Result 635 states and 866 transitions. [2024-11-09 04:33:42,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:33:42,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 98 [2024-11-09 04:33:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:33:42,609 INFO L225 Difference]: With dead ends: 635 [2024-11-09 04:33:42,609 INFO L226 Difference]: Without dead ends: 383 [2024-11-09 04:33:42,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:33:42,611 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:33:42,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 404 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:33:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-09 04:33:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2024-11-09 04:33:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 362 states have (on average 1.356353591160221) internal successors, (491), 363 states have internal predecessors, (491), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-09 04:33:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 515 transitions. [2024-11-09 04:33:42,626 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 515 transitions. Word has length 98 [2024-11-09 04:33:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:33:42,626 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 515 transitions. [2024-11-09 04:33:42,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 04:33:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 515 transitions. [2024-11-09 04:33:42,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 04:33:42,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:33:42,628 INFO L215 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:33:42,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 04:33:42,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:33:42,829 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:33:42,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:33:42,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1477146873, now seen corresponding path program 1 times [2024-11-09 04:33:42,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:33:42,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306454519] [2024-11-09 04:33:42,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:42,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:33:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:46,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:33:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:46,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:33:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:46,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:33:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 04:33:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:33:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 04:33:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:46,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 04:33:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:46,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 04:33:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:48,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 04:33:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:33:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 04:33:48,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:33:48,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306454519] [2024-11-09 04:33:48,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306454519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:33:48,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084117666] [2024-11-09 04:33:48,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:33:48,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:33:48,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:33:48,543 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) [2024-11-09 04:33:48,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process