./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 15:21:31,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 15:21:31,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 15:21:31,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 15:21:31,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 15:21:31,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 15:21:31,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 15:21:31,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 15:21:31,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 15:21:31,342 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 15:21:31,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 15:21:31,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 15:21:31,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 15:21:31,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 15:21:31,344 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 15:21:31,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 15:21:31,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 15:21:31,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 15:21:31,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 15:21:31,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 15:21:31,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 15:21:31,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 15:21:31,348 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 15:21:31,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 15:21:31,348 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 15:21:31,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 15:21:31,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 15:21:31,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 15:21:31,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 15:21:31,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:21:31,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 15:21:31,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 15:21:31,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 15:21:31,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 15:21:31,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 15:21:31,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 15:21:31,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 15:21:31,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 15:21:31,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 15:21:31,356 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-clean/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-clean/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 -> 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 [2024-10-11 15:21:31,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 15:21:31,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 15:21:31,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 15:21:31,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 15:21:31,655 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 15:21:31,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2024-10-11 15:21:33,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 15:21:33,487 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 15:21:33,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2024-10-11 15:21:33,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d377ce7f0/bdf6551c30f248c2b9e0dd6157aa8c54/FLAG5bc463336 [2024-10-11 15:21:33,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d377ce7f0/bdf6551c30f248c2b9e0dd6157aa8c54 [2024-10-11 15:21:33,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 15:21:33,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 15:21:33,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 15:21:33,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 15:21:33,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 15:21:33,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:21:33" (1/1) ... [2024-10-11 15:21:33,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da39435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:33, skipping insertion in model container [2024-10-11 15:21:33,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:21:33" (1/1) ... [2024-10-11 15:21:33,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:21:34,345 WARN L248 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-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2024-10-11 15:21:34,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:21:34,684 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 15:21:34,795 WARN L248 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-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2024-10-11 15:21:34,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:21:34,991 INFO L204 MainTranslator]: Completed translation [2024-10-11 15:21:34,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:34 WrapperNode [2024-10-11 15:21:34,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 15:21:34,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 15:21:34,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 15:21:34,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 15:21:34,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:34" (1/1) ... [2024-10-11 15:21:35,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:34" (1/1) ... [2024-10-11 15:21:35,101 INFO L138 Inliner]: procedures = 102, calls = 322, calls flagged for inlining = 36, calls inlined = 33, statements flattened = 1053 [2024-10-11 15:21:35,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 15:21:35,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 15:21:35,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 15:21:35,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 15:21:35,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:34" (1/1) ... [2024-10-11 15:21:35,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:34" (1/1) ... [2024-10-11 15:21:35,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:34" (1/1) ... [2024-10-11 15:21:35,224 INFO L175 MemorySlicer]: Split 165 memory accesses to 10 slices as follows [17, 2, 42, 3, 79, 2, 3, 2, 14, 1]. 48 percent of accesses are in the largest equivalence class. The 63 initializations are split as follows [17, 2, 42, 0, 2, 0, 0, 0, 0, 0]. The 38 writes are split as follows [0, 0, 0, 1, 19, 1, 2, 0, 14, 1]. [2024-10-11 15:21:35,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:34" (1/1) ... [2024-10-11 15:21:35,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:34" (1/1) ... [2024-10-11 15:21:35,263 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:34" (1/1) ... [2024-10-11 15:21:35,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:34" (1/1) ... [2024-10-11 15:21:35,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:34" (1/1) ... [2024-10-11 15:21:35,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:34" (1/1) ... [2024-10-11 15:21:35,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 15:21:35,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 15:21:35,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 15:21:35,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 15:21:35,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:34" (1/1) ... [2024-10-11 15:21:35,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:21:35,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:21:35,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 15:21:35,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 15:21:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-11 15:21:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-11 15:21:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-11 15:21:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-11 15:21:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-11 15:21:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-11 15:21:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-11 15:21:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-11 15:21:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-11 15:21:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-10-11 15:21:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-11 15:21:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-11 15:21:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-11 15:21:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-11 15:21:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-11 15:21:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-11 15:21:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-11 15:21:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-11 15:21:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2024-10-11 15:21:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2024-10-11 15:21:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-11 15:21:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-11 15:21:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-11 15:21:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-11 15:21:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-11 15:21:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-11 15:21:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-11 15:21:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-11 15:21:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-10-11 15:21:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-10-11 15:21:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2024-10-11 15:21:35,434 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2024-10-11 15:21:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-11 15:21:35,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-11 15:21:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 15:21:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 15:21:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 15:21:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 15:21:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 15:21:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 15:21:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 15:21:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 15:21:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 15:21:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 15:21:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_tx_fixup [2024-10-11 15:21:35,437 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_tx_fixup [2024-10-11 15:21:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2024-10-11 15:21:35,437 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2024-10-11 15:21:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-10-11 15:21:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-10-11 15:21:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2024-10-11 15:21:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2024-10-11 15:21:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2024-10-11 15:21:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2024-10-11 15:21:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2024-10-11 15:21:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2024-10-11 15:21:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2024-10-11 15:21:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2024-10-11 15:21:35,438 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-10-11 15:21:35,438 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-10-11 15:21:35,438 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2024-10-11 15:21:35,439 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2024-10-11 15:21:35,439 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2024-10-11 15:21:35,439 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2024-10-11 15:21:35,439 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2024-10-11 15:21:35,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2024-10-11 15:21:35,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2024-10-11 15:21:35,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2024-10-11 15:21:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-10-11 15:21:35,441 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-10-11 15:21:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 15:21:35,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 15:21:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_rx_fixup [2024-10-11 15:21:35,441 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_rx_fixup [2024-10-11 15:21:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2024-10-11 15:21:35,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2024-10-11 15:21:35,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2024-10-11 15:21:35,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2024-10-11 15:21:35,442 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-11 15:21:35,442 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-11 15:21:35,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 15:21:35,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 15:21:35,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 15:21:35,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 15:21:35,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 15:21:35,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 15:21:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 15:21:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 15:21:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 15:21:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 15:21:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-11 15:21:35,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-11 15:21:35,443 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2024-10-11 15:21:35,443 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2024-10-11 15:21:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 15:21:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 15:21:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 15:21:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2024-10-11 15:21:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2024-10-11 15:21:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2024-10-11 15:21:35,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2024-10-11 15:21:35,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2024-10-11 15:21:35,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2024-10-11 15:21:35,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2024-10-11 15:21:35,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 15:21:35,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 15:21:35,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 15:21:35,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2024-10-11 15:21:35,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2024-10-11 15:21:35,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2024-10-11 15:21:35,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2024-10-11 15:21:35,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2024-10-11 15:21:35,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2024-10-11 15:21:35,446 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2024-10-11 15:21:35,446 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_skb_return [2024-10-11 15:21:35,446 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_skb_return [2024-10-11 15:21:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 15:21:35,447 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 15:21:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 15:21:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 15:21:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 15:21:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 15:21:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 15:21:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 15:21:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 15:21:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 15:21:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 15:21:35,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 15:21:35,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-11 15:21:35,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-11 15:21:35,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 15:21:35,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 15:21:35,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 15:21:35,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 15:21:35,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 15:21:35,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 15:21:35,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 15:21:35,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 15:21:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 15:21:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 15:21:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-11 15:21:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 15:21:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 15:21:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 15:21:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 15:21:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 15:21:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 15:21:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 15:21:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 15:21:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 15:21:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 15:21:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-11 15:21:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2024-10-11 15:21:35,452 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2024-10-11 15:21:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-11 15:21:35,452 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-11 15:21:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-11 15:21:35,452 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-11 15:21:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_cmd [2024-10-11 15:21:35,452 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_cmd [2024-10-11 15:21:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 15:21:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 15:21:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 15:21:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 15:21:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 15:21:35,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 15:21:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 15:21:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 15:21:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 15:21:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 15:21:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-11 15:21:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-11 15:21:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-11 15:21:35,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-11 15:21:35,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-11 15:21:35,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-11 15:21:35,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-11 15:21:35,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-11 15:21:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2024-10-11 15:21:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2024-10-11 15:21:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-11 15:21:35,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-11 15:21:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 15:21:35,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 15:21:35,823 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 15:21:35,825 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 15:21:35,872 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-11 15:21:37,530 INFO L? ?]: Removed 592 outVars from TransFormulas that were not future-live. [2024-10-11 15:21:37,531 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 15:21:37,640 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 15:21:37,640 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 15:21:37,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:21:37 BoogieIcfgContainer [2024-10-11 15:21:37,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 15:21:37,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 15:21:37,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 15:21:37,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 15:21:37,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:21:33" (1/3) ... [2024-10-11 15:21:37,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d86f052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:21:37, skipping insertion in model container [2024-10-11 15:21:37,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:34" (2/3) ... [2024-10-11 15:21:37,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d86f052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:21:37, skipping insertion in model container [2024-10-11 15:21:37,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:21:37" (3/3) ... [2024-10-11 15:21:37,649 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2024-10-11 15:21:37,668 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 15:21:37,668 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 15:21:37,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 15:21:37,753 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;@5453ada3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 15:21:37,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 15:21:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 292 states, 205 states have (on average 1.473170731707317) internal successors, (302), 211 states have internal predecessors, (302), 63 states have call successors, (63), 23 states have call predecessors, (63), 22 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-11 15:21:37,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 15:21:37,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:37,773 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:21:37,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:37,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:37,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2039653661, now seen corresponding path program 1 times [2024-10-11 15:21:37,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:37,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227716889] [2024-10-11 15:21:37,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:37,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:38,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:38,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:38,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 15:21:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 15:21:38,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:38,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227716889] [2024-10-11 15:21:38,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227716889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:38,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:21:38,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:21:38,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078906561] [2024-10-11 15:21:38,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:38,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:21:38,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:38,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:21:38,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:21:38,547 INFO L87 Difference]: Start difference. First operand has 292 states, 205 states have (on average 1.473170731707317) internal successors, (302), 211 states have internal predecessors, (302), 63 states have call successors, (63), 23 states have call predecessors, (63), 22 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 15:21:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:42,385 INFO L93 Difference]: Finished difference Result 961 states and 1507 transitions. [2024-10-11 15:21:42,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 15:21:42,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-11 15:21:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:42,407 INFO L225 Difference]: With dead ends: 961 [2024-10-11 15:21:42,407 INFO L226 Difference]: Without dead ends: 659 [2024-10-11 15:21:42,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 15:21:42,423 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1364 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:42,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 628 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 15:21:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-10-11 15:21:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 541. [2024-10-11 15:21:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 390 states have (on average 1.4256410256410257) internal successors, (556), 390 states have internal predecessors, (556), 110 states have call successors, (110), 41 states have call predecessors, (110), 40 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2024-10-11 15:21:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 775 transitions. [2024-10-11 15:21:42,578 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 775 transitions. Word has length 27 [2024-10-11 15:21:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:42,578 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 775 transitions. [2024-10-11 15:21:42,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 15:21:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 775 transitions. [2024-10-11 15:21:42,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 15:21:42,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:42,582 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 15:21:42,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 15:21:42,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:42,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:42,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1371838205, now seen corresponding path program 1 times [2024-10-11 15:21:42,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:42,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906284129] [2024-10-11 15:21:42,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:42,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:42,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:42,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:42,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 15:21:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:42,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 15:21:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 15:21:42,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:42,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906284129] [2024-10-11 15:21:42,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906284129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:42,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:21:42,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 15:21:42,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420949273] [2024-10-11 15:21:42,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:42,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 15:21:42,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:42,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 15:21:42,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:21:42,866 INFO L87 Difference]: Start difference. First operand 541 states and 775 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 15:21:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:47,007 INFO L93 Difference]: Finished difference Result 1826 states and 2742 transitions. [2024-10-11 15:21:47,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 15:21:47,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-10-11 15:21:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:47,019 INFO L225 Difference]: With dead ends: 1826 [2024-10-11 15:21:47,019 INFO L226 Difference]: Without dead ends: 1296 [2024-10-11 15:21:47,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-11 15:21:47,023 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1339 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 739 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 739 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:47,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 766 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [739 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 15:21:47,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2024-10-11 15:21:47,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1064. [2024-10-11 15:21:47,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 769 states have (on average 1.422626788036411) internal successors, (1094), 769 states have internal predecessors, (1094), 216 states have call successors, (216), 79 states have call predecessors, (216), 78 states have return successors, (225), 215 states have call predecessors, (225), 215 states have call successors, (225) [2024-10-11 15:21:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1535 transitions. [2024-10-11 15:21:47,176 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1535 transitions. Word has length 36 [2024-10-11 15:21:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:47,176 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1535 transitions. [2024-10-11 15:21:47,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 15:21:47,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1535 transitions. [2024-10-11 15:21:47,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 15:21:47,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:47,183 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-10-11 15:21:47,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 15:21:47,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:47,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:47,185 INFO L85 PathProgramCache]: Analyzing trace with hash 203826429, now seen corresponding path program 1 times [2024-10-11 15:21:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:47,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583225893] [2024-10-11 15:21:47,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:47,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:47,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:47,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 15:21:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:47,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:21:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:47,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:21:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:47,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:47,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:47,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:21:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:21:47,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:47,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583225893] [2024-10-11 15:21:47,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583225893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:47,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:21:47,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 15:21:47,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217763489] [2024-10-11 15:21:47,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:47,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 15:21:47,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:47,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 15:21:47,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:21:47,533 INFO L87 Difference]: Start difference. First operand 1064 states and 1535 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 15:21:50,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:50,889 INFO L93 Difference]: Finished difference Result 2594 states and 3856 transitions. [2024-10-11 15:21:50,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 15:21:50,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-10-11 15:21:50,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:50,900 INFO L225 Difference]: With dead ends: 2594 [2024-10-11 15:21:50,900 INFO L226 Difference]: Without dead ends: 1543 [2024-10-11 15:21:50,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-10-11 15:21:50,907 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 801 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:50,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 601 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 15:21:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2024-10-11 15:21:51,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1336. [2024-10-11 15:21:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1000 states have (on average 1.448) internal successors, (1448), 1004 states have internal predecessors, (1448), 235 states have call successors, (235), 89 states have call predecessors, (235), 100 states have return successors, (282), 242 states have call predecessors, (282), 234 states have call successors, (282) [2024-10-11 15:21:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1965 transitions. [2024-10-11 15:21:51,018 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1965 transitions. Word has length 73 [2024-10-11 15:21:51,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:51,019 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1965 transitions. [2024-10-11 15:21:51,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 15:21:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1965 transitions. [2024-10-11 15:21:51,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 15:21:51,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:51,026 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:21:51,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 15:21:51,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:51,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:51,028 INFO L85 PathProgramCache]: Analyzing trace with hash 338715189, now seen corresponding path program 1 times [2024-10-11 15:21:51,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:51,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846052540] [2024-10-11 15:21:51,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:51,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:51,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:51,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:51,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 15:21:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:51,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 15:21:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:21:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:51,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:21:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:51,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:21:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:51,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:21:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:51,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:21:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:51,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:51,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 15:21:51,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:51,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846052540] [2024-10-11 15:21:51,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846052540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:51,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:21:51,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 15:21:51,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084836113] [2024-10-11 15:21:51,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:51,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 15:21:51,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:51,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 15:21:51,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:21:51,446 INFO L87 Difference]: Start difference. First operand 1336 states and 1965 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 15:21:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:21:56,785 INFO L93 Difference]: Finished difference Result 3778 states and 5646 transitions. [2024-10-11 15:21:56,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 15:21:56,785 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2024-10-11 15:21:56,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:21:56,803 INFO L225 Difference]: With dead ends: 3778 [2024-10-11 15:21:56,803 INFO L226 Difference]: Without dead ends: 2465 [2024-10-11 15:21:56,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2024-10-11 15:21:56,812 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 1115 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-11 15:21:56,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 1055 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-11 15:21:56,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2024-10-11 15:21:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2074. [2024-10-11 15:21:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 1558 states have (on average 1.4351732991014121) internal successors, (2236), 1566 states have internal predecessors, (2236), 343 states have call successors, (343), 149 states have call predecessors, (343), 172 states have return successors, (425), 358 states have call predecessors, (425), 342 states have call successors, (425) [2024-10-11 15:21:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3004 transitions. [2024-10-11 15:21:57,005 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3004 transitions. Word has length 97 [2024-10-11 15:21:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:21:57,007 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 3004 transitions. [2024-10-11 15:21:57,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 15:21:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3004 transitions. [2024-10-11 15:21:57,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 15:21:57,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:21:57,011 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:21:57,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 15:21:57,011 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:21:57,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:21:57,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1872751669, now seen corresponding path program 1 times [2024-10-11 15:21:57,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:21:57,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110516419] [2024-10-11 15:21:57,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:21:57,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:21:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:57,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:57,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:21:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:57,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 15:21:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:57,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 15:21:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:57,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:21:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:57,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:21:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:57,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:21:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:57,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:21:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:57,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:21:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:57,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:57,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:21:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:21:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-11 15:21:57,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:21:57,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110516419] [2024-10-11 15:21:57,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110516419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:21:57,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:21:57,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 15:21:57,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245257954] [2024-10-11 15:21:57,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:21:57,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 15:21:57,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:21:57,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 15:21:57,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 15:21:57,934 INFO L87 Difference]: Start difference. First operand 2074 states and 3004 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 15:22:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:05,403 INFO L93 Difference]: Finished difference Result 4511 states and 6685 transitions. [2024-10-11 15:22:05,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 15:22:05,404 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2024-10-11 15:22:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:05,419 INFO L225 Difference]: With dead ends: 4511 [2024-10-11 15:22:05,419 INFO L226 Difference]: Without dead ends: 2460 [2024-10-11 15:22:05,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2024-10-11 15:22:05,427 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 668 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 2831 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 3241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 2831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:05,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1512 Invalid, 3241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 2831 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-10-11 15:22:05,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2024-10-11 15:22:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 2154. [2024-10-11 15:22:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 1622 states have (on average 1.4254007398273736) internal successors, (2312), 1634 states have internal predecessors, (2312), 343 states have call successors, (343), 149 states have call predecessors, (343), 188 states have return successors, (450), 370 states have call predecessors, (450), 342 states have call successors, (450) [2024-10-11 15:22:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 3105 transitions. [2024-10-11 15:22:05,594 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 3105 transitions. Word has length 97 [2024-10-11 15:22:05,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:05,595 INFO L471 AbstractCegarLoop]: Abstraction has 2154 states and 3105 transitions. [2024-10-11 15:22:05,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 15:22:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3105 transitions. [2024-10-11 15:22:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 15:22:05,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:05,598 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:22:05,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 15:22:05,599 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:05,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:05,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1988753911, now seen corresponding path program 1 times [2024-10-11 15:22:05,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:05,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903281353] [2024-10-11 15:22:05,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:05,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:05,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:05,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:05,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 15:22:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:05,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 15:22:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:22:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:05,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:22:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:05,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:22:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:05,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:22:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:06,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:22:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:06,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:06,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:22:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-11 15:22:06,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:06,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903281353] [2024-10-11 15:22:06,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903281353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:22:06,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:22:06,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 15:22:06,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590198430] [2024-10-11 15:22:06,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:22:06,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 15:22:06,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:22:06,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 15:22:06,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 15:22:06,368 INFO L87 Difference]: Start difference. First operand 2154 states and 3105 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 15:22:08,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:22:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:13,713 INFO L93 Difference]: Finished difference Result 4599 states and 6774 transitions. [2024-10-11 15:22:13,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 15:22:13,714 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-10-11 15:22:13,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:13,730 INFO L225 Difference]: With dead ends: 4599 [2024-10-11 15:22:13,730 INFO L226 Difference]: Without dead ends: 2468 [2024-10-11 15:22:13,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2024-10-11 15:22:13,737 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 762 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 2730 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 2730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:13,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 1415 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 2730 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-10-11 15:22:13,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2024-10-11 15:22:13,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2114. [2024-10-11 15:22:13,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 1586 states have (on average 1.4224464060529634) internal successors, (2256), 1598 states have internal predecessors, (2256), 343 states have call successors, (343), 149 states have call predecessors, (343), 184 states have return successors, (442), 366 states have call predecessors, (442), 342 states have call successors, (442) [2024-10-11 15:22:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3041 transitions. [2024-10-11 15:22:13,900 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3041 transitions. Word has length 103 [2024-10-11 15:22:13,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:13,901 INFO L471 AbstractCegarLoop]: Abstraction has 2114 states and 3041 transitions. [2024-10-11 15:22:13,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 15:22:13,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3041 transitions. [2024-10-11 15:22:13,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 15:22:13,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:13,907 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:22:13,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 15:22:13,907 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:13,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:13,908 INFO L85 PathProgramCache]: Analyzing trace with hash -46132384, now seen corresponding path program 1 times [2024-10-11 15:22:13,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:13,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298828741] [2024-10-11 15:22:13,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:13,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:14,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:14,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:14,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 15:22:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:14,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 15:22:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:14,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:22:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:14,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:22:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:14,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:22:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:14,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:22:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:14,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:22:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:14,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:14,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:14,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 15:22:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-11 15:22:14,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:14,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298828741] [2024-10-11 15:22:14,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298828741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:22:14,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:22:14,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 15:22:14,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890409983] [2024-10-11 15:22:14,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:22:14,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 15:22:14,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:22:14,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 15:22:14,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 15:22:14,694 INFO L87 Difference]: Start difference. First operand 2114 states and 3041 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 15:22:19,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:19,985 INFO L93 Difference]: Finished difference Result 4827 states and 7242 transitions. [2024-10-11 15:22:19,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 15:22:19,986 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-10-11 15:22:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:20,002 INFO L225 Difference]: With dead ends: 4827 [2024-10-11 15:22:20,002 INFO L226 Difference]: Without dead ends: 2736 [2024-10-11 15:22:20,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2024-10-11 15:22:20,012 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 673 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 2159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:20,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 985 Invalid, 2159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 15:22:20,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2024-10-11 15:22:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2182. [2024-10-11 15:22:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 1610 states have (on average 1.4062111801242236) internal successors, (2264), 1618 states have internal predecessors, (2264), 391 states have call successors, (391), 149 states have call predecessors, (391), 180 states have return successors, (502), 414 states have call predecessors, (502), 390 states have call successors, (502) [2024-10-11 15:22:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 3157 transitions. [2024-10-11 15:22:20,237 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 3157 transitions. Word has length 103 [2024-10-11 15:22:20,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:20,238 INFO L471 AbstractCegarLoop]: Abstraction has 2182 states and 3157 transitions. [2024-10-11 15:22:20,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 15:22:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 3157 transitions. [2024-10-11 15:22:20,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 15:22:20,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:20,242 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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, 1, 1, 1, 1, 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-10-11 15:22:20,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 15:22:20,243 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:20,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:20,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2040864994, now seen corresponding path program 1 times [2024-10-11 15:22:20,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:20,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867915902] [2024-10-11 15:22:20,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:20,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:20,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:20,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:20,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 15:22:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:20,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 15:22:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:20,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:22:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:20,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:22:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:20,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:22:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:20,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:22:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:20,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:22:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:20,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:20,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:20,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:22:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:20,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 15:22:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-11 15:22:20,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:20,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867915902] [2024-10-11 15:22:20,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867915902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:22:20,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:22:20,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 15:22:20,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768927213] [2024-10-11 15:22:20,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:22:20,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 15:22:20,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:22:20,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 15:22:20,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 15:22:20,806 INFO L87 Difference]: Start difference. First operand 2182 states and 3157 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 8 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 15:22:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:25,077 INFO L93 Difference]: Finished difference Result 4901 states and 7281 transitions. [2024-10-11 15:22:25,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 15:22:25,077 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 8 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2024-10-11 15:22:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:25,093 INFO L225 Difference]: With dead ends: 4901 [2024-10-11 15:22:25,093 INFO L226 Difference]: Without dead ends: 2735 [2024-10-11 15:22:25,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-10-11 15:22:25,102 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 667 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:25,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 850 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 15:22:25,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2024-10-11 15:22:25,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2183. [2024-10-11 15:22:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 1611 states have (on average 1.4059590316573556) internal successors, (2265), 1619 states have internal predecessors, (2265), 391 states have call successors, (391), 149 states have call predecessors, (391), 180 states have return successors, (502), 414 states have call predecessors, (502), 390 states have call successors, (502) [2024-10-11 15:22:25,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3158 transitions. [2024-10-11 15:22:25,316 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3158 transitions. Word has length 109 [2024-10-11 15:22:25,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:25,316 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 3158 transitions. [2024-10-11 15:22:25,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 8 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 15:22:25,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3158 transitions. [2024-10-11 15:22:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 15:22:25,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:25,320 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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, 1, 1, 1, 1, 1, 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-10-11 15:22:25,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 15:22:25,321 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:25,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:25,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1408122187, now seen corresponding path program 1 times [2024-10-11 15:22:25,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:25,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196176952] [2024-10-11 15:22:25,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:25,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:25,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:25,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:25,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:25,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:22:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:25,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 15:22:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 15:22:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:25,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 15:22:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:25,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:22:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:25,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:22:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:25,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:25,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:25,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:22:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:25,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 15:22:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:25,950 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-11 15:22:25,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:25,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196176952] [2024-10-11 15:22:25,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196176952] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:22:25,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092689815] [2024-10-11 15:22:25,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:25,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:25,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:22:25,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:22:25,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 15:22:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:26,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 15:22:26,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:22:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-11 15:22:26,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:22:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 15:22:26,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092689815] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 15:22:26,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 15:22:26,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11, 6] total 16 [2024-10-11 15:22:26,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829467677] [2024-10-11 15:22:26,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:22:26,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:22:26,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:22:26,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:22:26,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-11 15:22:26,769 INFO L87 Difference]: Start difference. First operand 2183 states and 3158 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 15:22:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:27,489 INFO L93 Difference]: Finished difference Result 4345 states and 6293 transitions. [2024-10-11 15:22:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:22:27,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2024-10-11 15:22:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:27,506 INFO L225 Difference]: With dead ends: 4345 [2024-10-11 15:22:27,506 INFO L226 Difference]: Without dead ends: 2184 [2024-10-11 15:22:27,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-11 15:22:27,513 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 0 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:27,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 735 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 15:22:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2024-10-11 15:22:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2184. [2024-10-11 15:22:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 1612 states have (on average 1.4057071960297767) internal successors, (2266), 1620 states have internal predecessors, (2266), 391 states have call successors, (391), 149 states have call predecessors, (391), 180 states have return successors, (502), 414 states have call predecessors, (502), 390 states have call successors, (502) [2024-10-11 15:22:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 3159 transitions. [2024-10-11 15:22:27,694 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 3159 transitions. Word has length 110 [2024-10-11 15:22:27,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:27,694 INFO L471 AbstractCegarLoop]: Abstraction has 2184 states and 3159 transitions. [2024-10-11 15:22:27,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 15:22:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3159 transitions. [2024-10-11 15:22:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 15:22:27,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:27,698 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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-10-11 15:22:27,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 15:22:27,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:27,903 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:27,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:27,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1718402407, now seen corresponding path program 1 times [2024-10-11 15:22:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:27,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936686663] [2024-10-11 15:22:27,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:27,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:28,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:28,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:28,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:28,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 15:22:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:28,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 15:22:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:28,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 15:22:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:28,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 15:22:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:28,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 15:22:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:28,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:22:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:28,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:28,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:28,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:22:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:28,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 15:22:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 15:22:28,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:28,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936686663] [2024-10-11 15:22:28,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936686663] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:22:28,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471565658] [2024-10-11 15:22:28,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:28,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:28,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:22:28,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:22:28,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 15:22:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:29,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 15:22:29,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:22:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 15:22:29,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:22:29,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471565658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:22:29,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:22:29,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2024-10-11 15:22:29,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315118186] [2024-10-11 15:22:29,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:22:29,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 15:22:29,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:22:29,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 15:22:29,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2024-10-11 15:22:29,511 INFO L87 Difference]: Start difference. First operand 2184 states and 3159 transitions. Second operand has 15 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 15:22:34,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:34,339 INFO L93 Difference]: Finished difference Result 4665 states and 6824 transitions. [2024-10-11 15:22:34,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 15:22:34,339 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2024-10-11 15:22:34,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:34,354 INFO L225 Difference]: With dead ends: 4665 [2024-10-11 15:22:34,354 INFO L226 Difference]: Without dead ends: 2506 [2024-10-11 15:22:34,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2024-10-11 15:22:34,362 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 35 mSDsluCounter, 4997 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5420 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:34,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5420 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 15:22:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2024-10-11 15:22:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2228. [2024-10-11 15:22:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 1644 states have (on average 1.397810218978102) internal successors, (2298), 1648 states have internal predecessors, (2298), 395 states have call successors, (395), 149 states have call predecessors, (395), 188 states have return successors, (526), 430 states have call predecessors, (526), 394 states have call successors, (526) [2024-10-11 15:22:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 3219 transitions. [2024-10-11 15:22:34,607 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 3219 transitions. Word has length 111 [2024-10-11 15:22:34,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:34,607 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 3219 transitions. [2024-10-11 15:22:34,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 15:22:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 3219 transitions. [2024-10-11 15:22:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 15:22:34,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:34,613 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 15:22:34,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 15:22:34,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:34,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:34,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:34,817 INFO L85 PathProgramCache]: Analyzing trace with hash -692679822, now seen corresponding path program 1 times [2024-10-11 15:22:34,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:34,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698916399] [2024-10-11 15:22:34,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:34,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 15:22:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 15:22:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 15:22:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 15:22:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 15:22:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 15:22:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:22:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:22:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 15:22:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-11 15:22:35,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:35,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698916399] [2024-10-11 15:22:35,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698916399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:22:35,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:22:35,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 15:22:35,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243811779] [2024-10-11 15:22:35,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:22:35,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 15:22:35,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:22:35,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 15:22:35,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:22:35,257 INFO L87 Difference]: Start difference. First operand 2228 states and 3219 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 8 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 15:22:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:39,759 INFO L93 Difference]: Finished difference Result 5001 states and 7458 transitions. [2024-10-11 15:22:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 15:22:39,763 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 8 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-11 15:22:39,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:39,780 INFO L225 Difference]: With dead ends: 5001 [2024-10-11 15:22:39,780 INFO L226 Difference]: Without dead ends: 2798 [2024-10-11 15:22:39,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-10-11 15:22:39,787 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 664 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:39,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 718 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-11 15:22:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2024-10-11 15:22:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2240. [2024-10-11 15:22:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2240 states, 1656 states have (on average 1.394927536231884) internal successors, (2310), 1660 states have internal predecessors, (2310), 395 states have call successors, (395), 149 states have call predecessors, (395), 188 states have return successors, (526), 430 states have call predecessors, (526), 394 states have call successors, (526) [2024-10-11 15:22:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 3231 transitions. [2024-10-11 15:22:40,004 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 3231 transitions. Word has length 129 [2024-10-11 15:22:40,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:40,005 INFO L471 AbstractCegarLoop]: Abstraction has 2240 states and 3231 transitions. [2024-10-11 15:22:40,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 8 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 15:22:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 3231 transitions. [2024-10-11 15:22:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 15:22:40,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:40,013 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 15:22:40,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 15:22:40,013 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:40,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:40,014 INFO L85 PathProgramCache]: Analyzing trace with hash -248779148, now seen corresponding path program 1 times [2024-10-11 15:22:40,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:40,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14368237] [2024-10-11 15:22:40,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:40,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 15:22:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 15:22:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 15:22:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 15:22:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 15:22:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 15:22:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:22:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:22:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 15:22:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-11 15:22:40,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:40,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14368237] [2024-10-11 15:22:40,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14368237] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:22:40,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619099677] [2024-10-11 15:22:40,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:40,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:40,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:22:40,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:22:40,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 15:22:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:41,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 1182 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 15:22:41,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:22:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-11 15:22:41,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:22:41,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619099677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:22:41,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:22:41,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2024-10-11 15:22:41,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312885438] [2024-10-11 15:22:41,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:22:41,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 15:22:41,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:22:41,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 15:22:41,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2024-10-11 15:22:41,513 INFO L87 Difference]: Start difference. First operand 2240 states and 3231 transitions. Second operand has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 15:22:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:22:46,286 INFO L93 Difference]: Finished difference Result 4733 states and 6892 transitions. [2024-10-11 15:22:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 15:22:46,287 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) Word has length 129 [2024-10-11 15:22:46,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:22:46,305 INFO L225 Difference]: With dead ends: 4733 [2024-10-11 15:22:46,305 INFO L226 Difference]: Without dead ends: 2518 [2024-10-11 15:22:46,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2024-10-11 15:22:46,313 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 31 mSDsluCounter, 4794 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 5199 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:22:46,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 5199 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 15:22:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2024-10-11 15:22:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2256. [2024-10-11 15:22:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 1672 states have (on average 1.3911483253588517) internal successors, (2326), 1668 states have internal predecessors, (2326), 395 states have call successors, (395), 149 states have call predecessors, (395), 188 states have return successors, (526), 438 states have call predecessors, (526), 394 states have call successors, (526) [2024-10-11 15:22:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3247 transitions. [2024-10-11 15:22:46,509 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3247 transitions. Word has length 129 [2024-10-11 15:22:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:22:46,510 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3247 transitions. [2024-10-11 15:22:46,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 15:22:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3247 transitions. [2024-10-11 15:22:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 15:22:46,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:22:46,516 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 15:22:46,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 15:22:46,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:46,718 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:22:46,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:22:46,718 INFO L85 PathProgramCache]: Analyzing trace with hash 717901173, now seen corresponding path program 1 times [2024-10-11 15:22:46,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:22:46,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454458794] [2024-10-11 15:22:46,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:22:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:22:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:22:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 15:22:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 15:22:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 15:22:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 15:22:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 15:22:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 15:22:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:22:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:22:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 15:22:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:22:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 15:22:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:22:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:22:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:22:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:22:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-11 15:22:47,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:22:47,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454458794] [2024-10-11 15:22:47,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454458794] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:22:47,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738954791] [2024-10-11 15:22:47,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:22:47,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:22:47,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:22:47,415 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:22:47,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process