./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:26:45,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:26:45,868 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:26:45,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:26:45,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:26:45,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:26:45,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:26:45,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:26:45,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:26:45,909 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:26:45,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:26:45,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:26:45,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:26:45,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:26:45,913 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:26:45,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:26:45,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:26:45,914 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:26:45,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:26:45,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:26:45,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:26:45,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:26:45,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:26:45,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:26:45,918 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:26:45,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:26:45,919 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:26:45,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:26:45,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:26:45,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:26:45,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:26:45,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:26:45,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:26:45,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:26:45,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:26:45,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:26:45,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:26:45,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:26:45,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:26:45,922 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:26:45,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:26:45,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:26:45,923 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_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/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_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 [2023-11-29 01:26:46,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:26:46,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:26:46,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:26:46,183 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:26:46,183 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:26:46,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/forester-heap/sll-circular-1.i [2023-11-29 01:26:48,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:26:49,171 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:26:49,171 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/sv-benchmarks/c/forester-heap/sll-circular-1.i [2023-11-29 01:26:49,185 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/data/077b7dcab/74141a7ef4da4dfabe05be6f907d0e52/FLAG5d405a2f7 [2023-11-29 01:26:49,198 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/data/077b7dcab/74141a7ef4da4dfabe05be6f907d0e52 [2023-11-29 01:26:49,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:26:49,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:26:49,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:26:49,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:26:49,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:26:49,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:26:49" (1/1) ... [2023-11-29 01:26:49,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360b1f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:26:49, skipping insertion in model container [2023-11-29 01:26:49,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:26:49" (1/1) ... [2023-11-29 01:26:49,251 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:26:49,479 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_b8740bd9-8953-4798-a3cc-1a571e569196/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2023-11-29 01:26:49,485 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_b8740bd9-8953-4798-a3cc-1a571e569196/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2023-11-29 01:26:49,486 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_b8740bd9-8953-4798-a3cc-1a571e569196/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2023-11-29 01:26:49,490 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:26:49,499 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:26:49,531 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_b8740bd9-8953-4798-a3cc-1a571e569196/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2023-11-29 01:26:49,532 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_b8740bd9-8953-4798-a3cc-1a571e569196/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2023-11-29 01:26:49,534 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_b8740bd9-8953-4798-a3cc-1a571e569196/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2023-11-29 01:26:49,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:26:49,561 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:26:49,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:26:49 WrapperNode [2023-11-29 01:26:49,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:26:49,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:26:49,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:26:49,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:26:49,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:26:49" (1/1) ... [2023-11-29 01:26:49,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:26:49" (1/1) ... [2023-11-29 01:26:49,601 INFO L138 Inliner]: procedures = 119, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 114 [2023-11-29 01:26:49,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:26:49,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:26:49,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:26:49,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:26:49,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:26:49" (1/1) ... [2023-11-29 01:26:49,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:26:49" (1/1) ... [2023-11-29 01:26:49,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:26:49" (1/1) ... [2023-11-29 01:26:49,634 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2023-11-29 01:26:49,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:26:49" (1/1) ... [2023-11-29 01:26:49,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:26:49" (1/1) ... [2023-11-29 01:26:49,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:26:49" (1/1) ... [2023-11-29 01:26:49,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:26:49" (1/1) ... [2023-11-29 01:26:49,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:26:49" (1/1) ... [2023-11-29 01:26:49,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:26:49" (1/1) ... [2023-11-29 01:26:49,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:26:49,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:26:49,663 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:26:49,663 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:26:49,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:26:49" (1/1) ... [2023-11-29 01:26:49,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:26:49,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:26:49,722 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:26:49,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:26:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 01:26:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 01:26:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:26:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:26:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:26:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:26:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:26:49,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:26:49,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:26:49,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:26:49,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:26:49,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:26:49,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:26:49,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:26:49,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:26:49,865 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:26:49,867 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:26:50,020 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:26:50,042 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:26:50,042 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-29 01:26:50,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:26:50 BoogieIcfgContainer [2023-11-29 01:26:50,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:26:50,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:26:50,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:26:50,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:26:50,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:26:49" (1/3) ... [2023-11-29 01:26:50,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77607819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:26:50, skipping insertion in model container [2023-11-29 01:26:50,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:26:49" (2/3) ... [2023-11-29 01:26:50,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77607819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:26:50, skipping insertion in model container [2023-11-29 01:26:50,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:26:50" (3/3) ... [2023-11-29 01:26:50,051 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2023-11-29 01:26:50,068 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:26:50,068 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-29 01:26:50,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:26:50,113 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23a1d70a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:26:50,113 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-29 01:26:50,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 29 states have internal predecessors, (48), 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-29 01:26:50,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 01:26:50,120 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:26:50,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:26:50,121 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:26:50,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:26:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash 149304739, now seen corresponding path program 1 times [2023-11-29 01:26:50,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:26:50,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131263565] [2023-11-29 01:26:50,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:26:50,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:26:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:26:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:26:50,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:26:50,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131263565] [2023-11-29 01:26:50,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131263565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:26:50,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:26:50,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:26:50,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945935682] [2023-11-29 01:26:50,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:26:50,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:26:50,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:26:50,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:26:50,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:26:50,338 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 29 states have internal predecessors, (48), 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-29 01:26:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:26:50,363 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2023-11-29 01:26:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:26:50,365 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2023-11-29 01:26:50,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:26:50,372 INFO L225 Difference]: With dead ends: 59 [2023-11-29 01:26:50,372 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 01:26:50,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:26:50,378 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:26:50,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:26:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 01:26:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-29 01:26:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 24 states have internal predecessors, (30), 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-29 01:26:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-11-29 01:26:50,407 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 5 [2023-11-29 01:26:50,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:26:50,407 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-11-29 01:26:50,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-29 01:26:50,408 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-11-29 01:26:50,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 01:26:50,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:26:50,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 01:26:50,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:26:50,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:26:50,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:26:50,410 INFO L85 PathProgramCache]: Analyzing trace with hash 292511250, now seen corresponding path program 1 times [2023-11-29 01:26:50,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:26:50,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365073821] [2023-11-29 01:26:50,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:26:50,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:26:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:26:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:26:50,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:26:50,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365073821] [2023-11-29 01:26:50,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365073821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:26:50,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:26:50,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:26:50,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802548984] [2023-11-29 01:26:50,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:26:50,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:26:50,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:26:50,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:26:50,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:26:50,703 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-29 01:26:50,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:26:50,773 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-11-29 01:26:50,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:26:50,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2023-11-29 01:26:50,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:26:50,775 INFO L225 Difference]: With dead ends: 41 [2023-11-29 01:26:50,775 INFO L226 Difference]: Without dead ends: 37 [2023-11-29 01:26:50,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-29 01:26:50,777 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:26:50,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 43 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:26:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-29 01:26:50,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2023-11-29 01:26:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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-29 01:26:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-11-29 01:26:50,785 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 6 [2023-11-29 01:26:50,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:26:50,785 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-11-29 01:26:50,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-29 01:26:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-11-29 01:26:50,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 01:26:50,786 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:26:50,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:26:50,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:26:50,787 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:26:50,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:26:50,787 INFO L85 PathProgramCache]: Analyzing trace with hash 393679078, now seen corresponding path program 1 times [2023-11-29 01:26:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:26:50,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288335341] [2023-11-29 01:26:50,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:26:50,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:26:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:26:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:26:50,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:26:50,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288335341] [2023-11-29 01:26:50,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288335341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:26:50,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:26:50,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:26:50,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862712681] [2023-11-29 01:26:50,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:26:50,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:26:50,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:26:50,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:26:50,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:26:50,862 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-29 01:26:50,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:26:50,890 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2023-11-29 01:26:50,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:26:50,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2023-11-29 01:26:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:26:50,893 INFO L225 Difference]: With dead ends: 70 [2023-11-29 01:26:50,894 INFO L226 Difference]: Without dead ends: 48 [2023-11-29 01:26:50,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:26:50,898 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:26:50,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 45 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:26:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-29 01:26:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2023-11-29 01:26:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 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-29 01:26:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2023-11-29 01:26:50,931 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 9 [2023-11-29 01:26:50,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:26:50,931 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2023-11-29 01:26:50,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-29 01:26:50,932 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2023-11-29 01:26:50,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:26:50,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:26:50,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:26:50,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:26:50,934 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:26:50,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:26:50,938 INFO L85 PathProgramCache]: Analyzing trace with hash -659012930, now seen corresponding path program 1 times [2023-11-29 01:26:50,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:26:50,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548311735] [2023-11-29 01:26:50,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:26:50,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:26:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:26:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:26:50,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:26:50,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548311735] [2023-11-29 01:26:50,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548311735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:26:50,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:26:50,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:26:50,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407784378] [2023-11-29 01:26:50,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:26:50,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:26:50,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:26:50,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:26:50,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:26:50,979 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-29 01:26:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:26:50,995 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2023-11-29 01:26:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:26:50,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2023-11-29 01:26:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:26:50,997 INFO L225 Difference]: With dead ends: 37 [2023-11-29 01:26:50,997 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 01:26:50,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:26:50,998 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:26:50,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:26:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 01:26:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-29 01:26:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 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-29 01:26:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2023-11-29 01:26:51,006 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 12 [2023-11-29 01:26:51,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:26:51,006 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2023-11-29 01:26:51,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-29 01:26:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2023-11-29 01:26:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:26:51,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:26:51,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:26:51,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:26:51,008 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:26:51,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:26:51,008 INFO L85 PathProgramCache]: Analyzing trace with hash -659011008, now seen corresponding path program 1 times [2023-11-29 01:26:51,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:26:51,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620171513] [2023-11-29 01:26:51,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:26:51,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:26:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:26:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:26:51,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:26:51,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620171513] [2023-11-29 01:26:51,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620171513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:26:51,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:26:51,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:26:51,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699355846] [2023-11-29 01:26:51,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:26:51,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:26:51,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:26:51,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:26:51,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:26:51,378 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-29 01:26:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:26:51,498 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-11-29 01:26:51,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:26:51,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2023-11-29 01:26:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:26:51,499 INFO L225 Difference]: With dead ends: 46 [2023-11-29 01:26:51,500 INFO L226 Difference]: Without dead ends: 33 [2023-11-29 01:26:51,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:26:51,501 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:26:51,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:26:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-29 01:26:51,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-29 01:26:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 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-29 01:26:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2023-11-29 01:26:51,507 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 12 [2023-11-29 01:26:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:26:51,507 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2023-11-29 01:26:51,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-29 01:26:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2023-11-29 01:26:51,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:26:51,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:26:51,508 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:26:51,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:26:51,509 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:26:51,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:26:51,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1208969863, now seen corresponding path program 1 times [2023-11-29 01:26:51,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:26:51,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706806493] [2023-11-29 01:26:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:26:51,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:26:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:26:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:26:51,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:26:51,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706806493] [2023-11-29 01:26:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706806493] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:26:51,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762515811] [2023-11-29 01:26:51,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:26:51,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:26:51,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:26:51,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:26:51,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:26:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:26:51,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 01:26:51,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:26:51,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:26:51,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-29 01:26:51,913 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 01:26:51,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 01:26:51,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:26:51,944 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:26:51,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 01:26:51,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:26:52,057 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:26:52,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-29 01:26:52,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 01:26:52,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:26:52,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:26:52,081 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_185 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-11-29 01:26:52,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:26:52,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-11-29 01:26:52,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:26:52,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2023-11-29 01:26:52,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-29 01:26:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:26:52,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762515811] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:26:52,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:26:52,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-11-29 01:26:52,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540746024] [2023-11-29 01:26:52,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:26:52,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:26:52,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:26:52,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:26:52,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2023-11-29 01:26:52,281 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-29 01:26:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:26:52,384 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2023-11-29 01:26:52,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:26:52,385 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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) Word has length 12 [2023-11-29 01:26:52,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:26:52,386 INFO L225 Difference]: With dead ends: 60 [2023-11-29 01:26:52,386 INFO L226 Difference]: Without dead ends: 58 [2023-11-29 01:26:52,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=48, Unknown=1, NotChecked=14, Total=90 [2023-11-29 01:26:52,387 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:26:52,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 86 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2023-11-29 01:26:52,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-29 01:26:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2023-11-29 01:26:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 46 states have internal predecessors, (57), 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-29 01:26:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2023-11-29 01:26:52,397 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 12 [2023-11-29 01:26:52,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:26:52,397 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2023-11-29 01:26:52,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-29 01:26:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2023-11-29 01:26:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 01:26:52,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:26:52,398 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:26:52,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:26:52,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 01:26:52,601 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:26:52,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:26:52,601 INFO L85 PathProgramCache]: Analyzing trace with hash 292973760, now seen corresponding path program 1 times [2023-11-29 01:26:52,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:26:52,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139445285] [2023-11-29 01:26:52,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:26:52,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:26:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:26:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:26:52,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:26:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139445285] [2023-11-29 01:26:52,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139445285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:26:52,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:26:52,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:26:52,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340562112] [2023-11-29 01:26:52,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:26:52,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:26:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:26:52,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:26:52,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:26:52,659 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-29 01:26:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:26:52,682 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2023-11-29 01:26:52,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:26:52,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) Word has length 16 [2023-11-29 01:26:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:26:52,684 INFO L225 Difference]: With dead ends: 95 [2023-11-29 01:26:52,684 INFO L226 Difference]: Without dead ends: 72 [2023-11-29 01:26:52,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:26:52,685 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:26:52,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 67 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:26:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-29 01:26:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2023-11-29 01:26:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 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-29 01:26:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2023-11-29 01:26:52,695 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 16 [2023-11-29 01:26:52,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:26:52,696 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2023-11-29 01:26:52,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-29 01:26:52,696 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2023-11-29 01:26:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 01:26:52,697 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:26:52,697 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:26:52,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:26:52,697 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:26:52,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:26:52,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1890030859, now seen corresponding path program 1 times [2023-11-29 01:26:52,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:26:52,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917509144] [2023-11-29 01:26:52,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:26:52,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:26:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:26:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:26:53,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:26:53,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917509144] [2023-11-29 01:26:53,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917509144] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:26:53,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79101237] [2023-11-29 01:26:53,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:26:53,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:26:53,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:26:53,451 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:26:53,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8740bd9-8953-4798-a3cc-1a571e569196/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:26:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:26:53,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-29 01:26:53,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:26:53,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:26:53,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:26:53,633 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:26:53,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 01:26:53,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2023-11-29 01:26:53,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-11-29 01:26:53,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 01:26:53,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 01:26:53,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 01:26:53,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 01:26:53,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 01:26:53,943 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:26:53,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 66 [2023-11-29 01:26:53,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:26:53,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2023-11-29 01:26:54,185 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:26:54,185 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:26:54,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2023-11-29 01:26:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:26:54,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:26:54,288 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_328 (Array Int Int)) (v_ArrVal_329 (Array Int Int)) (v_ArrVal_327 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (or (not (= v_ArrVal_328 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (select v_ArrVal_328 .cse0)))) (= (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 v_ArrVal_327))) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_328))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_329) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))) 0)))) is different from false [2023-11-29 01:26:54,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:26:54,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 152 [2023-11-29 01:26:54,543 INFO L349 Elim1Store]: treesize reduction 66, result has 50.7 percent of original size [2023-11-29 01:26:54,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 60826 treesize of output 59145 [2023-11-29 01:26:58,531 INFO L349 Elim1Store]: treesize reduction 78, result has 76.9 percent of original size [2023-11-29 01:26:58,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 73264 treesize of output 59552