./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-nonlinear/color-magicseries2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/floats-nonlinear/color-magicseries2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'f056be744fcae26accb2c049a9cf7a4321bd3ba6c0302870967f442303a6d9cc'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-nonlinear/color-magicseries2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 f056be744fcae26accb2c049a9cf7a4321bd3ba6c0302870967f442303a6d9cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 22:17:56,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:17:56,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 22:17:56,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:17:56,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:17:56,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:17:56,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:17:56,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:17:56,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:17:56,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:17:56,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:17:56,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:17:56,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:17:56,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:17:56,621 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:17:56,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:17:56,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:17:56,621 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:17:56,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 22:17:56,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:17:56,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:17:56,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:17:56,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:17:56,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:17:56,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:17:56,623 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:17:56,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:17:56,623 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:17:56,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:17:56,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:17:56,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:17:56,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:17:56,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:17:56,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:17:56,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:17:56,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:17:56,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 22:17:56,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 22:17:56,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:17:56,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:17:56,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:17:56,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:17:56,624 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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 -> f056be744fcae26accb2c049a9cf7a4321bd3ba6c0302870967f442303a6d9cc [2024-11-06 22:17:56,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:17:56,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:17:56,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:17:56,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:17:56,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:17:56,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/color-magicseries2.c [2024-11-06 22:17:58,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:17:58,363 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:17:58,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-magicseries2.c [2024-11-06 22:17:58,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ea15f92e/728ead00803c4f3b9380764f50d7fd9a/FLAGcfec8956d [2024-11-06 22:17:58,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ea15f92e/728ead00803c4f3b9380764f50d7fd9a [2024-11-06 22:17:58,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:17:58,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:17:58,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:17:58,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:17:58,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:17:58,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:58" (1/1) ... [2024-11-06 22:17:58,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@561d82c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:58, skipping insertion in model container [2024-11-06 22:17:58,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:58" (1/1) ... [2024-11-06 22:17:58,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:17:58,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-magicseries2.c[613,626] [2024-11-06 22:17:58,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:17:58,893 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:17:58,901 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-magicseries2.c[613,626] [2024-11-06 22:17:58,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:17:58,928 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:17:58,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:58 WrapperNode [2024-11-06 22:17:58,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:17:58,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:17:58,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:17:58,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:17:58,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:58" (1/1) ... [2024-11-06 22:17:58,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:58" (1/1) ... [2024-11-06 22:17:58,971 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2024-11-06 22:17:58,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:17:58,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:17:58,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:17:58,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:17:58,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:58" (1/1) ... [2024-11-06 22:17:58,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:58" (1/1) ... [2024-11-06 22:17:58,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:58" (1/1) ... [2024-11-06 22:17:58,998 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2024-11-06 22:17:59,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:58" (1/1) ... [2024-11-06 22:17:59,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:58" (1/1) ... [2024-11-06 22:17:59,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:58" (1/1) ... [2024-11-06 22:17:59,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:58" (1/1) ... [2024-11-06 22:17:59,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:58" (1/1) ... [2024-11-06 22:17:59,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:58" (1/1) ... [2024-11-06 22:17:59,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:17:59,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:17:59,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:17:59,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:17:59,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:58" (1/1) ... [2024-11-06 22:17:59,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:17:59,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:17:59,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 22:17:59,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 22:17:59,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:17:59,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 22:17:59,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 22:17:59,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 22:17:59,092 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-06 22:17:59,092 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-06 22:17:59,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:17:59,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:17:59,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 22:17:59,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 22:17:59,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 22:17:59,174 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:17:59,176 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:17:59,408 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-06 22:17:59,408 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:17:59,420 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:17:59,420 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 22:17:59,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:59 BoogieIcfgContainer [2024-11-06 22:17:59,421 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:17:59,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:17:59,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:17:59,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:17:59,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:17:58" (1/3) ... [2024-11-06 22:17:59,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743cf279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:59, skipping insertion in model container [2024-11-06 22:17:59,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:58" (2/3) ... [2024-11-06 22:17:59,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743cf279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:59, skipping insertion in model container [2024-11-06 22:17:59,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:59" (3/3) ... [2024-11-06 22:17:59,431 INFO L112 eAbstractionObserver]: Analyzing ICFG color-magicseries2.c [2024-11-06 22:17:59,444 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:17:59,445 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:17:59,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:17:59,506 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;@ad70e6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:17:59,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:17:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:17:59,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 22:17:59,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:17:59,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:17:59,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:17:59,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:17:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1909413201, now seen corresponding path program 1 times [2024-11-06 22:17:59,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:17:59,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801639339] [2024-11-06 22:17:59,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:17:59,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:17:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:59,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:17:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:17:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:17:59,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:17:59,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801639339] [2024-11-06 22:17:59,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801639339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:17:59,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:17:59,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:17:59,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663056452] [2024-11-06 22:17:59,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:17:59,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:17:59,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:17:59,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:17:59,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:17:59,926 INFO L87 Difference]: Start difference. First operand has 39 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:17:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:17:59,973 INFO L93 Difference]: Finished difference Result 75 states and 108 transitions. [2024-11-06 22:17:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:17:59,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-06 22:17:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:17:59,983 INFO L225 Difference]: With dead ends: 75 [2024-11-06 22:17:59,983 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 22:17:59,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-11-06 22:17:59,988 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:17:59,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:17:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 22:18:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-06 22:18:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 22:18:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2024-11-06 22:18:00,023 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2024-11-06 22:18:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:00,023 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2024-11-06 22:18:00,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:18:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2024-11-06 22:18:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 22:18:00,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:00,025 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:18:00,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 22:18:00,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:00,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:00,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2092151088, now seen corresponding path program 1 times [2024-11-06 22:18:00,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:00,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952589063] [2024-11-06 22:18:00,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:00,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:18:00,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:00,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952589063] [2024-11-06 22:18:00,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952589063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:18:00,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:18:00,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:18:00,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272077558] [2024-11-06 22:18:00,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:18:00,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:18:00,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:00,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:18:00,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:18:00,157 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:18:00,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:00,178 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2024-11-06 22:18:00,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:18:00,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-06 22:18:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:00,180 INFO L225 Difference]: With dead ends: 43 [2024-11-06 22:18:00,180 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 22:18:00,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:18:00,181 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:00,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:18:00,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 22:18:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-06 22:18:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 22:18:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2024-11-06 22:18:00,191 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 17 [2024-11-06 22:18:00,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:00,191 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2024-11-06 22:18:00,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:18:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2024-11-06 22:18:00,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 22:18:00,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:00,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:18:00,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 22:18:00,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:00,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:00,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1014348991, now seen corresponding path program 1 times [2024-11-06 22:18:00,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:00,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652049518] [2024-11-06 22:18:00,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:18:00,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:00,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652049518] [2024-11-06 22:18:00,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652049518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:18:00,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:18:00,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:18:00,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647572829] [2024-11-06 22:18:00,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:18:00,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:18:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:00,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:18:00,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:18:00,242 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:18:00,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:00,258 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2024-11-06 22:18:00,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:18:00,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-06 22:18:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:00,260 INFO L225 Difference]: With dead ends: 55 [2024-11-06 22:18:00,260 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 22:18:00,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:18:00,261 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 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-11-06 22:18:00,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:18:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 22:18:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-06 22:18:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 22:18:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-06 22:18:00,270 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 19 [2024-11-06 22:18:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:00,270 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-06 22:18:00,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:18:00,270 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-06 22:18:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 22:18:00,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:00,271 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] [2024-11-06 22:18:00,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 22:18:00,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:00,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:00,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1993641799, now seen corresponding path program 1 times [2024-11-06 22:18:00,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:00,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607394378] [2024-11-06 22:18:00,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:00,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-06 22:18:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:18:00,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:00,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607394378] [2024-11-06 22:18:00,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607394378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:18:00,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:18:00,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:18:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326079105] [2024-11-06 22:18:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:18:00,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:18:00,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:00,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:18:00,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:18:00,342 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 22:18:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:00,376 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2024-11-06 22:18:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:18:00,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-06 22:18:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:00,377 INFO L225 Difference]: With dead ends: 65 [2024-11-06 22:18:00,377 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 22:18:00,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:18:00,380 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:00,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:18:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 22:18:00,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-06 22:18:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 22:18:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-06 22:18:00,389 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 25 [2024-11-06 22:18:00,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:00,390 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-06 22:18:00,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 22:18:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-11-06 22:18:00,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 22:18:00,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:00,391 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:18:00,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 22:18:00,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:00,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:00,391 INFO L85 PathProgramCache]: Analyzing trace with hash 719872684, now seen corresponding path program 1 times [2024-11-06 22:18:00,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:00,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64404532] [2024-11-06 22:18:00,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:00,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 22:18:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 22:18:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 22:18:00,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:00,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64404532] [2024-11-06 22:18:00,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64404532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:18:00,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:18:00,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:18:00,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838228737] [2024-11-06 22:18:00,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:18:00,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:18:00,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:00,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:18:00,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:18:00,463 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 22:18:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:00,495 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-11-06 22:18:00,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:18:00,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-06 22:18:00,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:00,496 INFO L225 Difference]: With dead ends: 69 [2024-11-06 22:18:00,496 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 22:18:00,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:18:00,497 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:00,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:18:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 22:18:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-06 22:18:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:18:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-11-06 22:18:00,505 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 31 [2024-11-06 22:18:00,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:00,505 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-06 22:18:00,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 22:18:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-11-06 22:18:00,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 22:18:00,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:00,506 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 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-11-06 22:18:00,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 22:18:00,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:00,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:00,506 INFO L85 PathProgramCache]: Analyzing trace with hash 683802393, now seen corresponding path program 1 times [2024-11-06 22:18:00,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:00,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649252352] [2024-11-06 22:18:00,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:00,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:18:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:18:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:18:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 22:18:00,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:00,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649252352] [2024-11-06 22:18:00,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649252352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:18:00,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:18:00,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:18:00,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038712247] [2024-11-06 22:18:00,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:18:00,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:18:00,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:00,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:18:00,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:18:00,603 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:00,619 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-06 22:18:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:18:00,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-11-06 22:18:00,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:00,621 INFO L225 Difference]: With dead ends: 40 [2024-11-06 22:18:00,621 INFO L226 Difference]: Without dead ends: 35 [2024-11-06 22:18:00,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-11-06 22:18:00,621 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 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-11-06 22:18:00,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:18:00,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-06 22:18:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-06 22:18:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:18:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-06 22:18:00,629 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 37 [2024-11-06 22:18:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:00,630 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-06 22:18:00,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-11-06 22:18:00,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 22:18:00,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:00,630 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 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-11-06 22:18:00,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 22:18:00,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:00,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:00,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1611689165, now seen corresponding path program 1 times [2024-11-06 22:18:00,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:00,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977853195] [2024-11-06 22:18:00,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:18:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:18:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:18:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 22:18:00,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:00,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977853195] [2024-11-06 22:18:00,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977853195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:18:00,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:18:00,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:18:00,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140844723] [2024-11-06 22:18:00,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:18:00,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:18:00,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:00,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:18:00,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:18:00,725 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:00,757 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-11-06 22:18:00,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:18:00,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-11-06 22:18:00,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:00,758 INFO L225 Difference]: With dead ends: 50 [2024-11-06 22:18:00,758 INFO L226 Difference]: Without dead ends: 43 [2024-11-06 22:18:00,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-11-06 22:18:00,759 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:00,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:18:00,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-06 22:18:00,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-11-06 22:18:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:18:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-06 22:18:00,767 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 40 [2024-11-06 22:18:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:00,770 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-06 22:18:00,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-06 22:18:00,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 22:18:00,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:00,771 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 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-11-06 22:18:00,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 22:18:00,771 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:00,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:00,772 INFO L85 PathProgramCache]: Analyzing trace with hash 35157834, now seen corresponding path program 1 times [2024-11-06 22:18:00,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:00,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35551816] [2024-11-06 22:18:00,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:00,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:18:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:18:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:18:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 22:18:00,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:00,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35551816] [2024-11-06 22:18:00,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35551816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:18:00,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:18:00,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:18:00,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670881726] [2024-11-06 22:18:00,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:18:00,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:18:00,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:00,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:18:00,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:18:00,854 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:00,873 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-11-06 22:18:00,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:18:00,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-06 22:18:00,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:00,875 INFO L225 Difference]: With dead ends: 53 [2024-11-06 22:18:00,875 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 22:18:00,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-11-06 22:18:00,876 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:00,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:18:00,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 22:18:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-06 22:18:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:18:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-11-06 22:18:00,881 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 42 [2024-11-06 22:18:00,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:00,881 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-06 22:18:00,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-11-06 22:18:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-06 22:18:00,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:00,884 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:18:00,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 22:18:00,884 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:00,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:00,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1234560462, now seen corresponding path program 1 times [2024-11-06 22:18:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:00,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904681318] [2024-11-06 22:18:00,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:00,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:18:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:18:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:18:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 22:18:00,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:00,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904681318] [2024-11-06 22:18:00,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904681318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:18:00,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275641323] [2024-11-06 22:18:00,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:00,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:18:00,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:18:00,965 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:18:00,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 22:18:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:01,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 22:18:01,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:18:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 22:18:01,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:18:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 22:18:01,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275641323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:18:01,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:18:01,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-06 22:18:01,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047256870] [2024-11-06 22:18:01,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:18:01,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 22:18:01,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:01,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 22:18:01,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:18:01,187 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:01,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:01,216 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2024-11-06 22:18:01,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:18:01,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2024-11-06 22:18:01,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:01,218 INFO L225 Difference]: With dead ends: 61 [2024-11-06 22:18:01,219 INFO L226 Difference]: Without dead ends: 46 [2024-11-06 22:18:01,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:18:01,219 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:01,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:18:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-06 22:18:01,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-06 22:18:01,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:18:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-11-06 22:18:01,227 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 45 [2024-11-06 22:18:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:01,229 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-06 22:18:01,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-06 22:18:01,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-06 22:18:01,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:01,230 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 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-11-06 22:18:01,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 22:18:01,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:18:01,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:01,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:01,432 INFO L85 PathProgramCache]: Analyzing trace with hash 657433930, now seen corresponding path program 2 times [2024-11-06 22:18:01,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:01,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383984124] [2024-11-06 22:18:01,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:01,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:01,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:01,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:18:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:01,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:18:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:01,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:18:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-06 22:18:01,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:01,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383984124] [2024-11-06 22:18:01,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383984124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:18:01,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:18:01,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:18:01,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547513587] [2024-11-06 22:18:01,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:18:01,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:18:01,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:01,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:18:01,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:18:01,538 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:01,555 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-11-06 22:18:01,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:18:01,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 54 [2024-11-06 22:18:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:01,557 INFO L225 Difference]: With dead ends: 52 [2024-11-06 22:18:01,558 INFO L226 Difference]: Without dead ends: 46 [2024-11-06 22:18:01,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:18:01,559 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:01,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:18:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-06 22:18:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-06 22:18:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:18:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2024-11-06 22:18:01,567 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 54 [2024-11-06 22:18:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:01,569 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2024-11-06 22:18:01,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:01,570 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-11-06 22:18:01,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-06 22:18:01,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:01,570 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:18:01,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 22:18:01,571 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:01,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:01,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2116133056, now seen corresponding path program 1 times [2024-11-06 22:18:01,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:01,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138010027] [2024-11-06 22:18:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:01,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:01,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:01,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:18:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:01,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:18:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:01,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:18:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-06 22:18:01,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:01,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138010027] [2024-11-06 22:18:01,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138010027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:18:01,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901254576] [2024-11-06 22:18:01,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:01,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:18:01,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:18:01,697 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:18:01,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 22:18:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:01,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 22:18:01,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:18:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-06 22:18:01,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:18:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-06 22:18:01,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901254576] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:18:01,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:18:01,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-06 22:18:01,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599053364] [2024-11-06 22:18:01,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:18:01,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 22:18:01,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:01,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 22:18:01,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:18:01,903 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:01,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:01,941 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2024-11-06 22:18:01,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:18:01,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2024-11-06 22:18:01,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:01,943 INFO L225 Difference]: With dead ends: 104 [2024-11-06 22:18:01,943 INFO L226 Difference]: Without dead ends: 97 [2024-11-06 22:18:01,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:18:01,944 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 20 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:01,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 132 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:18:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-06 22:18:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-06 22:18:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 91 states have internal predecessors, (113), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:18:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 121 transitions. [2024-11-06 22:18:01,953 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 121 transitions. Word has length 57 [2024-11-06 22:18:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:01,953 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 121 transitions. [2024-11-06 22:18:01,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2024-11-06 22:18:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-06 22:18:01,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:01,954 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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-11-06 22:18:01,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 22:18:02,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:18:02,155 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:02,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:02,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2022113907, now seen corresponding path program 2 times [2024-11-06 22:18:02,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:02,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675508467] [2024-11-06 22:18:02,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:02,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:03,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:18:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:03,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:18:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:03,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:18:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 245 proven. 88 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-06 22:18:03,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:03,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675508467] [2024-11-06 22:18:03,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675508467] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:18:03,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053989357] [2024-11-06 22:18:03,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:18:03,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:18:03,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:18:03,161 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:18:03,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 22:18:03,323 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:18:03,323 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:18:03,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-06 22:18:03,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:18:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 181 proven. 22 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-11-06 22:18:03,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:18:03,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:18:03,931 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 27 treesize of output 19 [2024-11-06 22:18:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 181 proven. 22 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-11-06 22:18:04,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053989357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:18:04,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:18:04,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 33 [2024-11-06 22:18:04,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220562129] [2024-11-06 22:18:04,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:18:04,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-06 22:18:04,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:04,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-06 22:18:04,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2024-11-06 22:18:04,006 INFO L87 Difference]: Start difference. First operand 97 states and 121 transitions. Second operand has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 22:18:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:06,321 INFO L93 Difference]: Finished difference Result 302 states and 393 transitions. [2024-11-06 22:18:06,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-06 22:18:06,322 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 108 [2024-11-06 22:18:06,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:06,323 INFO L225 Difference]: With dead ends: 302 [2024-11-06 22:18:06,324 INFO L226 Difference]: Without dead ends: 208 [2024-11-06 22:18:06,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2072 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1022, Invalid=6634, Unknown=0, NotChecked=0, Total=7656 [2024-11-06 22:18:06,329 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 203 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:06,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 607 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 22:18:06,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-06 22:18:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 185. [2024-11-06 22:18:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 179 states have (on average 1.2849162011173185) internal successors, (230), 179 states have internal predecessors, (230), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:18:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 238 transitions. [2024-11-06 22:18:06,354 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 238 transitions. Word has length 108 [2024-11-06 22:18:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:06,356 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 238 transitions. [2024-11-06 22:18:06,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 22:18:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 238 transitions. [2024-11-06 22:18:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-06 22:18:06,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:06,357 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 14, 4, 4, 4, 4, 4, 4, 4, 4, 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-11-06 22:18:06,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 22:18:06,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:18:06,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:06,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:06,558 INFO L85 PathProgramCache]: Analyzing trace with hash -242017033, now seen corresponding path program 1 times [2024-11-06 22:18:06,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:06,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568124056] [2024-11-06 22:18:06,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:06,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:07,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:07,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:18:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:07,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:18:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:07,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:18:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 214 proven. 178 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-06 22:18:07,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:07,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568124056] [2024-11-06 22:18:07,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568124056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:18:07,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780238222] [2024-11-06 22:18:07,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:07,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:18:07,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:18:07,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:18:07,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 22:18:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:07,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-06 22:18:07,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:18:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 187 proven. 240 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-06 22:18:08,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:18:08,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:18:08,445 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 26 treesize of output 19 [2024-11-06 22:18:08,633 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 188 proven. 222 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-06 22:18:08,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780238222] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:18:08,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:18:08,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 16] total 49 [2024-11-06 22:18:08,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989215331] [2024-11-06 22:18:08,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:18:08,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-06 22:18:08,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:08,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-06 22:18:08,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2159, Unknown=0, NotChecked=0, Total=2352 [2024-11-06 22:18:08,636 INFO L87 Difference]: Start difference. First operand 185 states and 238 transitions. Second operand has 49 states, 49 states have (on average 3.142857142857143) internal successors, (154), 49 states have internal predecessors, (154), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:21,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:21,063 INFO L93 Difference]: Finished difference Result 1215 states and 1578 transitions. [2024-11-06 22:18:21,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 412 states. [2024-11-06 22:18:21,064 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.142857142857143) internal successors, (154), 49 states have internal predecessors, (154), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 108 [2024-11-06 22:18:21,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:21,072 INFO L225 Difference]: With dead ends: 1215 [2024-11-06 22:18:21,072 INFO L226 Difference]: Without dead ends: 1092 [2024-11-06 22:18:21,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 434 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82299 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=9337, Invalid=180323, Unknown=0, NotChecked=0, Total=189660 [2024-11-06 22:18:21,093 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 1339 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 6119 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 6172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 6119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:21,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 985 Invalid, 6172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 6119 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 22:18:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2024-11-06 22:18:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 850. [2024-11-06 22:18:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 844 states have (on average 1.3151658767772512) internal successors, (1110), 844 states have internal predecessors, (1110), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:18:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1118 transitions. [2024-11-06 22:18:21,190 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1118 transitions. Word has length 108 [2024-11-06 22:18:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:21,191 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1118 transitions. [2024-11-06 22:18:21,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.142857142857143) internal successors, (154), 49 states have internal predecessors, (154), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1118 transitions. [2024-11-06 22:18:21,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-06 22:18:21,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:21,196 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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-11-06 22:18:21,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 22:18:21,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-06 22:18:21,400 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:21,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1272944137, now seen corresponding path program 2 times [2024-11-06 22:18:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:21,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811448969] [2024-11-06 22:18:21,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:22,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:22,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:18:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:22,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:18:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:22,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:18:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 10 proven. 402 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-06 22:18:22,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:22,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811448969] [2024-11-06 22:18:22,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811448969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:18:22,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475535597] [2024-11-06 22:18:22,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:18:22,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:18:22,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:18:22,084 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:18:22,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 22:18:22,205 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:18:22,206 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:18:22,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-06 22:18:22,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:18:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 245 proven. 90 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-06 22:18:22,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:18:22,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:18:22,631 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 27 treesize of output 19 [2024-11-06 22:18:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 245 proven. 80 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-06 22:18:22,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475535597] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:18:22,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:18:22,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 11] total 35 [2024-11-06 22:18:22,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039997114] [2024-11-06 22:18:22,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:18:22,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-06 22:18:22,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:22,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-06 22:18:22,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2024-11-06 22:18:22,777 INFO L87 Difference]: Start difference. First operand 850 states and 1118 transitions. Second operand has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:24,385 INFO L93 Difference]: Finished difference Result 2152 states and 2857 transitions. [2024-11-06 22:18:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-06 22:18:24,386 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 108 [2024-11-06 22:18:24,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:24,393 INFO L225 Difference]: With dead ends: 2152 [2024-11-06 22:18:24,393 INFO L226 Difference]: Without dead ends: 1534 [2024-11-06 22:18:24,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2168 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=703, Invalid=6607, Unknown=0, NotChecked=0, Total=7310 [2024-11-06 22:18:24,396 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 142 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:24,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 762 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 22:18:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2024-11-06 22:18:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1262. [2024-11-06 22:18:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1256 states have (on average 1.3176751592356688) internal successors, (1655), 1256 states have internal predecessors, (1655), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:18:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1663 transitions. [2024-11-06 22:18:24,480 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1663 transitions. Word has length 108 [2024-11-06 22:18:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:24,481 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1663 transitions. [2024-11-06 22:18:24,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1663 transitions. [2024-11-06 22:18:24,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-06 22:18:24,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:24,486 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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-11-06 22:18:24,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 22:18:24,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-06 22:18:24,691 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:24,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:24,691 INFO L85 PathProgramCache]: Analyzing trace with hash 974766455, now seen corresponding path program 3 times [2024-11-06 22:18:24,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:24,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470134257] [2024-11-06 22:18:24,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:24,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:25,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:25,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:18:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:18:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:25,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:18:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 184 proven. 28 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-11-06 22:18:25,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:25,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470134257] [2024-11-06 22:18:25,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470134257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:18:25,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002717354] [2024-11-06 22:18:25,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 22:18:25,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:18:25,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:18:25,599 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:18:25,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 22:18:25,722 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-06 22:18:25,722 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:18:25,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-06 22:18:25,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:18:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 122 proven. 7 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2024-11-06 22:18:26,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:18:26,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:18:26,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 16 [2024-11-06 22:18:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 89 proven. 210 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-06 22:18:26,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002717354] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:18:26,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:18:26,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 21] total 43 [2024-11-06 22:18:26,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49895663] [2024-11-06 22:18:26,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:18:26,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-06 22:18:26,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:26,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-06 22:18:26,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1498, Unknown=0, NotChecked=0, Total=1806 [2024-11-06 22:18:26,663 INFO L87 Difference]: Start difference. First operand 1262 states and 1663 transitions. Second operand has 43 states, 43 states have (on average 2.488372093023256) internal successors, (107), 43 states have internal predecessors, (107), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 22:18:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:28,977 INFO L93 Difference]: Finished difference Result 5435 states and 7082 transitions. [2024-11-06 22:18:28,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-06 22:18:28,977 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.488372093023256) internal successors, (107), 43 states have internal predecessors, (107), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 108 [2024-11-06 22:18:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:28,996 INFO L225 Difference]: With dead ends: 5435 [2024-11-06 22:18:28,996 INFO L226 Difference]: Without dead ends: 4397 [2024-11-06 22:18:29,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2938 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1899, Invalid=9021, Unknown=0, NotChecked=0, Total=10920 [2024-11-06 22:18:29,000 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 276 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:29,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 568 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 22:18:29,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2024-11-06 22:18:29,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 2154. [2024-11-06 22:18:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 2148 states have (on average 1.3435754189944134) internal successors, (2886), 2148 states have internal predecessors, (2886), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:18:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2894 transitions. [2024-11-06 22:18:29,217 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2894 transitions. Word has length 108 [2024-11-06 22:18:29,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:29,217 INFO L471 AbstractCegarLoop]: Abstraction has 2154 states and 2894 transitions. [2024-11-06 22:18:29,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.488372093023256) internal successors, (107), 43 states have internal predecessors, (107), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 22:18:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2894 transitions. [2024-11-06 22:18:29,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-06 22:18:29,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:29,222 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 11, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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-11-06 22:18:29,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-06 22:18:29,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-06 22:18:29,427 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:29,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash -241387271, now seen corresponding path program 4 times [2024-11-06 22:18:29,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:29,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906270425] [2024-11-06 22:18:29,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:29,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:29,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:29,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:18:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:29,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:18:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:29,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:18:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 202 proven. 27 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-06 22:18:29,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:29,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906270425] [2024-11-06 22:18:29,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906270425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:18:29,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932062114] [2024-11-06 22:18:29,858 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-06 22:18:29,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:18:29,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:18:29,860 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:18:29,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-06 22:18:29,964 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-06 22:18:29,964 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:18:29,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 22:18:29,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:18:30,050 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 17 treesize of output 9 [2024-11-06 22:18:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 320 proven. 11 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-06 22:18:30,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:18:30,194 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-06 22:18:30,195 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 17 treesize of output 9 [2024-11-06 22:18:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 315 proven. 16 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-06 22:18:30,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932062114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:18:30,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:18:30,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2024-11-06 22:18:30,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111459734] [2024-11-06 22:18:30,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:18:30,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-06 22:18:30,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:30,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-06 22:18:30,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-06 22:18:30,212 INFO L87 Difference]: Start difference. First operand 2154 states and 2894 transitions. Second operand has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:30,846 INFO L93 Difference]: Finished difference Result 5535 states and 7592 transitions. [2024-11-06 22:18:30,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-06 22:18:30,846 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 108 [2024-11-06 22:18:30,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:30,859 INFO L225 Difference]: With dead ends: 5535 [2024-11-06 22:18:30,859 INFO L226 Difference]: Without dead ends: 3501 [2024-11-06 22:18:30,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 214 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2024-11-06 22:18:30,862 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 41 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:30,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 444 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 22:18:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2024-11-06 22:18:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 2323. [2024-11-06 22:18:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2323 states, 2317 states have (on average 1.356063875701338) internal successors, (3142), 2317 states have internal predecessors, (3142), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:18:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3150 transitions. [2024-11-06 22:18:31,179 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3150 transitions. Word has length 108 [2024-11-06 22:18:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:31,180 INFO L471 AbstractCegarLoop]: Abstraction has 2323 states and 3150 transitions. [2024-11-06 22:18:31,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3150 transitions. [2024-11-06 22:18:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-06 22:18:31,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:31,186 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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-11-06 22:18:31,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-06 22:18:31,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:18:31,389 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:31,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:31,390 INFO L85 PathProgramCache]: Analyzing trace with hash -658940109, now seen corresponding path program 5 times [2024-11-06 22:18:31,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:31,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367571303] [2024-11-06 22:18:31,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:31,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:31,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:31,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:18:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:31,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:18:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:31,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:18:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 248 proven. 80 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-11-06 22:18:31,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:31,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367571303] [2024-11-06 22:18:31,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367571303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:18:31,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729052001] [2024-11-06 22:18:31,866 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-06 22:18:31,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:18:31,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:18:31,869 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:18:31,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-06 22:18:31,958 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-11-06 22:18:31,958 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:18:31,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-06 22:18:31,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:18:32,086 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 21 treesize of output 9 [2024-11-06 22:18:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 336 proven. 24 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-06 22:18:32,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:18:32,226 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-06 22:18:32,226 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 19 treesize of output 9 [2024-11-06 22:18:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 321 proven. 39 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-06 22:18:32,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729052001] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:18:32,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:18:32,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 25 [2024-11-06 22:18:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229784738] [2024-11-06 22:18:32,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:18:32,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-06 22:18:32,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:32,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-06 22:18:32,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2024-11-06 22:18:32,250 INFO L87 Difference]: Start difference. First operand 2323 states and 3150 transitions. Second operand has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:33,015 INFO L93 Difference]: Finished difference Result 5627 states and 7642 transitions. [2024-11-06 22:18:33,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-06 22:18:33,015 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 108 [2024-11-06 22:18:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:33,029 INFO L225 Difference]: With dead ends: 5627 [2024-11-06 22:18:33,029 INFO L226 Difference]: Without dead ends: 3788 [2024-11-06 22:18:33,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 211 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=377, Invalid=1693, Unknown=0, NotChecked=0, Total=2070 [2024-11-06 22:18:33,032 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:33,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 441 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 22:18:33,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3788 states. [2024-11-06 22:18:33,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3788 to 2849. [2024-11-06 22:18:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2849 states, 2843 states have (on average 1.3373197326767499) internal successors, (3802), 2843 states have internal predecessors, (3802), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 22:18:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 3810 transitions. [2024-11-06 22:18:33,298 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 3810 transitions. Word has length 108 [2024-11-06 22:18:33,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:33,299 INFO L471 AbstractCegarLoop]: Abstraction has 2849 states and 3810 transitions. [2024-11-06 22:18:33,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 22:18:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 3810 transitions. [2024-11-06 22:18:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-06 22:18:33,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:33,305 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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-11-06 22:18:33,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-06 22:18:33,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-06 22:18:33,510 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:33,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash -200712521, now seen corresponding path program 6 times [2024-11-06 22:18:33,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:33,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914194617] [2024-11-06 22:18:33,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:33,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:34,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:18:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:34,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:18:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:34,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-06 22:18:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:34,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:18:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:18:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 234 proven. 65 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-06 22:18:34,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:18:34,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914194617] [2024-11-06 22:18:34,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914194617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:18:34,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325024434] [2024-11-06 22:18:34,282 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-06 22:18:34,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:18:34,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:18:34,285 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:18:34,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-06 22:18:34,399 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-11-06 22:18:34,399 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:18:34,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-06 22:18:34,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:18:35,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:18:35,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 32 [2024-11-06 22:18:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 247 proven. 73 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-06 22:18:35,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:18:36,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:18:36,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 23 [2024-11-06 22:18:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 225 proven. 120 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-06 22:18:36,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325024434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:18:36,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:18:36,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 22] total 54 [2024-11-06 22:18:36,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814065637] [2024-11-06 22:18:36,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:18:36,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-06 22:18:36,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:18:36,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-06 22:18:36,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2648, Unknown=0, NotChecked=0, Total=2862 [2024-11-06 22:18:36,493 INFO L87 Difference]: Start difference. First operand 2849 states and 3810 transitions. Second operand has 54 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 54 states have internal predecessors, (136), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-06 22:18:42,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:18:42,220 INFO L93 Difference]: Finished difference Result 7407 states and 9924 transitions. [2024-11-06 22:18:42,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2024-11-06 22:18:42,221 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 54 states have internal predecessors, (136), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-06 22:18:42,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:18:42,238 INFO L225 Difference]: With dead ends: 7407 [2024-11-06 22:18:42,238 INFO L226 Difference]: Without dead ends: 5353 [2024-11-06 22:18:42,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5941 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1403, Invalid=18903, Unknown=0, NotChecked=0, Total=20306 [2024-11-06 22:18:42,243 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 188 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 3433 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 3460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 22:18:42,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1138 Invalid, 3460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3433 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 22:18:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5353 states. [2024-11-06 22:18:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5353 to 4152. [2024-11-06 22:18:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 4142 states have (on average 1.316030902945437) internal successors, (5451), 4141 states have internal predecessors, (5451), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-06 22:18:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 5472 transitions. [2024-11-06 22:18:42,736 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 5472 transitions. Word has length 108 [2024-11-06 22:18:42,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:18:42,736 INFO L471 AbstractCegarLoop]: Abstraction has 4152 states and 5472 transitions. [2024-11-06 22:18:42,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 54 states have internal predecessors, (136), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-06 22:18:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 5472 transitions. [2024-11-06 22:18:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-06 22:18:42,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:18:42,745 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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-11-06 22:18:42,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-06 22:18:42,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-06 22:18:42,947 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:18:42,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:18:42,948 INFO L85 PathProgramCache]: Analyzing trace with hash -609406221, now seen corresponding path program 7 times [2024-11-06 22:18:42,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:18:42,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863538720] [2024-11-06 22:18:42,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:18:42,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:18:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 22:18:42,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 22:18:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 22:18:43,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 22:18:43,037 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 22:18:43,038 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 22:18:43,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-06 22:18:43,043 INFO L407 BasicCegarLoop]: Path program histogram: [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:18:43,102 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 22:18:43,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:18:43 BoogieIcfgContainer [2024-11-06 22:18:43,108 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 22:18:43,109 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 22:18:43,109 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 22:18:43,109 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 22:18:43,110 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:59" (3/4) ... [2024-11-06 22:18:43,111 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-06 22:18:43,176 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 22:18:43,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 22:18:43,178 INFO L158 Benchmark]: Toolchain (without parser) took 44444.48ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 91.9MB in the beginning and 484.8MB in the end (delta: -392.8MB). Peak memory consumption was 244.0MB. Max. memory is 16.1GB. [2024-11-06 22:18:43,178 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:18:43,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.02ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 80.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:18:43,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.85ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 78.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:18:43,179 INFO L158 Benchmark]: Boogie Preprocessor took 50.30ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 77.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:18:43,180 INFO L158 Benchmark]: RCFGBuilder took 397.44ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 62.9MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:18:43,182 INFO L158 Benchmark]: TraceAbstraction took 43684.85ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 62.3MB in the beginning and 489.2MB in the end (delta: -427.0MB). Peak memory consumption was 210.4MB. Max. memory is 16.1GB. [2024-11-06 22:18:43,183 INFO L158 Benchmark]: Witness Printer took 67.78ms. Allocated memory is still 755.0MB. Free memory was 489.2MB in the beginning and 484.8MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:18:43,184 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.25ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.02ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 80.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.85ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 78.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.30ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 77.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 397.44ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 62.9MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 43684.85ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 62.3MB in the beginning and 489.2MB in the end (delta: -427.0MB). Peak memory consumption was 210.4MB. Max. memory is 16.1GB. * Witness Printer took 67.78ms. Allocated memory is still 755.0MB. Free memory was 489.2MB in the beginning and 484.8MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. 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: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L56] int x, y, z, w; [L57] x = __VERIFIER_nondet_int() [L58] y = __VERIFIER_nondet_int() [L59] z = __VERIFIER_nondet_int() [L60] w = __VERIFIER_nondet_int() [L61] CALL, EXPR solve(x, y, z, w) [L44] CALL, EXPR check_domain(s0) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=2, \result=1] [L44] RET, EXPR check_domain(s0) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) VAL [s0=2, s1=0, s2=2, s3=0] [L44] CALL, EXPR check_domain(s1) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=0, \result=1] [L44] RET, EXPR check_domain(s1) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) && check_domain(s2) VAL [s0=2, s1=0, s2=2, s3=0] [L44] CALL, EXPR check_domain(s2) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=2, \result=1] [L44] RET, EXPR check_domain(s2) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) && check_domain(s2) VAL [s0=2, s1=0, s2=2, s3=0] [L44-L45] check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) VAL [s0=2, s1=0, s2=2, s3=0] [L45] CALL, EXPR check_domain(s3) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=0, \result=1] [L45] RET, EXPR check_domain(s3) VAL [s0=2, s1=0, s2=2, s3=0] [L44-L45] check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) VAL [s0=2, s1=0, s2=2, s3=0] [L44-L45] COND TRUE check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) [L46-L47] s0 + s1 + s2 + s3 == 4 && s0 * 0 + s1 * 1 + s2 * 2 + s3 * 3 == 4 && check_sum(s0, s1, s2, s3) VAL [s0=2, s1=0, s2=2, s3=0] [L46-L47] s0 + s1 + s2 + s3 == 4 && s0 * 0 + s1 * 1 + s2 * 2 + s3 * 3 == 4 && check_sum(s0, s1, s2, s3) [L47] CALL, EXPR check_sum(s0, s1, s2, s3) [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L34] int i = 0; VAL [i=0, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=0, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=0, j=1, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=0, j=1, s={5:0}, sum=1] [L36] j++ VAL [i=0, j=2, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=0, j=3, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=0, j=3, s={5:0}, sum=2] [L36] j++ VAL [i=0, j=4, s={5:0}, sum=2] [L36] COND FALSE !(j < 4) VAL [i=0, s={5:0}, sum=2] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=1, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=1, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=1, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=2, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=3, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=4, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=1, s={5:0}, sum=0] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=2, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=2, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=2, j=0, s={5:0}, sum=1] [L36] j++ VAL [i=2, j=1, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=2, j=2, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=2, j=2, s={5:0}, sum=2] [L36] j++ VAL [i=2, j=3, s={5:0}, sum=2] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=2, j=4, s={5:0}, sum=2] [L36] COND FALSE !(j < 4) VAL [i=2, s={5:0}, sum=2] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=3, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=3, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=1, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=2, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=3, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=4, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=3, s={5:0}, sum=0] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=4, s={5:0}] [L34] COND FALSE !(i < 4) VAL [s={5:0}] [L40] return 1; [L33] int s[4] = {s0, s1, s2, s3}; [L40] return 1; VAL [\result=1] [L47] RET, EXPR check_sum(s0, s1, s2, s3) [L46-L47] s0 + s1 + s2 + s3 == 4 && s0 * 0 + s1 * 1 + s2 * 2 + s3 * 3 == 4 && check_sum(s0, s1, s2, s3) [L46-L47] COND TRUE s0 + s1 + s2 + s3 == 4 && s0 * 0 + s1 * 1 + s2 * 2 + s3 * 3 == 4 && check_sum(s0, s1, s2, s3) [L48] return 1; VAL [\result=1] [L61] RET, EXPR solve(x, y, z, w) [L61] CALL __VERIFIER_assert(!solve(x, y, z, w)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.6s, OverallIterations: 19, TraceHistogramMax: 16, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 26.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2289 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2289 mSDsluCounter, 6172 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5418 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15052 IncrementalHoareTripleChecker+Invalid, 15211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 754 mSDtfsCounter, 15052 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2663 GetRequests, 1709 SyntacticMatches, 10 SemanticMatches, 944 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96222 ImplicationChecksByTransitivity, 22.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4152occurred in iteration=18, InterpolantAutomatonStates: 843, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 6111 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 2106 NumberOfCodeBlocks, 1949 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 2820 ConstructedInterpolants, 0 QuantifiedInterpolants, 13707 SizeOfPredicates, 61 NumberOfNonLiveVariables, 2450 ConjunctsInSsa, 262 ConjunctsInUnsatCore, 36 InterpolantComputations, 9 PerfectInterpolantSequences, 8422/10472 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-11-06 22:18:43,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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