./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2971ec3e9ef2eef1d2151174358645d6ce0c6d4fe66ae89c00ded0f196979d8a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 01:44:10,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:44:10,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:44:10,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:44:10,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:44:10,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:44:10,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:44:10,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:44:10,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:44:10,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:44:10,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:44:10,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:44:10,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:44:10,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:44:10,683 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:44:10,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:44:10,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:44:10,684 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:44:10,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:44:10,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:44:10,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:44:10,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:44:10,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:44:10,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:44:10,686 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:44:10,686 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:44:10,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:44:10,686 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:44:10,687 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:44:10,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:44:10,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:44:10,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:44:10,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:44:10,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:44:10,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:44:10,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:44:10,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:44:10,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:44:10,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:44:10,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:44:10,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:44:10,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:44:10,690 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2971ec3e9ef2eef1d2151174358645d6ce0c6d4fe66ae89c00ded0f196979d8a [2024-10-14 01:44:10,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:44:10,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:44:10,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:44:10,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:44:10,943 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:44:10,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2024-10-14 01:44:12,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:44:12,394 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:44:12,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2024-10-14 01:44:12,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7874cb327/f9b7c14ce6fd4aa6bf191c6f05e49151/FLAGd0fcb1bd5 [2024-10-14 01:44:12,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7874cb327/f9b7c14ce6fd4aa6bf191c6f05e49151 [2024-10-14 01:44:12,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:44:12,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:44:12,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:44:12,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:44:12,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:44:12,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:44:12" (1/1) ... [2024-10-14 01:44:12,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@797c00d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:12, skipping insertion in model container [2024-10-14 01:44:12,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:44:12" (1/1) ... [2024-10-14 01:44:12,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:44:12,706 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2024-10-14 01:44:12,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:44:12,723 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:44:12,762 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2024-10-14 01:44:12,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:44:12,823 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:44:12,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:12 WrapperNode [2024-10-14 01:44:12,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:44:12,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:44:12,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:44:12,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:44:12,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:12" (1/1) ... [2024-10-14 01:44:12,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:12" (1/1) ... [2024-10-14 01:44:12,864 INFO L138 Inliner]: procedures = 122, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 204 [2024-10-14 01:44:12,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:44:12,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:44:12,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:44:12,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:44:12,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:12" (1/1) ... [2024-10-14 01:44:12,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:12" (1/1) ... [2024-10-14 01:44:12,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:12" (1/1) ... [2024-10-14 01:44:12,906 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 12, 26]. 65 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 15 writes are split as follows [0, 5, 10]. [2024-10-14 01:44:12,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:12" (1/1) ... [2024-10-14 01:44:12,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:12" (1/1) ... [2024-10-14 01:44:12,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:12" (1/1) ... [2024-10-14 01:44:12,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:12" (1/1) ... [2024-10-14 01:44:12,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:12" (1/1) ... [2024-10-14 01:44:12,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:12" (1/1) ... [2024-10-14 01:44:12,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:44:12,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:44:12,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:44:12,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:44:12,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:12" (1/1) ... [2024-10-14 01:44:12,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:44:12,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:12,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 01:44:12,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 01:44:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-14 01:44:13,016 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-14 01:44:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 01:44:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 01:44:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 01:44:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 01:44:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 01:44:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 01:44:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 01:44:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:44:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 01:44:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 01:44:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 01:44:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 01:44:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 01:44:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 01:44:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 01:44:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:44:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 01:44:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 01:44:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:44:13,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:44:13,134 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:44:13,136 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:44:13,170 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-14 01:44:13,452 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-10-14 01:44:13,452 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:44:13,479 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:44:13,480 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-14 01:44:13,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:44:13 BoogieIcfgContainer [2024-10-14 01:44:13,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:44:13,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:44:13,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:44:13,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:44:13,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:44:12" (1/3) ... [2024-10-14 01:44:13,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18316836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:44:13, skipping insertion in model container [2024-10-14 01:44:13,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:12" (2/3) ... [2024-10-14 01:44:13,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18316836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:44:13, skipping insertion in model container [2024-10-14 01:44:13,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:44:13" (3/3) ... [2024-10-14 01:44:13,488 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2024-10-14 01:44:13,502 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:44:13,503 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:44:13,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:44:13,567 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;@457e9e7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:44:13,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:44:13,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 47 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 01:44:13,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:13,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:13,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:13,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:13,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1035494790, now seen corresponding path program 1 times [2024-10-14 01:44:13,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:13,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485642086] [2024-10-14 01:44:13,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:13,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:13,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:13,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485642086] [2024-10-14 01:44:13,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485642086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:13,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:13,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 01:44:13,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420669592] [2024-10-14 01:44:13,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:13,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 01:44:13,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:13,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 01:44:13,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 01:44:13,779 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 47 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 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-10-14 01:44:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:13,799 INFO L93 Difference]: Finished difference Result 97 states and 155 transitions. [2024-10-14 01:44:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 01:44:13,801 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-10-14 01:44:13,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:13,806 INFO L225 Difference]: With dead ends: 97 [2024-10-14 01:44:13,807 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 01:44:13,810 INFO L431 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-10-14 01:44:13,813 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:13,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:44:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 01:44:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-14 01:44:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 41 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:13,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-10-14 01:44:13,865 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 15 [2024-10-14 01:44:13,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:13,865 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-10-14 01:44:13,866 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-10-14 01:44:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-10-14 01:44:13,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 01:44:13,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:13,869 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:13,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:44:13,870 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:13,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:13,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1634113901, now seen corresponding path program 1 times [2024-10-14 01:44:13,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:13,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750570598] [2024-10-14 01:44:13,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:13,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:13,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:13,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750570598] [2024-10-14 01:44:13,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750570598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:13,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:13,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 01:44:13,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13325120] [2024-10-14 01:44:13,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:13,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 01:44:13,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:13,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 01:44:13,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:44:13,983 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:14,004 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2024-10-14 01:44:14,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 01:44:14,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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 20 [2024-10-14 01:44:14,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:14,007 INFO L225 Difference]: With dead ends: 70 [2024-10-14 01:44:14,008 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 01:44:14,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:44:14,010 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:14,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:44:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 01:44:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-14 01:44:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.469387755102041) internal successors, (72), 49 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2024-10-14 01:44:14,018 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 20 [2024-10-14 01:44:14,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:14,018 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2024-10-14 01:44:14,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2024-10-14 01:44:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 01:44:14,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:14,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:14,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 01:44:14,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:14,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:14,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1678369216, now seen corresponding path program 1 times [2024-10-14 01:44:14,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:14,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768167401] [2024-10-14 01:44:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:14,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:14,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:14,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768167401] [2024-10-14 01:44:14,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768167401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:14,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:14,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:44:14,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023962922] [2024-10-14 01:44:14,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:14,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 01:44:14,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:14,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 01:44:14,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:44:14,376 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:14,588 INFO L93 Difference]: Finished difference Result 128 states and 190 transitions. [2024-10-14 01:44:14,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:44:14,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-10-14 01:44:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:14,591 INFO L225 Difference]: With dead ends: 128 [2024-10-14 01:44:14,591 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 01:44:14,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:44:14,592 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 70 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:14,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 173 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 01:44:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 01:44:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73. [2024-10-14 01:44:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.5) internal successors, (108), 72 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2024-10-14 01:44:14,608 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 26 [2024-10-14 01:44:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:14,608 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2024-10-14 01:44:14,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2024-10-14 01:44:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 01:44:14,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:14,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:14,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 01:44:14,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:14,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:14,610 INFO L85 PathProgramCache]: Analyzing trace with hash 860720766, now seen corresponding path program 1 times [2024-10-14 01:44:14,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:14,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193060253] [2024-10-14 01:44:14,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:14,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:14,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193060253] [2024-10-14 01:44:14,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193060253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:14,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:14,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 01:44:14,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538628318] [2024-10-14 01:44:14,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:14,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 01:44:14,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:14,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 01:44:14,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:44:14,721 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:14,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:14,785 INFO L93 Difference]: Finished difference Result 90 states and 128 transitions. [2024-10-14 01:44:14,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 01:44:14,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2024-10-14 01:44:14,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:14,787 INFO L225 Difference]: With dead ends: 90 [2024-10-14 01:44:14,787 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 01:44:14,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:44:14,788 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:14,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 187 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:44:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 01:44:14,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-10-14 01:44:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 81 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2024-10-14 01:44:14,801 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 26 [2024-10-14 01:44:14,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:14,801 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2024-10-14 01:44:14,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:14,802 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2024-10-14 01:44:14,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 01:44:14,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:14,802 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:14,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 01:44:14,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:14,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:14,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1727351847, now seen corresponding path program 1 times [2024-10-14 01:44:14,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:14,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281963102] [2024-10-14 01:44:14,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:14,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:14,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:14,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281963102] [2024-10-14 01:44:14,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281963102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:14,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:14,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 01:44:14,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974255546] [2024-10-14 01:44:14,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:14,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 01:44:14,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:14,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 01:44:14,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:44:14,930 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:15,001 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2024-10-14 01:44:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 01:44:15,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2024-10-14 01:44:15,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:15,006 INFO L225 Difference]: With dead ends: 92 [2024-10-14 01:44:15,006 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 01:44:15,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:44:15,011 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 5 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:15,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 190 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:44:15,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 01:44:15,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-10-14 01:44:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.481012658227848) internal successors, (117), 79 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 117 transitions. [2024-10-14 01:44:15,020 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 117 transitions. Word has length 28 [2024-10-14 01:44:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:15,020 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 117 transitions. [2024-10-14 01:44:15,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 117 transitions. [2024-10-14 01:44:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 01:44:15,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:15,023 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:15,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 01:44:15,024 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:15,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:15,025 INFO L85 PathProgramCache]: Analyzing trace with hash -702648871, now seen corresponding path program 1 times [2024-10-14 01:44:15,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:15,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536877382] [2024-10-14 01:44:15,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:15,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:15,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:15,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536877382] [2024-10-14 01:44:15,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536877382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:15,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:15,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 01:44:15,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099326009] [2024-10-14 01:44:15,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:15,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 01:44:15,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:15,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 01:44:15,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:44:15,147 INFO L87 Difference]: Start difference. First operand 80 states and 117 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:15,201 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2024-10-14 01:44:15,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 01:44:15,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2024-10-14 01:44:15,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:15,202 INFO L225 Difference]: With dead ends: 92 [2024-10-14 01:44:15,202 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 01:44:15,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:44:15,203 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:15,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 194 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:44:15,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 01:44:15,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-10-14 01:44:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.486842105263158) internal successors, (113), 76 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2024-10-14 01:44:15,214 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 113 transitions. Word has length 28 [2024-10-14 01:44:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:15,214 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 113 transitions. [2024-10-14 01:44:15,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 113 transitions. [2024-10-14 01:44:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 01:44:15,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:15,215 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:15,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 01:44:15,215 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:15,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:15,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1486366107, now seen corresponding path program 1 times [2024-10-14 01:44:15,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:15,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110425877] [2024-10-14 01:44:15,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:15,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:15,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:15,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110425877] [2024-10-14 01:44:15,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110425877] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:15,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827225088] [2024-10-14 01:44:15,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:15,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:15,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:15,475 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:44:15,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 01:44:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:15,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 01:44:15,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:15,627 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-10-14 01:44:15,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:44:15,704 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:44:15,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 01:44:15,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 01:44:15,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 01:44:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:15,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:15,814 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_202 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2024-10-14 01:44:18,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:18,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2024-10-14 01:44:18,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:18,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2024-10-14 01:44:18,298 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 9 treesize of output 7 [2024-10-14 01:44:18,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-14 01:44:18,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827225088] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:18,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:18,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-10-14 01:44:18,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612627832] [2024-10-14 01:44:18,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:18,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 01:44:18,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:18,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 01:44:18,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=101, Unknown=3, NotChecked=20, Total=156 [2024-10-14 01:44:18,410 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:18,665 INFO L93 Difference]: Finished difference Result 94 states and 132 transitions. [2024-10-14 01:44:18,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 01:44:18,665 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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 30 [2024-10-14 01:44:18,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:18,666 INFO L225 Difference]: With dead ends: 94 [2024-10-14 01:44:18,666 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 01:44:18,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=61, Invalid=180, Unknown=3, NotChecked=28, Total=272 [2024-10-14 01:44:18,667 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 23 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:18,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 389 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 108 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2024-10-14 01:44:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 01:44:18,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-10-14 01:44:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2024-10-14 01:44:18,672 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 30 [2024-10-14 01:44:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:18,672 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2024-10-14 01:44:18,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2024-10-14 01:44:18,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 01:44:18,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:18,673 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:18,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 01:44:18,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:18,878 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:18,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:18,878 INFO L85 PathProgramCache]: Analyzing trace with hash -622964443, now seen corresponding path program 1 times [2024-10-14 01:44:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:18,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655613257] [2024-10-14 01:44:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:18,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:19,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:19,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655613257] [2024-10-14 01:44:19,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655613257] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:19,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298491670] [2024-10-14 01:44:19,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:19,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:19,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:19,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:44:19,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 01:44:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:19,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-14 01:44:19,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:19,221 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-10-14 01:44:19,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:44:19,264 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:44:19,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 01:44:19,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 01:44:19,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 01:44:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:19,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:19,366 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 2)))) is different from false [2024-10-14 01:44:19,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:19,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 39 [2024-10-14 01:44:19,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:19,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 50 [2024-10-14 01:44:19,470 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 19 treesize of output 15 [2024-10-14 01:44:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-14 01:44:19,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298491670] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:19,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:19,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 15 [2024-10-14 01:44:19,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813723050] [2024-10-14 01:44:19,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:19,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 01:44:19,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:19,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 01:44:19,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=142, Unknown=3, NotChecked=24, Total=210 [2024-10-14 01:44:19,564 INFO L87 Difference]: Start difference. First operand 84 states and 121 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:23,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-14 01:44:24,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:24,323 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2024-10-14 01:44:24,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 01:44:24,323 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 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 30 [2024-10-14 01:44:24,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:24,324 INFO L225 Difference]: With dead ends: 116 [2024-10-14 01:44:24,324 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 01:44:24,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=421, Unknown=7, NotChecked=44, Total=600 [2024-10-14 01:44:24,325 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 57 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 29 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:24,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 452 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 196 Invalid, 7 Unknown, 44 Unchecked, 4.5s Time] [2024-10-14 01:44:24,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 01:44:24,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2024-10-14 01:44:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 105 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-10-14 01:44:24,335 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 30 [2024-10-14 01:44:24,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:24,335 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-10-14 01:44:24,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-10-14 01:44:24,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 01:44:24,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:24,336 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:24,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 01:44:24,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-14 01:44:24,537 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:24,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:24,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1395303424, now seen corresponding path program 1 times [2024-10-14 01:44:24,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:24,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067752369] [2024-10-14 01:44:24,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:24,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:25,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:25,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067752369] [2024-10-14 01:44:25,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067752369] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:25,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24580824] [2024-10-14 01:44:25,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:25,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:25,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:25,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:44:25,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 01:44:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:25,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-14 01:44:25,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:25,125 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-10-14 01:44:25,184 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:44:25,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 01:44:25,213 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 19 treesize of output 1 [2024-10-14 01:44:25,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 01:44:25,270 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 01:44:25,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2024-10-14 01:44:25,278 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 29 treesize of output 19 [2024-10-14 01:44:25,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2024-10-14 01:44:25,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-10-14 01:44:25,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 01:44:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:25,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:25,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 57 [2024-10-14 01:44:25,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:25,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-10-14 01:44:25,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:25,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-10-14 01:44:25,457 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 7 treesize of output 3 [2024-10-14 01:44:25,472 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-14 01:44:25,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-10-14 01:44:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:25,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24580824] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:25,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:25,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2024-10-14 01:44:25,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304524264] [2024-10-14 01:44:25,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:25,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 01:44:25,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:25,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 01:44:25,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=287, Unknown=2, NotChecked=0, Total=342 [2024-10-14 01:44:25,586 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:25,891 INFO L93 Difference]: Finished difference Result 132 states and 177 transitions. [2024-10-14 01:44:25,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 01:44:25,891 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 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 32 [2024-10-14 01:44:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:25,892 INFO L225 Difference]: With dead ends: 132 [2024-10-14 01:44:25,892 INFO L226 Difference]: Without dead ends: 128 [2024-10-14 01:44:25,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=384, Unknown=2, NotChecked=0, Total=462 [2024-10-14 01:44:25,893 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 101 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:25,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 508 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 01:44:25,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-14 01:44:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2024-10-14 01:44:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 119 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 164 transitions. [2024-10-14 01:44:25,904 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 164 transitions. Word has length 32 [2024-10-14 01:44:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:25,905 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 164 transitions. [2024-10-14 01:44:25,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 164 transitions. [2024-10-14 01:44:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 01:44:25,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:25,906 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:25,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 01:44:26,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:26,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:26,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:26,111 INFO L85 PathProgramCache]: Analyzing trace with hash -808113957, now seen corresponding path program 1 times [2024-10-14 01:44:26,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:26,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101671764] [2024-10-14 01:44:26,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:26,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:26,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:26,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101671764] [2024-10-14 01:44:26,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101671764] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:26,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223817514] [2024-10-14 01:44:26,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:26,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:26,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:26,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:44:26,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 01:44:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:26,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-14 01:44:26,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:26,604 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-10-14 01:44:26,677 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:44:26,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 01:44:26,706 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 19 treesize of output 1 [2024-10-14 01:44:26,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 01:44:26,756 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 01:44:26,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2024-10-14 01:44:26,763 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 29 treesize of output 19 [2024-10-14 01:44:26,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2024-10-14 01:44:26,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-10-14 01:44:26,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 01:44:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:26,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:26,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 30 [2024-10-14 01:44:26,868 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_435 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_434 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2024-10-14 01:44:26,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:26,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-10-14 01:44:26,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:26,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-10-14 01:44:26,905 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 11 treesize of output 7 [2024-10-14 01:44:26,921 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-14 01:44:26,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-10-14 01:44:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-14 01:44:27,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223817514] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:27,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:27,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2024-10-14 01:44:27,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039289744] [2024-10-14 01:44:27,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:27,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 01:44:27,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:27,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 01:44:27,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=326, Unknown=1, NotChecked=36, Total=420 [2024-10-14 01:44:27,015 INFO L87 Difference]: Start difference. First operand 120 states and 164 transitions. Second operand has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:27,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:27,347 INFO L93 Difference]: Finished difference Result 134 states and 179 transitions. [2024-10-14 01:44:27,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 01:44:27,347 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 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 34 [2024-10-14 01:44:27,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:27,348 INFO L225 Difference]: With dead ends: 134 [2024-10-14 01:44:27,348 INFO L226 Difference]: Without dead ends: 121 [2024-10-14 01:44:27,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=591, Unknown=1, NotChecked=50, Total=756 [2024-10-14 01:44:27,349 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 71 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:27,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 490 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 260 Invalid, 0 Unknown, 81 Unchecked, 0.2s Time] [2024-10-14 01:44:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-14 01:44:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2024-10-14 01:44:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 114 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2024-10-14 01:44:27,353 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 34 [2024-10-14 01:44:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:27,354 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2024-10-14 01:44:27,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2024-10-14 01:44:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 01:44:27,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:27,355 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:27,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 01:44:27,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:27,559 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:27,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:27,559 INFO L85 PathProgramCache]: Analyzing trace with hash 216589019, now seen corresponding path program 2 times [2024-10-14 01:44:27,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:27,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989346939] [2024-10-14 01:44:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:27,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:27,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:27,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989346939] [2024-10-14 01:44:27,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989346939] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:27,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656128444] [2024-10-14 01:44:27,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:44:27,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:27,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:27,903 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:44:27,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 01:44:27,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:44:27,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:44:28,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-14 01:44:28,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:28,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:44:28,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 01:44:28,150 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-10-14 01:44:28,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2024-10-14 01:44:28,170 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-14 01:44:28,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2024-10-14 01:44:28,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-10-14 01:44:28,202 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 15 treesize of output 11 [2024-10-14 01:44:28,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:28,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 01:44:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:28,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:28,422 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-10-14 01:44:28,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 41 [2024-10-14 01:44:28,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:28,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-10-14 01:44:28,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:28,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-10-14 01:44:28,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:28,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2024-10-14 01:44:28,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:28,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2024-10-14 01:44:28,525 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 41 treesize of output 37 [2024-10-14 01:44:28,530 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 37 treesize of output 33 [2024-10-14 01:44:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:28,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656128444] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:28,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:28,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2024-10-14 01:44:28,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607702275] [2024-10-14 01:44:28,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:28,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 01:44:28,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:28,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 01:44:28,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2024-10-14 01:44:28,612 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:28,948 INFO L93 Difference]: Finished difference Result 129 states and 173 transitions. [2024-10-14 01:44:28,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 01:44:28,948 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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 34 [2024-10-14 01:44:28,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:28,949 INFO L225 Difference]: With dead ends: 129 [2024-10-14 01:44:28,949 INFO L226 Difference]: Without dead ends: 116 [2024-10-14 01:44:28,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2024-10-14 01:44:28,951 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 80 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:28,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 436 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 01:44:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-14 01:44:28,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2024-10-14 01:44:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.3873873873873874) internal successors, (154), 111 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 154 transitions. [2024-10-14 01:44:28,955 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 154 transitions. Word has length 34 [2024-10-14 01:44:28,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:28,956 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 154 transitions. [2024-10-14 01:44:28,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 154 transitions. [2024-10-14 01:44:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 01:44:28,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:28,956 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:28,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 01:44:29,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 01:44:29,161 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:29,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:29,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1418387111, now seen corresponding path program 3 times [2024-10-14 01:44:29,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:29,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963945389] [2024-10-14 01:44:29,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:29,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:29,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:29,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963945389] [2024-10-14 01:44:29,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963945389] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:29,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460066786] [2024-10-14 01:44:29,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 01:44:29,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:29,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:29,806 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:44:29,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 01:44:29,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-14 01:44:29,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:44:29,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-14 01:44:29,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:29,945 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-10-14 01:44:30,009 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:44:30,009 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 17 treesize of output 21 [2024-10-14 01:44:30,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 01:44:30,072 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 15 treesize of output 1 [2024-10-14 01:44:30,129 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 01:44:30,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-14 01:44:30,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 01:44:30,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:44:30,154 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 01:44:30,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-14 01:44:30,170 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-14 01:44:30,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-14 01:44:30,264 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-10-14 01:44:30,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 125 [2024-10-14 01:44:30,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 105 [2024-10-14 01:44:30,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-10-14 01:44:30,378 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-10-14 01:44:30,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 135 [2024-10-14 01:44:30,394 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-14 01:44:30,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 121 [2024-10-14 01:44:30,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 19 [2024-10-14 01:44:30,459 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-10-14 01:44:30,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 30 [2024-10-14 01:44:30,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:30,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:30,531 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (= 2 (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_628) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_627) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2024-10-14 01:44:30,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:30,618 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2024-10-14 01:44:30,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:30,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2024-10-14 01:44:30,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:30,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 121 [2024-10-14 01:44:30,647 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 45 treesize of output 27 [2024-10-14 01:44:30,687 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 30 treesize of output 22 [2024-10-14 01:44:30,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:30,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-10-14 01:44:30,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:30,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2024-10-14 01:44:30,794 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 70 treesize of output 62 [2024-10-14 01:44:30,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:30,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 56 [2024-10-14 01:44:30,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:30,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2024-10-14 01:44:30,877 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:44:30,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:30,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2024-10-14 01:44:30,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:30,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2024-10-14 01:44:30,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:30,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-14 01:44:30,969 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:44:30,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:30,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-10-14 01:44:30,983 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 11 treesize of output 7 [2024-10-14 01:44:31,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-14 01:44:31,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460066786] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:31,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:31,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2024-10-14 01:44:31,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121019577] [2024-10-14 01:44:31,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:31,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 01:44:31,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:31,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 01:44:31,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=508, Unknown=16, NotChecked=46, Total=650 [2024-10-14 01:44:31,537 INFO L87 Difference]: Start difference. First operand 112 states and 154 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:32,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:32,112 INFO L93 Difference]: Finished difference Result 143 states and 189 transitions. [2024-10-14 01:44:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 01:44:32,113 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 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 36 [2024-10-14 01:44:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:32,113 INFO L225 Difference]: With dead ends: 143 [2024-10-14 01:44:32,113 INFO L226 Difference]: Without dead ends: 137 [2024-10-14 01:44:32,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=731, Unknown=19, NotChecked=56, Total=930 [2024-10-14 01:44:32,114 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 91 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:32,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 546 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 368 Invalid, 0 Unknown, 87 Unchecked, 0.4s Time] [2024-10-14 01:44:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-14 01:44:32,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2024-10-14 01:44:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.3728813559322033) internal successors, (162), 118 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 162 transitions. [2024-10-14 01:44:32,121 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 162 transitions. Word has length 36 [2024-10-14 01:44:32,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:32,121 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 162 transitions. [2024-10-14 01:44:32,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 162 transitions. [2024-10-14 01:44:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 01:44:32,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:32,122 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:32,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 01:44:32,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:32,324 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:32,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:32,324 INFO L85 PathProgramCache]: Analyzing trace with hash 644451175, now seen corresponding path program 1 times [2024-10-14 01:44:32,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:32,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699368391] [2024-10-14 01:44:32,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:32,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 01:44:32,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 01:44:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 01:44:32,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 01:44:32,391 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 01:44:32,392 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 01:44:32,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 01:44:32,396 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:32,422 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 01:44:32,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:44:32 BoogieIcfgContainer [2024-10-14 01:44:32,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 01:44:32,428 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 01:44:32,428 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 01:44:32,428 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 01:44:32,428 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:44:13" (3/4) ... [2024-10-14 01:44:32,429 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 01:44:32,476 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 01:44:32,477 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 01:44:32,477 INFO L158 Benchmark]: Toolchain (without parser) took 20056.84ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 95.9MB in the beginning and 246.7MB in the end (delta: -150.9MB). Peak memory consumption was 740.7kB. Max. memory is 16.1GB. [2024-10-14 01:44:32,477 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:44:32,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.55ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 135.6MB in the end (delta: -40.0MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-10-14 01:44:32,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.22ms. Allocated memory is still 167.8MB. Free memory was 135.6MB in the beginning and 133.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:44:32,478 INFO L158 Benchmark]: Boogie Preprocessor took 58.62ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 130.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 01:44:32,478 INFO L158 Benchmark]: RCFGBuilder took 556.33ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 104.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 01:44:32,478 INFO L158 Benchmark]: TraceAbstraction took 18944.61ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 103.0MB in the beginning and 248.8MB in the end (delta: -145.8MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2024-10-14 01:44:32,478 INFO L158 Benchmark]: Witness Printer took 48.89ms. Allocated memory is still 318.8MB. Free memory was 248.8MB in the beginning and 246.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:44:32,479 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.55ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 135.6MB in the end (delta: -40.0MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.22ms. Allocated memory is still 167.8MB. Free memory was 135.6MB in the beginning and 133.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.62ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 130.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 556.33ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 104.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18944.61ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 103.0MB in the beginning and 248.8MB in the end (delta: -145.8MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. * Witness Printer took 48.89ms. Allocated memory is still 318.8MB. Free memory was 248.8MB in the beginning and 246.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 620]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) [L555] COND FALSE !(__VERIFIER_nondet_int()) [L574] n = ((void *)0) [L575] struct TreeNode* pred; VAL [root={-1:0}] [L576] COND TRUE \read(*root) [L577] pred = ((void *)0) [L578] n = root VAL [n={-1:0}, pred={0:0}, root={-1:0}] [L579] EXPR n->left [L579] n->left || n->right VAL [n={-1:0}, pred={0:0}, root={-1:0}] [L579] n->left || n->right [L579] EXPR n->right [L579] n->left || n->right VAL [n={-1:0}, pred={0:0}, root={-1:0}] [L579] COND FALSE !(n->left || n->right) [L586] COND FALSE !(\read(*pred)) [L592] root = ((void *)0) VAL [n={-1:0}, root={0:0}] [L576] COND FALSE !(\read(*root)) [L595] List a = (List) malloc(sizeof(struct node)); [L596] COND FALSE !(a == 0) VAL [a={-2:0}] [L597] List t; [L598] List p = a; VAL [a={-2:0}, p={-2:0}] [L599] COND TRUE __VERIFIER_nondet_int() [L600] p->h = 1 [L601] t = (List) malloc(sizeof(struct node)) [L602] COND FALSE !(t == 0) VAL [a={-2:0}, p={-2:0}, t={-3:0}] [L603] p->n = t [L604] EXPR p->n [L604] p = p->n [L599] COND FALSE !(__VERIFIER_nondet_int()) [L606] COND TRUE __VERIFIER_nondet_int() [L607] p->h = 2 [L608] t = (List) malloc(sizeof(struct node)) [L609] COND FALSE !(t == 0) VAL [a={-2:0}, p={-3:0}, t={-4:0}] [L610] p->n = t [L611] EXPR p->n [L611] p = p->n [L606] COND FALSE !(__VERIFIER_nondet_int()) [L613] p->h = 3 [L614] p = a VAL [p={-2:0}] [L615] EXPR p->h [L615] COND FALSE !(p->h == 2) [L617] EXPR p->h [L617] COND TRUE p->h == 1 [L618] EXPR p->n [L618] p = p->n VAL [p={-3:0}] [L617] EXPR p->h [L617] COND FALSE !(p->h == 1) [L619] EXPR p->h [L619] COND TRUE p->h != 3 [L620] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.9s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 537 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 537 mSDsluCounter, 3723 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 245 IncrementalHoareTripleChecker+Unchecked, 3111 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1694 IncrementalHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 612 mSDtfsCounter, 1694 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 345 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=9, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 73 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 571 NumberOfCodeBlocks, 571 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 707 ConstructedInterpolants, 51 QuantifiedInterpolants, 6743 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1244 ConjunctsInSsa, 249 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 43/122 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 01:44:32,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE