./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.0/module_get_put-drivers-net-pppox.ko.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.0/module_get_put-drivers-net-pppox.ko.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 66690b8f2afac00b38604fc5fd1edb6c2524e6892200d6512ef98cf0032d8df1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:50:35,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:50:35,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 14:50:35,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:50:35,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:50:35,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:50:35,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:50:35,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:50:35,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:50:35,832 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:50:35,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:50:35,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:50:35,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:50:35,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:50:35,836 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:50:35,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:50:35,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:50:35,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:50:35,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:50:35,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:50:35,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:50:35,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:50:35,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:50:35,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:50:35,840 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:50:35,840 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:50:35,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:50:35,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:50:35,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:50:35,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:50:35,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:50:35,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:50:35,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:50:35,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:50:35,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:50:35,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:50:35,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:50:35,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:50:35,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:50:35,844 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 -> 66690b8f2afac00b38604fc5fd1edb6c2524e6892200d6512ef98cf0032d8df1 [2024-10-11 14:50:36,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:50:36,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:50:36,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:50:36,114 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:50:36,115 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:50:36,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i [2024-10-11 14:50:37,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:50:37,928 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:50:37,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i [2024-10-11 14:50:37,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/533f766f3/2a7843961d7a45c3aec1815ee687863c/FLAG59e9ab6e5 [2024-10-11 14:50:38,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/533f766f3/2a7843961d7a45c3aec1815ee687863c [2024-10-11 14:50:38,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:50:38,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:50:38,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:50:38,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:50:38,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:50:38,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:50:38" (1/1) ... [2024-10-11 14:50:38,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74c6995a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:38, skipping insertion in model container [2024-10-11 14:50:38,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:50:38" (1/1) ... [2024-10-11 14:50:38,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:50:38,821 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.0/module_get_put-drivers-net-pppox.ko.cil.out.i[141033,141046] [2024-10-11 14:50:38,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:50:38,862 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:50:38,965 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4823-4824] [2024-10-11 14:50:38,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4826-4827] [2024-10-11 14:50:38,972 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4830-4831] [2024-10-11 14:50:38,973 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4833-4834] [2024-10-11 14:50:38,973 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4837-4838] [2024-10-11 14:50:38,981 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.0/module_get_put-drivers-net-pppox.ko.cil.out.i[141033,141046] [2024-10-11 14:50:38,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:50:39,021 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:50:39,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:39 WrapperNode [2024-10-11 14:50:39,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:50:39,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:50:39,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:50:39,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:50:39,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:39" (1/1) ... [2024-10-11 14:50:39,051 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:39" (1/1) ... [2024-10-11 14:50:39,080 INFO L138 Inliner]: procedures = 49, calls = 66, calls flagged for inlining = 22, calls inlined = 15, statements flattened = 185 [2024-10-11 14:50:39,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:50:39,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:50:39,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:50:39,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:50:39,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:39" (1/1) ... [2024-10-11 14:50:39,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:39" (1/1) ... [2024-10-11 14:50:39,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:39" (1/1) ... [2024-10-11 14:50:39,129 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 3, 9, 3]. 53 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 4, 3]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-10-11 14:50:39,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:39" (1/1) ... [2024-10-11 14:50:39,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:39" (1/1) ... [2024-10-11 14:50:39,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:39" (1/1) ... [2024-10-11 14:50:39,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:39" (1/1) ... [2024-10-11 14:50:39,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:39" (1/1) ... [2024-10-11 14:50:39,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:39" (1/1) ... [2024-10-11 14:50:39,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:50:39,158 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:50:39,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:50:39,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:50:39,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:39" (1/1) ... [2024-10-11 14:50:39,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:50:39,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:50:39,197 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 14:50:39,239 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 14:50:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:50:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 14:50:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 14:50:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 14:50:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 14:50:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2024-10-11 14:50:39,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2024-10-11 14:50:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2024-10-11 14:50:39,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2024-10-11 14:50:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 14:50:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 14:50:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 14:50:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 14:50:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:50:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:50:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 14:50:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 14:50:39,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:50:39,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:50:39,432 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:50:39,434 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:50:39,439 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 14:50:39,586 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2024-10-11 14:50:39,587 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2024-10-11 14:50:39,617 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-11 14:50:39,617 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:50:39,661 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:50:39,662 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 14:50:39,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:50:39 BoogieIcfgContainer [2024-10-11 14:50:39,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:50:39,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:50:39,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:50:39,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:50:39,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:50:38" (1/3) ... [2024-10-11 14:50:39,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714d4328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:50:39, skipping insertion in model container [2024-10-11 14:50:39,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:50:39" (2/3) ... [2024-10-11 14:50:39,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714d4328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:50:39, skipping insertion in model container [2024-10-11 14:50:39,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:50:39" (3/3) ... [2024-10-11 14:50:39,673 INFO L112 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-net-pppox.ko.cil.out.i [2024-10-11 14:50:39,686 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:50:39,686 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:50:39,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:50:39,739 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;@6660332f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:50:39,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:50:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 25 states have (on average 1.56) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 14:50:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 14:50:39,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:50:39,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 14:50:39,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:50:39,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:50:39,754 INFO L85 PathProgramCache]: Analyzing trace with hash 814108759, now seen corresponding path program 1 times [2024-10-11 14:50:39,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:50:39,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058002959] [2024-10-11 14:50:39,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:50:39,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:50:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:50:40,034 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 14:50:40,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:50:40,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058002959] [2024-10-11 14:50:40,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058002959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:50:40,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:50:40,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:50:40,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785454230] [2024-10-11 14:50:40,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:50:40,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:50:40,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:50:40,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:50:40,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:50:40,065 INFO L87 Difference]: Start difference. First operand has 32 states, 25 states have (on average 1.56) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:50:40,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:50:40,135 INFO L93 Difference]: Finished difference Result 86 states and 127 transitions. [2024-10-11 14:50:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:50:40,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 14:50:40,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:50:40,145 INFO L225 Difference]: With dead ends: 86 [2024-10-11 14:50:40,146 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 14:50:40,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:50:40,152 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:50:40,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 53 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:50:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 14:50:40,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-10-11 14:50:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 14:50:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 68 transitions. [2024-10-11 14:50:40,188 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 68 transitions. Word has length 6 [2024-10-11 14:50:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:50:40,189 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 68 transitions. [2024-10-11 14:50:40,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:50:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2024-10-11 14:50:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 14:50:40,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:50:40,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:50:40,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:50:40,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:50:40,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:50:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash -910047111, now seen corresponding path program 1 times [2024-10-11 14:50:40,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:50:40,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287510732] [2024-10-11 14:50:40,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:50:40,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:50:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:50:40,543 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 14:50:40,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:50:40,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287510732] [2024-10-11 14:50:40,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287510732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:50:40,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:50:40,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:50:40,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688704098] [2024-10-11 14:50:40,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:50:40,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:50:40,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:50:40,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:50:40,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:50:40,546 INFO L87 Difference]: Start difference. First operand 49 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:50:40,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:50:40,671 INFO L93 Difference]: Finished difference Result 102 states and 142 transitions. [2024-10-11 14:50:40,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:50:40,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 14:50:40,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:50:40,672 INFO L225 Difference]: With dead ends: 102 [2024-10-11 14:50:40,673 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 14:50:40,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:50:40,674 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:50:40,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:50:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 14:50:40,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2024-10-11 14:50:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.434782608695652) internal successors, (66), 47 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 14:50:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2024-10-11 14:50:40,691 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 19 [2024-10-11 14:50:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:50:40,692 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2024-10-11 14:50:40,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:50:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2024-10-11 14:50:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 14:50:40,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:50:40,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:50:40,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:50:40,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:50:40,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:50:40,698 INFO L85 PathProgramCache]: Analyzing trace with hash -29838090, now seen corresponding path program 1 times [2024-10-11 14:50:40,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:50:40,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327209937] [2024-10-11 14:50:40,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:50:40,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:50:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:50:40,845 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 14:50:40,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:50:40,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327209937] [2024-10-11 14:50:40,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327209937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:50:40,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:50:40,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:50:40,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055637332] [2024-10-11 14:50:40,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:50:40,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:50:40,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:50:40,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:50:40,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:50:40,849 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:50:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:50:40,903 INFO L93 Difference]: Finished difference Result 99 states and 137 transitions. [2024-10-11 14:50:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:50:40,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 14:50:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:50:40,905 INFO L225 Difference]: With dead ends: 99 [2024-10-11 14:50:40,906 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 14:50:40,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:50:40,907 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:50:40,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:50:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 14:50:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 14:50:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 44 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 14:50:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2024-10-11 14:50:40,918 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 19 [2024-10-11 14:50:40,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:50:40,918 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-10-11 14:50:40,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:50:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2024-10-11 14:50:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 14:50:40,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:50:40,920 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] [2024-10-11 14:50:40,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:50:40,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:50:40,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:50:40,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2086495941, now seen corresponding path program 1 times [2024-10-11 14:50:40,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:50:40,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385316999] [2024-10-11 14:50:40,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:50:40,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:50:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:50:41,026 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 14:50:41,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:50:41,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385316999] [2024-10-11 14:50:41,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385316999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:50:41,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:50:41,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:50:41,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368941529] [2024-10-11 14:50:41,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:50:41,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:50:41,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:50:41,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:50:41,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:50:41,029 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:50:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:50:41,081 INFO L93 Difference]: Finished difference Result 80 states and 107 transitions. [2024-10-11 14:50:41,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:50:41,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 14:50:41,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:50:41,084 INFO L225 Difference]: With dead ends: 80 [2024-10-11 14:50:41,084 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 14:50:41,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:50:41,085 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 38 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:50:41,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 85 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:50:41,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 14:50:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2024-10-11 14:50:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 66 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 14:50:41,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2024-10-11 14:50:41,098 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 20 [2024-10-11 14:50:41,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:50:41,098 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2024-10-11 14:50:41,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:50:41,099 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2024-10-11 14:50:41,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 14:50:41,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:50:41,101 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:50:41,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:50:41,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:50:41,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:50:41,102 INFO L85 PathProgramCache]: Analyzing trace with hash -601936540, now seen corresponding path program 1 times [2024-10-11 14:50:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:50:41,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632834320] [2024-10-11 14:50:41,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:50:41,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:50:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:50:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:50:41,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:50:41,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632834320] [2024-10-11 14:50:41,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632834320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:50:41,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:50:41,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:50:41,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877359068] [2024-10-11 14:50:41,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:50:41,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:50:41,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:50:41,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:50:41,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:50:41,151 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:50:41,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:50:41,194 INFO L93 Difference]: Finished difference Result 127 states and 176 transitions. [2024-10-11 14:50:41,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:50:41,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 14:50:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:50:41,195 INFO L225 Difference]: With dead ends: 127 [2024-10-11 14:50:41,195 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 14:50:41,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:50:41,197 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:50:41,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:50:41,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 14:50:41,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 14:50:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.4) internal successors, (91), 66 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 14:50:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2024-10-11 14:50:41,212 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 21 [2024-10-11 14:50:41,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:50:41,212 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2024-10-11 14:50:41,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:50:41,213 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2024-10-11 14:50:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 14:50:41,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:50:41,214 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 14:50:41,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:50:41,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:50:41,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:50:41,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1093923232, now seen corresponding path program 1 times [2024-10-11 14:50:41,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:50:41,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662101200] [2024-10-11 14:50:41,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:50:41,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:50:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:50:41,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:50:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:50:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:50:41,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:50:41,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662101200] [2024-10-11 14:50:41,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662101200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:50:41,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:50:41,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:50:41,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927432489] [2024-10-11 14:50:41,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:50:41,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:50:41,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:50:41,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:50:41,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:50:41,508 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 14:50:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:50:41,650 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2024-10-11 14:50:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:50:41,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-11 14:50:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:50:41,652 INFO L225 Difference]: With dead ends: 119 [2024-10-11 14:50:41,652 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 14:50:41,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:50:41,653 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:50:41,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 141 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:50:41,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 14:50:41,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2024-10-11 14:50:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 14:50:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2024-10-11 14:50:41,665 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 27 [2024-10-11 14:50:41,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:50:41,665 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2024-10-11 14:50:41,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 14:50:41,666 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2024-10-11 14:50:41,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 14:50:41,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:50:41,667 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:50:41,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:50:41,667 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:50:41,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:50:41,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1287895800, now seen corresponding path program 1 times [2024-10-11 14:50:41,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:50:41,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085272722] [2024-10-11 14:50:41,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:50:41,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:50:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:50:41,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:50:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:50:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:50:41,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:50:41,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085272722] [2024-10-11 14:50:41,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085272722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:50:41,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:50:41,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:50:41,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463969383] [2024-10-11 14:50:41,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:50:41,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:50:41,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:50:41,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:50:41,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:50:41,853 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 14:50:41,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:50:41,921 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-10-11 14:50:41,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:50:41,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-10-11 14:50:41,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:50:41,923 INFO L225 Difference]: With dead ends: 56 [2024-10-11 14:50:41,924 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 14:50:41,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:50:41,925 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:50:41,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 45 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:50:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 14:50:41,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 14:50:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 14:50:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2024-10-11 14:50:41,934 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 29 [2024-10-11 14:50:41,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:50:41,935 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-10-11 14:50:41,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 14:50:41,935 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-10-11 14:50:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 14:50:41,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:50:41,935 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:50:41,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:50:41,936 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:50:41,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:50:41,936 INFO L85 PathProgramCache]: Analyzing trace with hash -26869088, now seen corresponding path program 1 times [2024-10-11 14:50:41,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:50:41,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798226764] [2024-10-11 14:50:41,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:50:41,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:50:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:50:42,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:50:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:50:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:50:42,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:50:42,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798226764] [2024-10-11 14:50:42,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798226764] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:50:42,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557560301] [2024-10-11 14:50:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:50:42,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:50:42,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:50:42,064 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 14:50:42,066 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 14:50:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:50:42,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 14:50:42,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:50:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:50:42,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:50:42,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557560301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:50:42,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 14:50:42,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-11 14:50:42,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125824924] [2024-10-11 14:50:42,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:50:42,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:50:42,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:50:42,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:50:42,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:50:42,275 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 14:50:42,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:50:42,301 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2024-10-11 14:50:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:50:42,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2024-10-11 14:50:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:50:42,302 INFO L225 Difference]: With dead ends: 51 [2024-10-11 14:50:42,303 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 14:50:42,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:50:42,304 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:50:42,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 36 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:50:42,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 14:50:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 14:50:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:50:42,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 14:50:42,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2024-10-11 14:50:42,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:50:42,305 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 14:50:42,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 14:50:42,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 14:50:42,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 14:50:42,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 14:50:42,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:50:42,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:50:42,514 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:50:42,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 14:50:42,590 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:50:42,600 WARN L155 FloydHoareUtils]: Requires clause for ldv_module_put contained old-variable. Original clause: (and (<= |old(~ldv_module_refcounter~0)| 2) (= 2 ~ldv_module_refcounter~0) (<= 2 |old(~ldv_module_refcounter~0)|)) Eliminated clause: (= 2 ~ldv_module_refcounter~0) [2024-10-11 14:50:42,615 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~module!offset [2024-10-11 14:50:42,616 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~module!base [2024-10-11 14:50:42,617 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~module!offset [2024-10-11 14:50:42,617 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~module!base [2024-10-11 14:50:42,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:50:42 BoogieIcfgContainer [2024-10-11 14:50:42,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:50:42,620 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:50:42,620 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:50:42,620 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:50:42,620 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:50:39" (3/4) ... [2024-10-11 14:50:42,622 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 14:50:42,626 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2024-10-11 14:50:42,626 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2024-10-11 14:50:42,634 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2024-10-11 14:50:42,635 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 14:50:42,635 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 14:50:42,635 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 14:50:42,736 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:50:42,737 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 14:50:42,737 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:50:42,737 INFO L158 Benchmark]: Toolchain (without parser) took 4585.68ms. Allocated memory was 165.7MB in the beginning and 220.2MB in the end (delta: 54.5MB). Free memory was 124.7MB in the beginning and 102.4MB in the end (delta: 22.4MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. [2024-10-11 14:50:42,737 INFO L158 Benchmark]: CDTParser took 3.32ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 92.3MB in the end (delta: 66.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:50:42,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 869.41ms. Allocated memory is still 165.7MB. Free memory was 124.7MB in the beginning and 51.3MB in the end (delta: 73.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-10-11 14:50:42,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.71ms. Allocated memory is still 165.7MB. Free memory was 51.3MB in the beginning and 48.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:50:42,738 INFO L158 Benchmark]: Boogie Preprocessor took 75.68ms. Allocated memory is still 165.7MB. Free memory was 48.2MB in the beginning and 45.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:50:42,738 INFO L158 Benchmark]: RCFGBuilder took 504.59ms. Allocated memory is still 165.7MB. Free memory was 45.0MB in the beginning and 101.8MB in the end (delta: -56.8MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-10-11 14:50:42,738 INFO L158 Benchmark]: TraceAbstraction took 2954.03ms. Allocated memory was 165.7MB in the beginning and 220.2MB in the end (delta: 54.5MB). Free memory was 101.8MB in the beginning and 109.7MB in the end (delta: -7.9MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-10-11 14:50:42,738 INFO L158 Benchmark]: Witness Printer took 117.28ms. Allocated memory is still 220.2MB. Free memory was 109.7MB in the beginning and 102.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 14:50:42,742 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.32ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 92.3MB in the end (delta: 66.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 869.41ms. Allocated memory is still 165.7MB. Free memory was 124.7MB in the beginning and 51.3MB in the end (delta: 73.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.71ms. Allocated memory is still 165.7MB. Free memory was 51.3MB in the beginning and 48.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.68ms. Allocated memory is still 165.7MB. Free memory was 48.2MB in the beginning and 45.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 504.59ms. Allocated memory is still 165.7MB. Free memory was 45.0MB in the beginning and 101.8MB in the end (delta: -56.8MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2954.03ms. Allocated memory was 165.7MB in the beginning and 220.2MB in the end (delta: 54.5MB). Free memory was 101.8MB in the beginning and 109.7MB in the end (delta: -7.9MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * Witness Printer took 117.28ms. Allocated memory is still 220.2MB. Free memory was 109.7MB in the beginning and 102.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 4823]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4823-4824] - GenericResultAtLocation [Line: 4826]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4826-4827] - GenericResultAtLocation [Line: 4830]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4830-4831] - GenericResultAtLocation [Line: 4833]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4833-4834] - GenericResultAtLocation [Line: 4837]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4837-4838] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~module!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~module!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~module!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~module!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4995]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 622 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 402 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 406 IncrementalHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 220 mSDtfsCounter, 406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=4, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 908 SizeOfPredicates, 1 NumberOfNonLiveVariables, 268 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 37/38 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 5028]: Procedure Contract for ldv_module_put Derived contract for procedure ldv_module_put. Requires: (2 == ldv_module_refcounter) Ensures: (((ldv_module_refcounter == 1) || (2 == ldv_module_refcounter)) && (2 == \old(ldv_module_refcounter))) - ProcedureContractResult [Line: 4992]: Procedure Contract for ldv_blast_assert Derived contract for procedure ldv_blast_assert. Requires: 0 Ensures: 0 RESULT: Ultimate proved your program to be correct! [2024-10-11 14:50:42,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE