./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:35:36,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:35:36,486 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-06 22:35:36,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:35:36,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:35:36,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:35:36,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:35:36,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:35:36,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:35:36,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:35:36,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:35:36,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:35:36,561 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:35:36,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:35:36,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:35:36,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:35:36,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:35:36,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:35:36,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:35:36,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:35:36,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:35:36,567 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:35:36,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:35:36,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:35:36,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:35:36,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:36,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:35:36,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:35:36,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:35:36,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:35:36,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:35:36,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:35:36,573 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:35:36,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:35:36,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:35:36,574 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:35:36,574 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 [2023-11-06 22:35:36,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:35:36,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:35:36,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:35:36,877 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:35:36,878 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:35:36,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2023-11-06 22:35:40,256 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:35:40,721 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:35:40,724 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2023-11-06 22:35:40,757 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/data/1f523f886/b404ec3030fb4c30a47dde4dc2bec551/FLAGedb185d29 [2023-11-06 22:35:40,773 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/data/1f523f886/b404ec3030fb4c30a47dde4dc2bec551 [2023-11-06 22:35:40,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:35:40,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:35:40,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:40,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:35:40,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:35:40,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:40" (1/1) ... [2023-11-06 22:35:40,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ab7689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:40, skipping insertion in model container [2023-11-06 22:35:40,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:40" (1/1) ... [2023-11-06 22:35:40,865 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:35:41,244 WARN L1270 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2023-11-06 22:35:41,244 WARN L1270 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2023-11-06 22:35:41,385 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2023-11-06 22:35:41,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:41,737 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:35:41,856 WARN L1270 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2023-11-06 22:35:41,856 WARN L1270 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2023-11-06 22:35:41,859 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [1855] [2023-11-06 22:35:41,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1858] [2023-11-06 22:35:41,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1861] [2023-11-06 22:35:41,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1864] [2023-11-06 22:35:41,865 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; incl %0": "+m" (v->counter)); [1902] [2023-11-06 22:35:41,871 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2023-11-06 22:35:41,921 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:41,950 WARN L672 CHandler]: The function __bad_percpu_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:35:41,950 WARN L672 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:35:41,958 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:35:41,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:41 WrapperNode [2023-11-06 22:35:41,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:41,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:41,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:35:41,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:35:41,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:41" (1/1) ... [2023-11-06 22:35:41,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:41" (1/1) ... [2023-11-06 22:35:42,041 INFO L138 Inliner]: procedures = 114, calls = 301, calls flagged for inlining = 49, calls inlined = 38, statements flattened = 909 [2023-11-06 22:35:42,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:42,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:35:42,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:35:42,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:35:42,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:41" (1/1) ... [2023-11-06 22:35:42,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:41" (1/1) ... [2023-11-06 22:35:42,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:41" (1/1) ... [2023-11-06 22:35:42,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:41" (1/1) ... [2023-11-06 22:35:42,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:41" (1/1) ... [2023-11-06 22:35:42,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:41" (1/1) ... [2023-11-06 22:35:42,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:41" (1/1) ... [2023-11-06 22:35:42,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:41" (1/1) ... [2023-11-06 22:35:42,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:35:42,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:35:42,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:35:42,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:35:42,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:41" (1/1) ... [2023-11-06 22:35:42,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:42,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:35:42,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:35:42,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:35:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2023-11-06 22:35:42,229 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2023-11-06 22:35:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2023-11-06 22:35:42,230 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2023-11-06 22:35:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-06 22:35:42,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-06 22:35:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:35:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2023-11-06 22:35:42,230 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2023-11-06 22:35:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2023-11-06 22:35:42,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2023-11-06 22:35:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-06 22:35:42,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-06 22:35:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2023-11-06 22:35:42,232 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2023-11-06 22:35:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2023-11-06 22:35:42,233 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2023-11-06 22:35:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2023-11-06 22:35:42,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2023-11-06 22:35:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-06 22:35:42,234 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-06 22:35:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2023-11-06 22:35:42,235 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2023-11-06 22:35:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:35:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-06 22:35:42,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-06 22:35:42,236 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2023-11-06 22:35:42,236 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2023-11-06 22:35:42,237 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2023-11-06 22:35:42,237 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2023-11-06 22:35:42,237 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2023-11-06 22:35:42,237 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2023-11-06 22:35:42,237 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:35:42,237 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:35:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:35:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2023-11-06 22:35:42,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2023-11-06 22:35:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:35:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2023-11-06 22:35:42,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2023-11-06 22:35:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:35:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:35:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-06 22:35:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2023-11-06 22:35:42,239 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2023-11-06 22:35:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:35:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2023-11-06 22:35:42,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2023-11-06 22:35:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2023-11-06 22:35:42,240 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2023-11-06 22:35:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:35:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:35:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2023-11-06 22:35:42,241 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2023-11-06 22:35:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-06 22:35:42,241 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-06 22:35:42,241 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2023-11-06 22:35:42,242 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2023-11-06 22:35:42,242 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2023-11-06 22:35:42,243 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2023-11-06 22:35:42,243 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2023-11-06 22:35:42,244 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2023-11-06 22:35:42,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:35:42,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2023-11-06 22:35:42,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2023-11-06 22:35:42,244 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2023-11-06 22:35:42,245 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2023-11-06 22:35:42,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:35:42,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:35:42,548 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:35:42,552 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:35:42,789 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-06 22:35:43,551 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:35:43,570 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:35:43,570 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:35:43,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:43 BoogieIcfgContainer [2023-11-06 22:35:43,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:35:43,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:35:43,579 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:35:43,583 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:35:43,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:35:40" (1/3) ... [2023-11-06 22:35:43,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a069d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:43, skipping insertion in model container [2023-11-06 22:35:43,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:41" (2/3) ... [2023-11-06 22:35:43,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a069d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:43, skipping insertion in model container [2023-11-06 22:35:43,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:43" (3/3) ... [2023-11-06 22:35:43,588 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2023-11-06 22:35:43,607 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:35:43,607 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:35:43,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:35:43,682 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@147c5e13, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:35:43,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:35:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 369 states, 270 states have (on average 1.3962962962962964) internal successors, (377), 286 states have internal predecessors, (377), 70 states have call successors, (70), 28 states have call predecessors, (70), 27 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2023-11-06 22:35:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 22:35:43,710 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:43,710 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:43,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:43,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:43,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1751583657, now seen corresponding path program 1 times [2023-11-06 22:35:43,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:43,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475082198] [2023-11-06 22:35:43,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:43,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:44,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:44,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:35:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:44,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:35:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:44,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:35:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:35:44,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:44,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475082198] [2023-11-06 22:35:44,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475082198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:44,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:44,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:35:44,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568530376] [2023-11-06 22:35:44,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:44,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:35:44,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:44,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:35:44,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:35:44,624 INFO L87 Difference]: Start difference. First operand has 369 states, 270 states have (on average 1.3962962962962964) internal successors, (377), 286 states have internal predecessors, (377), 70 states have call successors, (70), 28 states have call predecessors, (70), 27 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:35:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:46,264 INFO L93 Difference]: Finished difference Result 1072 states and 1512 transitions. [2023-11-06 22:35:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:35:46,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2023-11-06 22:35:46,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:46,305 INFO L225 Difference]: With dead ends: 1072 [2023-11-06 22:35:46,305 INFO L226 Difference]: Without dead ends: 598 [2023-11-06 22:35:46,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:35:46,327 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 694 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:46,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 725 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:35:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2023-11-06 22:35:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 550. [2023-11-06 22:35:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 413 states have (on average 1.3728813559322033) internal successors, (567), 424 states have internal predecessors, (567), 95 states have call successors, (95), 46 states have call predecessors, (95), 41 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-06 22:35:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 752 transitions. [2023-11-06 22:35:46,501 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 752 transitions. Word has length 46 [2023-11-06 22:35:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:46,503 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 752 transitions. [2023-11-06 22:35:46,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:35:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 752 transitions. [2023-11-06 22:35:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-06 22:35:46,519 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:46,523 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:46,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:35:46,523 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:46,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2120468716, now seen corresponding path program 1 times [2023-11-06 22:35:46,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:46,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535804658] [2023-11-06 22:35:46,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:46,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:46,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:46,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:35:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:46,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:35:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:46,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:35:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:35:46,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:46,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535804658] [2023-11-06 22:35:46,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535804658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:46,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:46,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:35:46,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037056823] [2023-11-06 22:35:46,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:46,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:35:46,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:46,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:35:46,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:35:46,790 INFO L87 Difference]: Start difference. First operand 550 states and 752 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 22:35:47,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:47,624 INFO L93 Difference]: Finished difference Result 600 states and 824 transitions. [2023-11-06 22:35:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:35:47,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2023-11-06 22:35:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:47,630 INFO L225 Difference]: With dead ends: 600 [2023-11-06 22:35:47,630 INFO L226 Difference]: Without dead ends: 596 [2023-11-06 22:35:47,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:35:47,632 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 145 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:47,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 792 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:35:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2023-11-06 22:35:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 551. [2023-11-06 22:35:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 414 states have (on average 1.3695652173913044) internal successors, (567), 425 states have internal predecessors, (567), 95 states have call successors, (95), 46 states have call predecessors, (95), 41 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-06 22:35:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 752 transitions. [2023-11-06 22:35:47,682 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 752 transitions. Word has length 55 [2023-11-06 22:35:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:47,683 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 752 transitions. [2023-11-06 22:35:47,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 22:35:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 752 transitions. [2023-11-06 22:35:47,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-06 22:35:47,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:47,688 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:47,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:35:47,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:47,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:47,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1995774049, now seen corresponding path program 1 times [2023-11-06 22:35:47,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:47,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202362156] [2023-11-06 22:35:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:47,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:47,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:47,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:35:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:47,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:35:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:47,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:35:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:35:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:47,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202362156] [2023-11-06 22:35:47,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202362156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:47,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:47,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:35:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876523294] [2023-11-06 22:35:47,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:47,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:35:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:47,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:35:47,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:35:47,985 INFO L87 Difference]: Start difference. First operand 551 states and 752 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 22:35:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:49,405 INFO L93 Difference]: Finished difference Result 1628 states and 2285 transitions. [2023-11-06 22:35:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:35:49,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2023-11-06 22:35:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:49,420 INFO L225 Difference]: With dead ends: 1628 [2023-11-06 22:35:49,420 INFO L226 Difference]: Without dead ends: 1071 [2023-11-06 22:35:49,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:35:49,428 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 659 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:49,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1046 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:35:49,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2023-11-06 22:35:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 978. [2023-11-06 22:35:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 744 states have (on average 1.4018817204301075) internal successors, (1043), 768 states have internal predecessors, (1043), 162 states have call successors, (162), 71 states have call predecessors, (162), 71 states have return successors, (166), 150 states have call predecessors, (166), 157 states have call successors, (166) [2023-11-06 22:35:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1371 transitions. [2023-11-06 22:35:49,538 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1371 transitions. Word has length 57 [2023-11-06 22:35:49,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:49,541 INFO L495 AbstractCegarLoop]: Abstraction has 978 states and 1371 transitions. [2023-11-06 22:35:49,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 22:35:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1371 transitions. [2023-11-06 22:35:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-06 22:35:49,547 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:49,548 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:49,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:35:49,550 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:49,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:49,552 INFO L85 PathProgramCache]: Analyzing trace with hash -799235413, now seen corresponding path program 1 times [2023-11-06 22:35:49,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:49,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587497936] [2023-11-06 22:35:49,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:49,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:49,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:49,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:35:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:49,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:35:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:49,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:35:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:49,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:35:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:49,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:35:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:35:49,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:49,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587497936] [2023-11-06 22:35:49,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587497936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:49,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:49,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:35:49,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833464920] [2023-11-06 22:35:49,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:49,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:35:49,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:49,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:35:49,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:35:49,781 INFO L87 Difference]: Start difference. First operand 978 states and 1371 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:35:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:51,598 INFO L93 Difference]: Finished difference Result 2902 states and 4069 transitions. [2023-11-06 22:35:51,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:35:51,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 72 [2023-11-06 22:35:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:51,611 INFO L225 Difference]: With dead ends: 2902 [2023-11-06 22:35:51,612 INFO L226 Difference]: Without dead ends: 1944 [2023-11-06 22:35:51,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:35:51,616 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 1226 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:51,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 959 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-06 22:35:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2023-11-06 22:35:51,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1743. [2023-11-06 22:35:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1332 states have (on average 1.4016516516516517) internal successors, (1867), 1372 states have internal predecessors, (1867), 283 states have call successors, (283), 130 states have call predecessors, (283), 127 states have return successors, (282), 264 states have call predecessors, (282), 278 states have call successors, (282) [2023-11-06 22:35:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2432 transitions. [2023-11-06 22:35:51,794 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2432 transitions. Word has length 72 [2023-11-06 22:35:51,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:51,794 INFO L495 AbstractCegarLoop]: Abstraction has 1743 states and 2432 transitions. [2023-11-06 22:35:51,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:35:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2432 transitions. [2023-11-06 22:35:51,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 22:35:51,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:51,802 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:51,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:35:51,802 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:51,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash -35778441, now seen corresponding path program 1 times [2023-11-06 22:35:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:51,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600488408] [2023-11-06 22:35:51,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:51,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:51,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:35:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:51,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:35:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:51,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:35:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:51,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:35:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:51,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:35:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-06 22:35:51,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:51,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600488408] [2023-11-06 22:35:51,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600488408] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:51,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:51,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:35:51,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656632538] [2023-11-06 22:35:51,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:51,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:35:51,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:51,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:35:51,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:35:51,969 INFO L87 Difference]: Start difference. First operand 1743 states and 2432 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:35:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:53,159 INFO L93 Difference]: Finished difference Result 3642 states and 5100 transitions. [2023-11-06 22:35:53,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:35:53,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 76 [2023-11-06 22:35:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:53,175 INFO L225 Difference]: With dead ends: 3642 [2023-11-06 22:35:53,175 INFO L226 Difference]: Without dead ends: 1919 [2023-11-06 22:35:53,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:35:53,183 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 535 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:53,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 893 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:35:53,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2023-11-06 22:35:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1747. [2023-11-06 22:35:53,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1747 states, 1336 states have (on average 1.4004491017964071) internal successors, (1871), 1376 states have internal predecessors, (1871), 283 states have call successors, (283), 130 states have call predecessors, (283), 127 states have return successors, (282), 264 states have call predecessors, (282), 278 states have call successors, (282) [2023-11-06 22:35:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2436 transitions. [2023-11-06 22:35:53,377 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 2436 transitions. Word has length 76 [2023-11-06 22:35:53,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:53,378 INFO L495 AbstractCegarLoop]: Abstraction has 1747 states and 2436 transitions. [2023-11-06 22:35:53,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:35:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2436 transitions. [2023-11-06 22:35:53,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 22:35:53,386 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:53,387 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:53,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:35:53,387 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:53,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:53,388 INFO L85 PathProgramCache]: Analyzing trace with hash -388866823, now seen corresponding path program 1 times [2023-11-06 22:35:53,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:53,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037904171] [2023-11-06 22:35:53,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:53,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:53,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:53,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:35:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:53,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:35:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:53,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:35:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:53,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:35:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:53,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:35:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-06 22:35:53,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:53,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037904171] [2023-11-06 22:35:53,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037904171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:53,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:53,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:35:53,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879607315] [2023-11-06 22:35:53,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:53,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:35:53,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:53,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:35:53,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:35:53,688 INFO L87 Difference]: Start difference. First operand 1747 states and 2436 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:35:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:54,930 INFO L93 Difference]: Finished difference Result 3654 states and 5112 transitions. [2023-11-06 22:35:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:35:54,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 76 [2023-11-06 22:35:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:54,948 INFO L225 Difference]: With dead ends: 3654 [2023-11-06 22:35:54,948 INFO L226 Difference]: Without dead ends: 1867 [2023-11-06 22:35:54,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:35:54,956 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 298 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:54,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1424 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:35:54,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2023-11-06 22:35:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1695. [2023-11-06 22:35:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1304 states have (on average 1.4010736196319018) internal successors, (1827), 1344 states have internal predecessors, (1827), 263 states have call successors, (263), 130 states have call predecessors, (263), 127 states have return successors, (262), 244 states have call predecessors, (262), 258 states have call successors, (262) [2023-11-06 22:35:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2352 transitions. [2023-11-06 22:35:55,163 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2352 transitions. Word has length 76 [2023-11-06 22:35:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:55,164 INFO L495 AbstractCegarLoop]: Abstraction has 1695 states and 2352 transitions. [2023-11-06 22:35:55,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:35:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2352 transitions. [2023-11-06 22:35:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 22:35:55,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:55,167 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:55,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:35:55,167 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:55,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:55,168 INFO L85 PathProgramCache]: Analyzing trace with hash 991800454, now seen corresponding path program 1 times [2023-11-06 22:35:55,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:55,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564372749] [2023-11-06 22:35:55,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:55,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:55,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:55,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:35:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:55,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:35:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:55,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:35:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:35:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:55,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:35:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:35:55,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:55,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564372749] [2023-11-06 22:35:55,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564372749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:55,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:55,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:35:55,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545987831] [2023-11-06 22:35:55,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:55,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:35:55,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:55,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:35:55,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:35:55,327 INFO L87 Difference]: Start difference. First operand 1695 states and 2352 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:35:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:56,945 INFO L93 Difference]: Finished difference Result 5084 states and 7064 transitions. [2023-11-06 22:35:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:35:56,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 78 [2023-11-06 22:35:56,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:56,968 INFO L225 Difference]: With dead ends: 5084 [2023-11-06 22:35:56,969 INFO L226 Difference]: Without dead ends: 3409 [2023-11-06 22:35:56,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:35:56,975 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 846 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:56,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1014 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:35:56,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3409 states. [2023-11-06 22:35:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3409 to 3044. [2023-11-06 22:35:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 2338 states have (on average 1.3956372968349016) internal successors, (3263), 2414 states have internal predecessors, (3263), 468 states have call successors, (468), 238 states have call predecessors, (468), 237 states have return successors, (471), 435 states have call predecessors, (471), 463 states have call successors, (471) [2023-11-06 22:35:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 4202 transitions. [2023-11-06 22:35:57,302 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 4202 transitions. Word has length 78 [2023-11-06 22:35:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:57,303 INFO L495 AbstractCegarLoop]: Abstraction has 3044 states and 4202 transitions. [2023-11-06 22:35:57,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:35:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 4202 transitions. [2023-11-06 22:35:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-06 22:35:57,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:57,312 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:57,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:35:57,312 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:57,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:57,313 INFO L85 PathProgramCache]: Analyzing trace with hash -891125475, now seen corresponding path program 1 times [2023-11-06 22:35:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:57,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659837148] [2023-11-06 22:35:57,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:57,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:57,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:57,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:35:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:57,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:35:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:57,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:35:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:57,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:35:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:57,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:35:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:57,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:35:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:57,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:35:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:57,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:35:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:57,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:35:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:57,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:35:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:57,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:35:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:57,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:35:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-06 22:35:57,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:57,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659837148] [2023-11-06 22:35:57,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659837148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:57,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:57,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:35:57,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15606460] [2023-11-06 22:35:57,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:57,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:35:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:57,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:35:57,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:35:57,670 INFO L87 Difference]: Start difference. First operand 3044 states and 4202 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:35:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:59,165 INFO L93 Difference]: Finished difference Result 6400 states and 8868 transitions. [2023-11-06 22:35:59,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:35:59,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2023-11-06 22:35:59,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:59,192 INFO L225 Difference]: With dead ends: 6400 [2023-11-06 22:35:59,193 INFO L226 Difference]: Without dead ends: 3376 [2023-11-06 22:35:59,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:35:59,202 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 985 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:59,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 1071 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:35:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2023-11-06 22:35:59,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3044. [2023-11-06 22:35:59,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 2338 states have (on average 1.3922155688622755) internal successors, (3255), 2414 states have internal predecessors, (3255), 468 states have call successors, (468), 238 states have call predecessors, (468), 237 states have return successors, (471), 435 states have call predecessors, (471), 463 states have call successors, (471) [2023-11-06 22:35:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 4194 transitions. [2023-11-06 22:35:59,610 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 4194 transitions. Word has length 123 [2023-11-06 22:35:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:59,611 INFO L495 AbstractCegarLoop]: Abstraction has 3044 states and 4194 transitions. [2023-11-06 22:35:59,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:35:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 4194 transitions. [2023-11-06 22:35:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-06 22:35:59,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:59,619 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:59,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:35:59,619 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:59,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1452359730, now seen corresponding path program 1 times [2023-11-06 22:35:59,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:59,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213908259] [2023-11-06 22:35:59,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:59,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:59,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:59,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:35:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:59,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:35:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:35:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:35:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:59,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 22:35:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:59,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:35:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:59,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:35:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:59,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:35:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:59,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:35:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:35:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:59,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:35:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:59,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:35:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:35:59,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:59,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213908259] [2023-11-06 22:35:59,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213908259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:59,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:59,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:35:59,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154830531] [2023-11-06 22:35:59,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:59,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:35:59,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:59,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:35:59,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:35:59,915 INFO L87 Difference]: Start difference. First operand 3044 states and 4194 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:36:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:36:02,468 INFO L93 Difference]: Finished difference Result 8131 states and 11280 transitions. [2023-11-06 22:36:02,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:36:02,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2023-11-06 22:36:02,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:36:02,504 INFO L225 Difference]: With dead ends: 8131 [2023-11-06 22:36:02,504 INFO L226 Difference]: Without dead ends: 5107 [2023-11-06 22:36:02,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:36:02,516 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 1057 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:36:02,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 1611 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-06 22:36:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5107 states. [2023-11-06 22:36:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5107 to 4574. [2023-11-06 22:36:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4574 states, 3532 states have (on average 1.3870328425821064) internal successors, (4899), 3648 states have internal predecessors, (4899), 687 states have call successors, (687), 353 states have call predecessors, (687), 354 states have return successors, (694), 640 states have call predecessors, (694), 682 states have call successors, (694) [2023-11-06 22:36:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 6280 transitions. [2023-11-06 22:36:03,080 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 6280 transitions. Word has length 126 [2023-11-06 22:36:03,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:36:03,082 INFO L495 AbstractCegarLoop]: Abstraction has 4574 states and 6280 transitions. [2023-11-06 22:36:03,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:36:03,083 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 6280 transitions. [2023-11-06 22:36:03,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-06 22:36:03,093 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:36:03,094 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:03,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:36:03,095 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:36:03,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:03,095 INFO L85 PathProgramCache]: Analyzing trace with hash -450863113, now seen corresponding path program 1 times [2023-11-06 22:36:03,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:03,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322208344] [2023-11-06 22:36:03,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:03,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:03,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:36:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:03,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:36:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:03,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:36:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:03,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:36:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:03,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:03,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 22:36:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:03,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:36:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:03,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:36:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:03,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:36:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:36:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:03,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:03,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:36:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:36:03,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:03,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322208344] [2023-11-06 22:36:03,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322208344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:03,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:03,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:36:03,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040212143] [2023-11-06 22:36:03,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:03,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:36:03,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:03,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:36:03,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:36:03,381 INFO L87 Difference]: Start difference. First operand 4574 states and 6280 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:36:06,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:36:06,011 INFO L93 Difference]: Finished difference Result 12197 states and 16868 transitions. [2023-11-06 22:36:06,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:36:06,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2023-11-06 22:36:06,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:36:06,089 INFO L225 Difference]: With dead ends: 12197 [2023-11-06 22:36:06,089 INFO L226 Difference]: Without dead ends: 7643 [2023-11-06 22:36:06,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:36:06,110 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 874 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:36:06,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 1600 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-06 22:36:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7643 states. [2023-11-06 22:36:07,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7643 to 6862. [2023-11-06 22:36:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6862 states, 5325 states have (on average 1.3823474178403756) internal successors, (7361), 5501 states have internal predecessors, (7361), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 528 states have return successors, (1021), 940 states have call predecessors, (1021), 1003 states have call successors, (1021) [2023-11-06 22:36:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6862 states to 6862 states and 9390 transitions. [2023-11-06 22:36:07,110 INFO L78 Accepts]: Start accepts. Automaton has 6862 states and 9390 transitions. Word has length 132 [2023-11-06 22:36:07,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:36:07,110 INFO L495 AbstractCegarLoop]: Abstraction has 6862 states and 9390 transitions. [2023-11-06 22:36:07,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:36:07,112 INFO L276 IsEmpty]: Start isEmpty. Operand 6862 states and 9390 transitions. [2023-11-06 22:36:07,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 22:36:07,122 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:36:07,123 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:07,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:36:07,123 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:36:07,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:07,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2051363964, now seen corresponding path program 1 times [2023-11-06 22:36:07,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:07,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266502764] [2023-11-06 22:36:07,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:07,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:07,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:36:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:07,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:36:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:07,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:36:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:07,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:36:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:07,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:07,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 22:36:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:07,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:07,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:36:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:07,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:36:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:07,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:36:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:07,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:36:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:07,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:07,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 22:36:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:36:07,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:07,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266502764] [2023-11-06 22:36:07,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266502764] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:36:07,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293777831] [2023-11-06 22:36:07,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:07,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:36:07,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:36:07,609 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:36:07,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:36:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:08,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:36:08,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:36:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:36:08,103 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:36:08,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293777831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:08,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:36:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-11-06 22:36:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149712916] [2023-11-06 22:36:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:08,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:36:08,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:08,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:36:08,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:36:08,106 INFO L87 Difference]: Start difference. First operand 6862 states and 9390 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:36:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:36:08,896 INFO L93 Difference]: Finished difference Result 13812 states and 18919 transitions. [2023-11-06 22:36:08,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:36:08,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 136 [2023-11-06 22:36:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:36:08,941 INFO L225 Difference]: With dead ends: 13812 [2023-11-06 22:36:08,941 INFO L226 Difference]: Without dead ends: 6808 [2023-11-06 22:36:08,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:36:08,961 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 4 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:36:08,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1839 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:36:08,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6808 states. [2023-11-06 22:36:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6808 to 6808. [2023-11-06 22:36:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6808 states, 5271 states have (on average 1.3794346423828496) internal successors, (7271), 5456 states have internal predecessors, (7271), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 528 states have return successors, (1012), 931 states have call predecessors, (1012), 994 states have call successors, (1012) [2023-11-06 22:36:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6808 states to 6808 states and 9291 transitions. [2023-11-06 22:36:09,709 INFO L78 Accepts]: Start accepts. Automaton has 6808 states and 9291 transitions. Word has length 136 [2023-11-06 22:36:09,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:36:09,710 INFO L495 AbstractCegarLoop]: Abstraction has 6808 states and 9291 transitions. [2023-11-06 22:36:09,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:36:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 6808 states and 9291 transitions. [2023-11-06 22:36:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 22:36:09,722 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:36:09,722 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:09,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:36:09,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 22:36:09,929 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:36:09,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:09,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1035260179, now seen corresponding path program 1 times [2023-11-06 22:36:09,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:09,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998182675] [2023-11-06 22:36:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:10,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:36:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:10,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:36:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:10,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:36:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:10,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:36:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:10,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:10,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 22:36:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:10,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:10,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:36:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:10,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:36:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:10,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:36:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:10,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:36:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:10,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:10,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:36:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:36:10,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:10,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998182675] [2023-11-06 22:36:10,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998182675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:10,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:10,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:36:10,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537308029] [2023-11-06 22:36:10,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:10,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:36:10,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:10,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:36:10,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:36:10,229 INFO L87 Difference]: Start difference. First operand 6808 states and 9291 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:36:12,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:36:12,239 INFO L93 Difference]: Finished difference Result 14302 states and 19592 transitions. [2023-11-06 22:36:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:36:12,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 138 [2023-11-06 22:36:12,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:36:12,280 INFO L225 Difference]: With dead ends: 14302 [2023-11-06 22:36:12,281 INFO L226 Difference]: Without dead ends: 7514 [2023-11-06 22:36:12,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:36:12,304 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 1110 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:36:12,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 659 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:36:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7514 states. [2023-11-06 22:36:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7514 to 6772. [2023-11-06 22:36:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6772 states, 5235 states have (on average 1.3751671442215856) internal successors, (7199), 5420 states have internal predecessors, (7199), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 528 states have return successors, (1012), 931 states have call predecessors, (1012), 994 states have call successors, (1012) [2023-11-06 22:36:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6772 states to 6772 states and 9219 transitions. [2023-11-06 22:36:13,121 INFO L78 Accepts]: Start accepts. Automaton has 6772 states and 9219 transitions. Word has length 138 [2023-11-06 22:36:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:36:13,122 INFO L495 AbstractCegarLoop]: Abstraction has 6772 states and 9219 transitions. [2023-11-06 22:36:13,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:36:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 6772 states and 9219 transitions. [2023-11-06 22:36:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 22:36:13,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:36:13,133 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:13,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:36:13,133 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:36:13,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:13,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1429383226, now seen corresponding path program 1 times [2023-11-06 22:36:13,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:13,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863129419] [2023-11-06 22:36:13,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:13,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:13,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:36:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:13,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:36:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:13,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:36:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:13,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:36:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:13,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:13,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 22:36:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:13,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:13,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:36:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:13,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:36:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:13,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:36:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:13,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 22:36:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:13,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:13,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 22:36:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:36:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863129419] [2023-11-06 22:36:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863129419] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:36:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338094841] [2023-11-06 22:36:13,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:13,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:36:13,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:36:13,465 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:36:13,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:36:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:13,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:36:13,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:36:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:36:14,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:36:14,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338094841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:14,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:36:14,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2023-11-06 22:36:14,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028369180] [2023-11-06 22:36:14,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:14,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:36:14,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:14,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:36:14,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:36:14,048 INFO L87 Difference]: Start difference. First operand 6772 states and 9219 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-06 22:36:15,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:36:15,728 INFO L93 Difference]: Finished difference Result 20251 states and 27580 transitions. [2023-11-06 22:36:15,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:36:15,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 139 [2023-11-06 22:36:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:36:15,814 INFO L225 Difference]: With dead ends: 20251 [2023-11-06 22:36:15,814 INFO L226 Difference]: Without dead ends: 20220 [2023-11-06 22:36:15,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:36:15,823 INFO L413 NwaCegarLoop]: 824 mSDtfsCounter, 801 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:36:15,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 1597 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:36:15,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20220 states. [2023-11-06 22:36:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20220 to 20070. [2023-11-06 22:36:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20070 states, 15493 states have (on average 1.3790744207061254) internal successors, (21366), 16048 states have internal predecessors, (21366), 3000 states have call successors, (3000), 1554 states have call predecessors, (3000), 1576 states have return successors, (3022), 2779 states have call predecessors, (3022), 2968 states have call successors, (3022) [2023-11-06 22:36:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20070 states to 20070 states and 27388 transitions. [2023-11-06 22:36:17,997 INFO L78 Accepts]: Start accepts. Automaton has 20070 states and 27388 transitions. Word has length 139 [2023-11-06 22:36:17,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:36:17,997 INFO L495 AbstractCegarLoop]: Abstraction has 20070 states and 27388 transitions. [2023-11-06 22:36:17,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-11-06 22:36:17,998 INFO L276 IsEmpty]: Start isEmpty. Operand 20070 states and 27388 transitions. [2023-11-06 22:36:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-06 22:36:18,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:36:18,027 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:18,039 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 22:36:18,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4365d89-1857-4512-babc-2ed85f12b368/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 22:36:18,235 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:36:18,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:18,235 INFO L85 PathProgramCache]: Analyzing trace with hash -130332953, now seen corresponding path program 1 times [2023-11-06 22:36:18,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:18,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195646163] [2023-11-06 22:36:18,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:18,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:18,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:36:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:18,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:36:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:18,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:36:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:18,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:36:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:18,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:18,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 22:36:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:18,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:18,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:36:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:18,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:36:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:18,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:36:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:18,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 22:36:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:18,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:18,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:36:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:36:18,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:18,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195646163] [2023-11-06 22:36:18,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195646163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:18,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:36:18,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345654784] [2023-11-06 22:36:18,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:18,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:36:18,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:36:18,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:36:18,504 INFO L87 Difference]: Start difference. First operand 20070 states and 27388 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:36:20,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:36:20,361 INFO L93 Difference]: Finished difference Result 26694 states and 36623 transitions. [2023-11-06 22:36:20,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:36:20,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 148 [2023-11-06 22:36:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:36:20,390 INFO L225 Difference]: With dead ends: 26694 [2023-11-06 22:36:20,390 INFO L226 Difference]: Without dead ends: 6457 [2023-11-06 22:36:20,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:36:20,440 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 778 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:36:20,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1162 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 22:36:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6457 states. [2023-11-06 22:36:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6457 to 6324. [2023-11-06 22:36:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6324 states, 5056 states have (on average 1.4026898734177216) internal successors, (7092), 5179 states have internal predecessors, (7092), 804 states have call successors, (804), 468 states have call predecessors, (804), 463 states have return successors, (799), 784 states have call predecessors, (799), 799 states have call successors, (799) [2023-11-06 22:36:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6324 states to 6324 states and 8695 transitions. [2023-11-06 22:36:21,100 INFO L78 Accepts]: Start accepts. Automaton has 6324 states and 8695 transitions. Word has length 148 [2023-11-06 22:36:21,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:36:21,101 INFO L495 AbstractCegarLoop]: Abstraction has 6324 states and 8695 transitions. [2023-11-06 22:36:21,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:36:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 6324 states and 8695 transitions. [2023-11-06 22:36:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-06 22:36:21,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:36:21,118 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:21,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:36:21,119 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:36:21,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:21,120 INFO L85 PathProgramCache]: Analyzing trace with hash 703974396, now seen corresponding path program 1 times [2023-11-06 22:36:21,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:21,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141640339] [2023-11-06 22:36:21,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:21,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:21,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:36:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:21,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:36:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:21,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:36:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:21,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:36:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:21,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:21,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 22:36:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:21,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:21,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:36:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:36:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:21,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:36:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:21,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 22:36:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:21,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:21,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:36:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-06 22:36:21,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:21,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141640339] [2023-11-06 22:36:21,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141640339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:21,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:21,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:36:21,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022662124] [2023-11-06 22:36:21,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:21,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:36:21,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:21,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:36:21,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:36:21,483 INFO L87 Difference]: Start difference. First operand 6324 states and 8695 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:36:23,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:36:23,145 INFO L93 Difference]: Finished difference Result 12902 states and 17782 transitions. [2023-11-06 22:36:23,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:36:23,146 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 148 [2023-11-06 22:36:23,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:36:23,270 INFO L225 Difference]: With dead ends: 12902 [2023-11-06 22:36:23,271 INFO L226 Difference]: Without dead ends: 6598 [2023-11-06 22:36:23,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:36:23,280 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 622 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:36:23,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 992 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:36:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6598 states. [2023-11-06 22:36:23,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6598 to 6327. [2023-11-06 22:36:23,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6327 states, 5059 states have (on average 1.4024510772880017) internal successors, (7095), 5182 states have internal predecessors, (7095), 804 states have call successors, (804), 468 states have call predecessors, (804), 463 states have return successors, (799), 784 states have call predecessors, (799), 799 states have call successors, (799) [2023-11-06 22:36:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6327 states to 6327 states and 8698 transitions. [2023-11-06 22:36:23,849 INFO L78 Accepts]: Start accepts. Automaton has 6327 states and 8698 transitions. Word has length 148 [2023-11-06 22:36:23,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:36:23,849 INFO L495 AbstractCegarLoop]: Abstraction has 6327 states and 8698 transitions. [2023-11-06 22:36:23,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:36:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 6327 states and 8698 transitions. [2023-11-06 22:36:23,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-06 22:36:23,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:36:23,866 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:23,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:36:23,866 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:36:23,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:23,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1972587555, now seen corresponding path program 1 times [2023-11-06 22:36:23,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:23,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869161751] [2023-11-06 22:36:23,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:23,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:24,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:36:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:24,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:36:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:24,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:36:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:24,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:36:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:24,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:24,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:36:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:24,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:24,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:36:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:24,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:36:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:36:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:24,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:36:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:24,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:36:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:24,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:36:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-06 22:36:24,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:24,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869161751] [2023-11-06 22:36:24,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869161751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:24,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:24,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:36:24,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038329534] [2023-11-06 22:36:24,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:24,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:36:24,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:24,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:36:24,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:36:24,499 INFO L87 Difference]: Start difference. First operand 6327 states and 8698 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:36:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:36:25,852 INFO L93 Difference]: Finished difference Result 7032 states and 9615 transitions. [2023-11-06 22:36:25,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:36:25,853 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 150 [2023-11-06 22:36:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:36:25,853 INFO L225 Difference]: With dead ends: 7032 [2023-11-06 22:36:25,854 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:36:25,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:36:25,865 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 562 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:36:25,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 679 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:36:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:36:25,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:36:25,867 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) [2023-11-06 22:36:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:36:25,868 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 150 [2023-11-06 22:36:25,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:36:25,869 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:36:25,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:36:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:36:25,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:36:25,872 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:36:25,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:36:25,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:37:11,747 WARN L293 SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 84 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:37:18,486 WARN L293 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 84 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:37:24,888 WARN L293 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 82 DAG size of output: 61 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:37:31,392 WARN L293 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 84 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:37:37,586 WARN L293 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 82 DAG size of output: 61 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:37:44,011 WARN L293 SmtUtils]: Spent 6.42s on a formula simplification. DAG size of input: 84 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:38:24,206 WARN L293 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 84 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:38:30,759 WARN L293 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 84 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:38:37,619 WARN L293 SmtUtils]: Spent 6.86s on a formula simplification. DAG size of input: 82 DAG size of output: 61 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:38:44,673 WARN L293 SmtUtils]: Spent 7.05s on a formula simplification. DAG size of input: 84 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:38:50,635 WARN L293 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 82 DAG size of output: 61 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:38:56,703 WARN L293 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 84 DAG size of output: 66 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)