./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB --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 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:54:02,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:54:03,030 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 19:54:03,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:54:03,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:54:03,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:54:03,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:54:03,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:54:03,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:54:03,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:54:03,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:54:03,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:54:03,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:54:03,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:54:03,077 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:54:03,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:54:03,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 19:54:03,078 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 19:54:03,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 19:54:03,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 19:54:03,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:54:03,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 19:54:03,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:54:03,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 19:54:03,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 19:54:03,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 19:54:03,078 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:54:03,079 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:54:03,079 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:54:03,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:54:03,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:54:03,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:54:03,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:54:03,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:54:03,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:54:03,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:54:03,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:54:03,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:54:03,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:54:03,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:54:03,081 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 19:54:03,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 19:54:03,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 19:54:03,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 19:54:03,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:54:03,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:54:03,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:54:03,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:54:03,082 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2024-11-27 19:54:03,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:54:03,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:54:03,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:54:03,461 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:54:03,461 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:54:03,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/forester-heap/dll-optional-1.i [2024-11-27 19:54:06,561 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/data/bd4ff87a1/2463e2e284bc4892a8be056acefd7a34/FLAG6136450ae [2024-11-27 19:54:06,887 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:54:06,887 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/sv-benchmarks/c/forester-heap/dll-optional-1.i [2024-11-27 19:54:06,900 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/data/bd4ff87a1/2463e2e284bc4892a8be056acefd7a34/FLAG6136450ae [2024-11-27 19:54:06,915 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/data/bd4ff87a1/2463e2e284bc4892a8be056acefd7a34 [2024-11-27 19:54:06,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:54:06,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:54:06,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:54:06,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:54:06,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:54:06,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:54:06" (1/1) ... [2024-11-27 19:54:06,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159f0afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:06, skipping insertion in model container [2024-11-27 19:54:06,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:54:06" (1/1) ... [2024-11-27 19:54:06,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:54:07,305 WARN L250 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_3e0eb41e-891b-4096-a048-4387a0690b09/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2024-11-27 19:54:07,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:54:07,322 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:54:07,366 WARN L250 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_3e0eb41e-891b-4096-a048-4387a0690b09/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2024-11-27 19:54:07,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:54:07,396 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:54:07,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:07 WrapperNode [2024-11-27 19:54:07,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:54:07,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:54:07,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:54:07,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:54:07,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:07" (1/1) ... [2024-11-27 19:54:07,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:07" (1/1) ... [2024-11-27 19:54:07,438 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 133 [2024-11-27 19:54:07,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:54:07,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:54:07,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:54:07,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:54:07,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:07" (1/1) ... [2024-11-27 19:54:07,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:07" (1/1) ... [2024-11-27 19:54:07,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:07" (1/1) ... [2024-11-27 19:54:07,486 INFO L175 MemorySlicer]: Split 34 memory accesses to 2 slices as follows [2, 32]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 19 writes are split as follows [0, 19]. [2024-11-27 19:54:07,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:07" (1/1) ... [2024-11-27 19:54:07,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:07" (1/1) ... [2024-11-27 19:54:07,504 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:07" (1/1) ... [2024-11-27 19:54:07,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:07" (1/1) ... [2024-11-27 19:54:07,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:07" (1/1) ... [2024-11-27 19:54:07,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:07" (1/1) ... [2024-11-27 19:54:07,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:07" (1/1) ... [2024-11-27 19:54:07,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:54:07,526 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:54:07,526 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:54:07,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:54:07,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:07" (1/1) ... [2024-11-27 19:54:07,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:54:07,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:54:07,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:54:07,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:54:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 19:54:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 19:54:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 19:54:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 19:54:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 19:54:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:54:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 19:54:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 19:54:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 19:54:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 19:54:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 19:54:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 19:54:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 19:54:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:54:07,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:54:07,767 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:54:07,770 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:54:08,048 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-27 19:54:08,050 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:54:08,065 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:54:08,065 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-27 19:54:08,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:54:08 BoogieIcfgContainer [2024-11-27 19:54:08,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:54:08,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:54:08,071 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:54:08,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:54:08,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:54:06" (1/3) ... [2024-11-27 19:54:08,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66461ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:54:08, skipping insertion in model container [2024-11-27 19:54:08,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:54:07" (2/3) ... [2024-11-27 19:54:08,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66461ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:54:08, skipping insertion in model container [2024-11-27 19:54:08,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:54:08" (3/3) ... [2024-11-27 19:54:08,081 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2024-11-27 19:54:08,100 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:54:08,102 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-optional-1.i that has 1 procedures, 32 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-27 19:54:08,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:54:08,181 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@482b7299, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:54:08,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 19:54:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.6) internal successors, (48), 31 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) [2024-11-27 19:54:08,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-27 19:54:08,198 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:54:08,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:54:08,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:54:08,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:54:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2100136308, now seen corresponding path program 1 times [2024-11-27 19:54:08,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:54:08,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075300759] [2024-11-27 19:54:08,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:54:08,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:54:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:54:08,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:54:08,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:54:08,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075300759] [2024-11-27 19:54:08,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075300759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:54:08,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:54:08,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:54:08,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557066097] [2024-11-27 19:54:08,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:54:08,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 19:54:08,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:54:08,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 19:54:08,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 19:54:08,605 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.6) internal successors, (48), 31 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:54:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:54:08,620 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2024-11-27 19:54:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 19:54:08,622 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2024-11-27 19:54:08,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:54:08,629 INFO L225 Difference]: With dead ends: 54 [2024-11-27 19:54:08,630 INFO L226 Difference]: Without dead ends: 23 [2024-11-27 19:54:08,633 INFO L434 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 [2024-11-27 19:54:08,636 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:54:08,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:54:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-27 19:54:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-27 19:54:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:54:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-27 19:54:08,674 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 15 [2024-11-27 19:54:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:54:08,674 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-27 19:54:08,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:54:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-27 19:54:08,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-27 19:54:08,675 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:54:08,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:54:08,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 19:54:08,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:54:08,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:54:08,677 INFO L85 PathProgramCache]: Analyzing trace with hash 322305731, now seen corresponding path program 1 times [2024-11-27 19:54:08,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:54:08,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502556591] [2024-11-27 19:54:08,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:54:08,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:54:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:54:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:54:08,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:54:08,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502556591] [2024-11-27 19:54:08,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502556591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:54:08,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:54:08,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:54:08,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778725018] [2024-11-27 19:54:08,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:54:08,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:54:08,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:54:08,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:54:08,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:54:08,875 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2024-11-27 19:54:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:54:08,909 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-11-27 19:54:08,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:54:08,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 [2024-11-27 19:54:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:54:08,910 INFO L225 Difference]: With dead ends: 37 [2024-11-27 19:54:08,911 INFO L226 Difference]: Without dead ends: 25 [2024-11-27 19:54:08,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:54:08,912 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:54:08,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:54:08,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-27 19:54:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-27 19:54:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 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) [2024-11-27 19:54:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2024-11-27 19:54:08,916 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2024-11-27 19:54:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:54:08,917 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-11-27 19:54:08,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2024-11-27 19:54:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-11-27 19:54:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-27 19:54:08,917 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:54:08,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:54:08,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 19:54:08,918 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:54:08,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:54:08,918 INFO L85 PathProgramCache]: Analyzing trace with hash 322307653, now seen corresponding path program 1 times [2024-11-27 19:54:08,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:54:08,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915883012] [2024-11-27 19:54:08,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:54:08,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:54:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:54:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:54:09,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:54:09,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915883012] [2024-11-27 19:54:09,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915883012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:54:09,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:54:09,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 19:54:09,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107596012] [2024-11-27 19:54:09,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:54:09,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:54:09,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:54:09,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:54:09,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:54:09,413 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2024-11-27 19:54:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:54:09,719 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2024-11-27 19:54:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:54:09,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 [2024-11-27 19:54:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:54:09,721 INFO L225 Difference]: With dead ends: 39 [2024-11-27 19:54:09,721 INFO L226 Difference]: Without dead ends: 37 [2024-11-27 19:54:09,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:54:09,722 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:54:09,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 75 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 19:54:09,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-27 19:54:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2024-11-27 19:54:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:54:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2024-11-27 19:54:09,729 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 16 [2024-11-27 19:54:09,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:54:09,731 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2024-11-27 19:54:09,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2024-11-27 19:54:09,731 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-11-27 19:54:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-27 19:54:09,733 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:54:09,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:54:09,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 19:54:09,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:54:09,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:54:09,735 INFO L85 PathProgramCache]: Analyzing trace with hash 320460611, now seen corresponding path program 1 times [2024-11-27 19:54:09,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:54:09,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263741713] [2024-11-27 19:54:09,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:54:09,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:54:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:54:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:54:10,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:54:10,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263741713] [2024-11-27 19:54:10,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263741713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:54:10,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:54:10,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 19:54:10,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646538488] [2024-11-27 19:54:10,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:54:10,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 19:54:10,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:54:10,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 19:54:10,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:54:10,483 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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) [2024-11-27 19:54:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:54:10,991 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2024-11-27 19:54:10,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 19:54:10,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 [2024-11-27 19:54:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:54:10,993 INFO L225 Difference]: With dead ends: 95 [2024-11-27 19:54:10,993 INFO L226 Difference]: Without dead ends: 76 [2024-11-27 19:54:10,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-27 19:54:10,994 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 92 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:54:10,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 82 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 19:54:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-27 19:54:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 43. [2024-11-27 19:54:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:54:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2024-11-27 19:54:11,014 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 16 [2024-11-27 19:54:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:54:11,015 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2024-11-27 19:54:11,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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) [2024-11-27 19:54:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2024-11-27 19:54:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-27 19:54:11,015 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:54:11,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:54:11,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 19:54:11,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:54:11,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:54:11,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2097315015, now seen corresponding path program 1 times [2024-11-27 19:54:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:54:11,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276411619] [2024-11-27 19:54:11,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:54:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:54:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:54:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:54:11,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:54:11,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276411619] [2024-11-27 19:54:11,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276411619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:54:11,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:54:11,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 19:54:11,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423404721] [2024-11-27 19:54:11,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:54:11,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:54:11,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:54:11,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:54:11,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:54:11,294 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2024-11-27 19:54:11,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:54:11,539 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2024-11-27 19:54:11,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 19:54:11,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 [2024-11-27 19:54:11,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:54:11,541 INFO L225 Difference]: With dead ends: 89 [2024-11-27 19:54:11,541 INFO L226 Difference]: Without dead ends: 66 [2024-11-27 19:54:11,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:54:11,542 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 85 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:54:11,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 79 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:54:11,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-27 19:54:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2024-11-27 19:54:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:54:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2024-11-27 19:54:11,559 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 16 [2024-11-27 19:54:11,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:54:11,560 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-11-27 19:54:11,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2024-11-27 19:54:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2024-11-27 19:54:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-27 19:54:11,563 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:54:11,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:54:11,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 19:54:11,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:54:11,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:54:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1958976127, now seen corresponding path program 1 times [2024-11-27 19:54:11,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:54:11,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106733207] [2024-11-27 19:54:11,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:54:11,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:54:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:54:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:54:11,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:54:11,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106733207] [2024-11-27 19:54:11,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106733207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:54:11,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:54:11,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 19:54:11,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263596334] [2024-11-27 19:54:11,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:54:11,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:54:11,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:54:11,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:54:11,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:54:11,860 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:54:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:54:12,205 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2024-11-27 19:54:12,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 19:54:12,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2024-11-27 19:54:12,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:54:12,206 INFO L225 Difference]: With dead ends: 104 [2024-11-27 19:54:12,207 INFO L226 Difference]: Without dead ends: 85 [2024-11-27 19:54:12,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-27 19:54:12,209 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 47 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:54:12,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 134 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:54:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-27 19:54:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 49. [2024-11-27 19:54:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:54:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2024-11-27 19:54:12,226 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 17 [2024-11-27 19:54:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:54:12,226 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2024-11-27 19:54:12,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:54:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2024-11-27 19:54:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-27 19:54:12,227 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:54:12,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:54:12,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 19:54:12,227 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:54:12,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:54:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash -559136765, now seen corresponding path program 1 times [2024-11-27 19:54:12,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:54:12,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022813952] [2024-11-27 19:54:12,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:54:12,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:54:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:54:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:54:12,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:54:12,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022813952] [2024-11-27 19:54:12,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022813952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:54:12,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:54:12,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:54:12,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821460362] [2024-11-27 19:54:12,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:54:12,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:54:12,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:54:12,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:54:12,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:54:12,441 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:54:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:54:12,687 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2024-11-27 19:54:12,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 19:54:12,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2024-11-27 19:54:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:54:12,689 INFO L225 Difference]: With dead ends: 87 [2024-11-27 19:54:12,689 INFO L226 Difference]: Without dead ends: 85 [2024-11-27 19:54:12,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-27 19:54:12,690 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 38 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:54:12,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 117 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:54:12,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-27 19:54:12,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 49. [2024-11-27 19:54:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:54:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2024-11-27 19:54:12,709 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 17 [2024-11-27 19:54:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:54:12,709 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2024-11-27 19:54:12,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:54:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2024-11-27 19:54:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-27 19:54:12,710 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:54:12,713 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:54:12,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 19:54:12,713 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:54:12,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:54:12,714 INFO L85 PathProgramCache]: Analyzing trace with hash -494282519, now seen corresponding path program 1 times [2024-11-27 19:54:12,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:54:12,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479362627] [2024-11-27 19:54:12,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:54:12,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:54:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:54:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:54:14,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:54:14,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479362627] [2024-11-27 19:54:14,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479362627] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:54:14,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656425207] [2024-11-27 19:54:14,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:54:14,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:54:14,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:54:14,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:54:14,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e0eb41e-891b-4096-a048-4387a0690b09/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 19:54:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:54:14,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-27 19:54:14,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:54:14,920 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 [2024-11-27 19:54:15,017 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-11-27 19:54:15,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-11-27 19:54:15,037 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 35 treesize of output 19 [2024-11-27 19:54:15,058 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 43 treesize of output 11 [2024-11-27 19:54:15,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:54:15,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:54:15,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:54:15,428 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-27 19:54:15,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 55 [2024-11-27 19:54:15,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:54:15,449 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-27 19:54:15,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:54:15,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:54:15,494 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-27 19:54:15,495 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2024-11-27 19:54:15,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:54:15,528 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-27 19:54:15,529 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 2 case distinctions, treesize of input 55 treesize of output 48 [2024-11-27 19:54:15,580 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2024-11-27 19:54:15,583 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 42 [2024-11-27 19:54:15,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:54:15,639 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 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 19:54:15,743 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-27 19:54:15,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-11-27 19:54:15,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:54:16,058 INFO L349 Elim1Store]: treesize reduction 154, result has 12.0 percent of original size [2024-11-27 19:54:16,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 146 treesize of output 153 [2024-11-27 19:54:16,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:54:16,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:54:16,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:54:16,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:54:16,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2024-11-27 19:54:16,158 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-27 19:54:16,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 33 [2024-11-27 19:54:16,194 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 8 treesize of output 7 [2024-11-27 19:54:16,211 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 8 treesize of output 7 [2024-11-27 19:54:17,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:54:17,673 INFO L349 Elim1Store]: treesize reduction 40, result has 69.9 percent of original size [2024-11-27 19:54:17,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 1394 treesize of output 1300 [2024-11-27 19:54:18,637 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 8 treesize of output 6 [2024-11-27 19:54:18,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:54:18,651 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 0 case distinctions, treesize of input 42 treesize of output 28 [2024-11-27 19:54:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:54:18,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:54:19,383 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse6 (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|) |c_ULTIMATE.start_main_~x~0#1.offset| 0))) (.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_8| Int) (v_ArrVal_357 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8| 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0)) (forall ((v_ArrVal_361 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (= (let ((.cse3 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)))) (store .cse7 |v_ULTIMATE.start_main_#t~malloc7#1.base_8| (store (select .cse7 |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 4 |c_ULTIMATE.start_main_~x~0#1.base|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (let ((.cse0 (let ((.cse2 (store .cse3 .cse4 v_ArrVal_365))) (store .cse2 |v_ULTIMATE.start_main_#t~malloc11#1.base_8| (store (select .cse2 |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0 0))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (select (select (let ((.cse5 (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_357) .cse4 v_ArrVal_361))) (store .cse5 |v_ULTIMATE.start_main_#t~malloc11#1.base_8| (store (select .cse5 |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0 0))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 0)) (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_8| Int) (v_ArrVal_357 (Array Int Int))) (or (forall ((v_ArrVal_361 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (= (let ((.cse11 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)))) (store .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_8| (store (select .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 4 |c_ULTIMATE.start_main_~x~0#1.base|))))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse9 (let ((.cse13 (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_357) .cse12 v_ArrVal_361))) (store .cse13 |v_ULTIMATE.start_main_#t~malloc11#1.base_8| (store (select .cse13 |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0 0))))) (select (select .cse9 (select (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_365))) (store .cse10 |v_ULTIMATE.start_main_#t~malloc11#1.base_8| (store (select .cse10 |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0 0))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8| 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0)))))))) is different from false [2024-11-27 19:54:19,645 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 0)) (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_8| Int) (v_ArrVal_357 (Array Int Int))) (or (forall ((v_ArrVal_361 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (= (let ((.cse2 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse8 |v_ULTIMATE.start_main_~x~0#1.offset_25| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)))) (store .cse7 |v_ULTIMATE.start_main_#t~malloc7#1.base_8| (store (select .cse7 |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 4 |c_ULTIMATE.start_main_~head~0#1.base|))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_25|))) (let ((.cse0 (let ((.cse5 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse6 |v_ULTIMATE.start_main_~x~0#1.offset_25| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_357) .cse3 v_ArrVal_361))) (store .cse5 |v_ULTIMATE.start_main_#t~malloc11#1.base_8| (store (select .cse5 |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0 0))))) (select (select .cse0 (select (select (let ((.cse1 (store .cse2 .cse3 v_ArrVal_365))) (store .cse1 |v_ULTIMATE.start_main_#t~malloc11#1.base_8| (store (select .cse1 |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0 0))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))))) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8| 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0)))))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_25|))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_8| Int) (v_ArrVal_357 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8| 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0)) (forall ((v_ArrVal_361 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (= (let ((.cse11 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse8 |v_ULTIMATE.start_main_~x~0#1.offset_25| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)))) (store .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_8| (store (select .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 4 |c_ULTIMATE.start_main_~head~0#1.base|))))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_25|))) (select (let ((.cse9 (let ((.cse10 (store .cse11 .cse12 v_ArrVal_365))) (store .cse10 |v_ULTIMATE.start_main_#t~malloc11#1.base_8| (store (select .cse10 |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0 0))))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (select (select (let ((.cse13 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse6 |v_ULTIMATE.start_main_~x~0#1.offset_25| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_357) .cse12 v_ArrVal_361))) (store .cse13 |v_ULTIMATE.start_main_#t~malloc11#1.base_8| (store (select .cse13 |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0 0))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)))) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 0)))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_25|))))) is different from false [2024-11-27 19:54:24,722 INFO L349 Elim1Store]: treesize reduction 2037, result has 43.1 percent of original size [2024-11-27 19:54:24,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 75128988214941 treesize of output 73783501599718 [2024-11-27 19:54:41,701 WARN L286 SmtUtils]: Spent 16.85s on a formula simplification. DAG size of input: 17908 DAG size of output: 942 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 19:55:58,533 WARN L286 SmtUtils]: Spent 1.15m on a formula simplification. DAG size of input: 719 DAG size of output: 202 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 19:55:58,534 INFO L349 Elim1Store]: treesize reduction 1362, result has 21.5 percent of original size [2024-11-27 19:55:58,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 29 new quantified variables, introduced 154 case distinctions, treesize of input 745683638912 treesize of output 471885559894