./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex3.i --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/loop-lit/hh2012-ex3.i', '-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', '3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb'] 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/loop-lit/hh2012-ex3.i -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 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 22:38:23,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:38:23,855 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:38:23,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:38:23,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:38:23,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:38:23,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:38:23,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:38:23,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:38:23,894 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:38:23,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:38:23,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:38:23,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:38:23,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:38:23,895 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:38:23,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:38:23,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:38:23,896 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:38:23,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 22:38:23,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:38:23,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:38:23,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:38:23,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:38:23,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:38:23,897 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:38:23,897 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:38:23,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:38:23,897 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:38:23,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:38:23,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:38:23,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:38:23,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:38:23,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:38:23,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:38:23,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:38:23,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:38:23,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 22:38:23,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 22:38:23,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:38:23,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:38:23,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:38:23,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:38:23,899 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 -> 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb [2024-11-06 22:38:24,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:38:24,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:38:24,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:38:24,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:38:24,213 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:38:24,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-11-06 22:38:25,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:38:25,713 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:38:25,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-11-06 22:38:25,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a907264f8/ba9f6c2af5e64542bb9ce779c43711c4/FLAG78a66320a [2024-11-06 22:38:25,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a907264f8/ba9f6c2af5e64542bb9ce779c43711c4 [2024-11-06 22:38:25,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:38:25,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:38:25,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:38:25,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:38:25,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:38:25,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:38:25" (1/1) ... [2024-11-06 22:38:25,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5e1a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:25, skipping insertion in model container [2024-11-06 22:38:25,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:38:25" (1/1) ... [2024-11-06 22:38:25,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:38:25,877 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/loop-lit/hh2012-ex3.i[799,812] [2024-11-06 22:38:25,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:38:25,898 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:38:25,908 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/loop-lit/hh2012-ex3.i[799,812] [2024-11-06 22:38:25,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:38:25,924 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:38:25,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:25 WrapperNode [2024-11-06 22:38:25,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:38:25,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:38:25,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:38:25,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:38:25,933 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:38:25" (1/1) ... [2024-11-06 22:38:25,939 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:38:25" (1/1) ... [2024-11-06 22:38:25,952 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2024-11-06 22:38:25,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:38:25,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:38:25,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:38:25,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:38:25,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:25" (1/1) ... [2024-11-06 22:38:25,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:25" (1/1) ... [2024-11-06 22:38:25,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:25" (1/1) ... [2024-11-06 22:38:25,976 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 22:38:25,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:25" (1/1) ... [2024-11-06 22:38:25,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:25" (1/1) ... [2024-11-06 22:38:25,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:25" (1/1) ... [2024-11-06 22:38:25,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:25" (1/1) ... [2024-11-06 22:38:25,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:25" (1/1) ... [2024-11-06 22:38:25,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:25" (1/1) ... [2024-11-06 22:38:25,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:38:25,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:38:25,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:38:25,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:38:25,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:25" (1/1) ... [2024-11-06 22:38:25,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:38:26,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:38:26,017 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:38:26,019 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:38:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:38:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 22:38:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:38:26,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:38:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 22:38:26,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 22:38:26,099 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:38:26,100 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:38:26,197 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-06 22:38:26,197 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:38:26,205 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:38:26,205 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 22:38:26,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:38:26 BoogieIcfgContainer [2024-11-06 22:38:26,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:38:26,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:38:26,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:38:26,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:38:26,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:38:25" (1/3) ... [2024-11-06 22:38:26,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45426e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:38:26, skipping insertion in model container [2024-11-06 22:38:26,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:38:25" (2/3) ... [2024-11-06 22:38:26,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45426e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:38:26, skipping insertion in model container [2024-11-06 22:38:26,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:38:26" (3/3) ... [2024-11-06 22:38:26,216 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex3.i [2024-11-06 22:38:26,230 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:38:26,231 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:38:26,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:38:26,296 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;@23d3a909, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:38:26,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:38:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 22:38:26,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-06 22:38:26,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:38:26,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:38:26,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:38:26,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:38:26,315 INFO L85 PathProgramCache]: Analyzing trace with hash 300894425, now seen corresponding path program 1 times [2024-11-06 22:38:26,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:38:26,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964101331] [2024-11-06 22:38:26,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:38:26,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:38:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:26,518 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:38:26,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:38:26,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964101331] [2024-11-06 22:38:26,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964101331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:38:26,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:38:26,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:38:26,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10172820] [2024-11-06 22:38:26,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:38:26,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:38:26,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:38:26,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:38:26,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:38:26,542 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:38:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:38:26,579 INFO L93 Difference]: Finished difference Result 45 states and 77 transitions. [2024-11-06 22:38:26,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:38:26,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-06 22:38:26,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:38:26,587 INFO L225 Difference]: With dead ends: 45 [2024-11-06 22:38:26,587 INFO L226 Difference]: Without dead ends: 20 [2024-11-06 22:38:26,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:38:26,606 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 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:38:26,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:38:26,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-06 22:38:26,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-06 22:38:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 22:38:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2024-11-06 22:38:26,637 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 8 [2024-11-06 22:38:26,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:38:26,638 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2024-11-06 22:38:26,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:38:26,638 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2024-11-06 22:38:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-06 22:38:26,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:38:26,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:38:26,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 22:38:26,640 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:38:26,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:38:26,640 INFO L85 PathProgramCache]: Analyzing trace with hash 302503139, now seen corresponding path program 1 times [2024-11-06 22:38:26,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:38:26,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082988423] [2024-11-06 22:38:26,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:38:26,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:38:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:26,796 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:38:26,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:38:26,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082988423] [2024-11-06 22:38:26,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082988423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:38:26,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:38:26,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 22:38:26,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129781648] [2024-11-06 22:38:26,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:38:26,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 22:38:26,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:38:26,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 22:38:26,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 22:38:26,799 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:38:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:38:26,900 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2024-11-06 22:38:26,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:38:26,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-06 22:38:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:38:26,901 INFO L225 Difference]: With dead ends: 26 [2024-11-06 22:38:26,901 INFO L226 Difference]: Without dead ends: 24 [2024-11-06 22:38:26,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:38:26,902 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:38:26,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 76 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:38:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-06 22:38:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-06 22:38:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 22:38:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-06 22:38:26,914 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 8 [2024-11-06 22:38:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:38:26,914 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-06 22:38:26,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:38:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-06 22:38:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-06 22:38:26,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:38:26,917 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:38:26,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 22:38:26,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:38:26,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:38:26,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1964350918, now seen corresponding path program 1 times [2024-11-06 22:38:26,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:38:26,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954382820] [2024-11-06 22:38:26,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:38:26,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:38:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-06 22:38:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:38:27,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:38:27,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954382820] [2024-11-06 22:38:27,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954382820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:38:27,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:38:27,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 22:38:27,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377695238] [2024-11-06 22:38:27,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:38:27,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 22:38:27,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:38:27,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 22:38:27,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:38:27,085 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:38:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:38:27,209 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2024-11-06 22:38:27,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 22:38:27,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-06 22:38:27,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:38:27,211 INFO L225 Difference]: With dead ends: 42 [2024-11-06 22:38:27,211 INFO L226 Difference]: Without dead ends: 40 [2024-11-06 22:38:27,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-06 22:38:27,212 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:38:27,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:38:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-06 22:38:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-11-06 22:38:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-06 22:38:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-06 22:38:27,221 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 13 [2024-11-06 22:38:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:38:27,221 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-06 22:38:27,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:38:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-06 22:38:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 22:38:27,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:38:27,222 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:38:27,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 22:38:27,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:38:27,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:38:27,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1092746621, now seen corresponding path program 1 times [2024-11-06 22:38:27,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:38:27,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42290119] [2024-11-06 22:38:27,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:38:27,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:38:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-06 22:38:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:38:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:38:27,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:38:27,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42290119] [2024-11-06 22:38:27,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42290119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:38:27,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:38:27,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 22:38:27,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541840232] [2024-11-06 22:38:27,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:38:27,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 22:38:27,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:38:27,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 22:38:27,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:38:27,365 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 22:38:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:38:27,471 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2024-11-06 22:38:27,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 22:38:27,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-11-06 22:38:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:38:27,472 INFO L225 Difference]: With dead ends: 46 [2024-11-06 22:38:27,472 INFO L226 Difference]: Without dead ends: 44 [2024-11-06 22:38:27,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-06 22:38:27,473 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:38:27,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:38:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-06 22:38:27,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-11-06 22:38:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-06 22:38:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2024-11-06 22:38:27,489 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 18 [2024-11-06 22:38:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:38:27,489 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2024-11-06 22:38:27,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 22:38:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2024-11-06 22:38:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 22:38:27,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:38:27,490 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:38:27,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 22:38:27,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:38:27,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:38:27,491 INFO L85 PathProgramCache]: Analyzing trace with hash 961880998, now seen corresponding path program 1 times [2024-11-06 22:38:27,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:38:27,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044190850] [2024-11-06 22:38:27,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:38:27,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:38:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-06 22:38:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:38:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 22:38:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 22:38:27,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:38:27,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044190850] [2024-11-06 22:38:27,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044190850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:38:27,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:38:27,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 22:38:27,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096657989] [2024-11-06 22:38:27,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:38:27,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 22:38:27,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:38:27,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 22:38:27,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 22:38:27,616 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 22:38:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:38:27,673 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2024-11-06 22:38:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:38:27,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-11-06 22:38:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:38:27,675 INFO L225 Difference]: With dead ends: 89 [2024-11-06 22:38:27,675 INFO L226 Difference]: Without dead ends: 56 [2024-11-06 22:38:27,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:38:27,676 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:38:27,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 107 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:38:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-06 22:38:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-06 22:38:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-06 22:38:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2024-11-06 22:38:27,689 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 23 [2024-11-06 22:38:27,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:38:27,689 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-11-06 22:38:27,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 22:38:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-11-06 22:38:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 22:38:27,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:38:27,691 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-06 22:38:27,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 22:38:27,692 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:38:27,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:38:27,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1962382770, now seen corresponding path program 1 times [2024-11-06 22:38:27,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:38:27,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177781060] [2024-11-06 22:38:27,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:38:27,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:38:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-06 22:38:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:38:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 22:38:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 22:38:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:38:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 22:38:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-06 22:38:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-06 22:38:27,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:38:27,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177781060] [2024-11-06 22:38:27,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177781060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:38:27,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:38:27,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:38:27,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79773708] [2024-11-06 22:38:27,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:38:27,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:38:27,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:38:27,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:38:27,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:38:27,814 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 22:38:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:38:27,863 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2024-11-06 22:38:27,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:38:27,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2024-11-06 22:38:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:38:27,864 INFO L225 Difference]: With dead ends: 62 [2024-11-06 22:38:27,864 INFO L226 Difference]: Without dead ends: 60 [2024-11-06 22:38:27,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 22:38:27,865 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:38:27,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:38:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-06 22:38:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-06 22:38:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-06 22:38:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2024-11-06 22:38:27,882 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 44 [2024-11-06 22:38:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:38:27,882 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2024-11-06 22:38:27,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 22:38:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2024-11-06 22:38:27,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-06 22:38:27,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:38:27,886 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:38:27,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 22:38:27,886 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:38:27,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:38:27,887 INFO L85 PathProgramCache]: Analyzing trace with hash -896370565, now seen corresponding path program 1 times [2024-11-06 22:38:27,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:38:27,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476409705] [2024-11-06 22:38:27,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:38:27,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:38:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-06 22:38:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:38:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 22:38:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 22:38:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:38:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 22:38:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-06 22:38:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 22:38:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-06 22:38:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 22:38:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-06 22:38:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-06 22:38:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-06 22:38:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-06 22:38:28,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:38:28,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476409705] [2024-11-06 22:38:28,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476409705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:38:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749437948] [2024-11-06 22:38:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:38:28,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:38:28,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:38:28,052 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:38:28,054 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:38:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 22:38:28,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:38:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 184 proven. 7 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-06 22:38:28,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:38:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-06 22:38:28,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749437948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:38:28,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:38:28,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-06 22:38:28,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951402840] [2024-11-06 22:38:28,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:38:28,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 22:38:28,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:38:28,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 22:38:28,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:38:28,278 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-06 22:38:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:38:28,338 INFO L93 Difference]: Finished difference Result 126 states and 175 transitions. [2024-11-06 22:38:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:38:28,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 78 [2024-11-06 22:38:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:38:28,342 INFO L225 Difference]: With dead ends: 126 [2024-11-06 22:38:28,342 INFO L226 Difference]: Without dead ends: 80 [2024-11-06 22:38:28,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 178 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:38:28,345 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:38:28,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:38:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-06 22:38:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-06 22:38:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-06 22:38:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2024-11-06 22:38:28,370 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 78 [2024-11-06 22:38:28,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:38:28,370 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2024-11-06 22:38:28,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-06 22:38:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2024-11-06 22:38:28,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-06 22:38:28,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:38:28,372 INFO L215 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:38:28,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 22:38:28,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:38:28,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:38:28,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:38:28,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1496774405, now seen corresponding path program 2 times [2024-11-06 22:38:28,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:38:28,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437181512] [2024-11-06 22:38:28,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:38:28,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:38:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-06 22:38:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:38:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 22:38:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 22:38:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:38:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 22:38:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-06 22:38:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 22:38:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-06 22:38:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 22:38:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-06 22:38:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-06 22:38:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-06 22:38:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-06 22:38:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 22:38:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-06 22:38:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-06 22:38:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-06 22:38:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-06 22:38:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-06 22:38:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-06 22:38:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2024-11-06 22:38:28,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:38:28,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437181512] [2024-11-06 22:38:28,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437181512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:38:28,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103703395] [2024-11-06 22:38:28,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:38:29,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:38:29,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:38:29,002 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:38:29,008 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:38:29,088 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:38:29,088 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:38:29,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-06 22:38:29,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:38:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 49 proven. 41 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-06 22:38:29,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:38:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2024-11-06 22:38:29,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103703395] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 22:38:29,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:38:29,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 13] total 22 [2024-11-06 22:38:29,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430955109] [2024-11-06 22:38:29,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:38:29,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 22:38:29,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:38:29,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 22:38:29,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2024-11-06 22:38:29,734 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-06 22:38:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:38:29,835 INFO L93 Difference]: Finished difference Result 86 states and 120 transitions. [2024-11-06 22:38:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:38:29,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 120 [2024-11-06 22:38:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:38:29,837 INFO L225 Difference]: With dead ends: 86 [2024-11-06 22:38:29,837 INFO L226 Difference]: Without dead ends: 84 [2024-11-06 22:38:29,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 268 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2024-11-06 22:38:29,838 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:38:29,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 98 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:38:29,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-06 22:38:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-06 22:38:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-06 22:38:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2024-11-06 22:38:29,862 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 120 [2024-11-06 22:38:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:38:29,864 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2024-11-06 22:38:29,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-06 22:38:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2024-11-06 22:38:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-06 22:38:29,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:38:29,866 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:38:29,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-06 22:38:30,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:38:30,067 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:38:30,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:38:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1777971090, now seen corresponding path program 3 times [2024-11-06 22:38:30,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:38:30,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088707677] [2024-11-06 22:38:30,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:38:30,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:38:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-06 22:38:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:38:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 22:38:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 22:38:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:38:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 22:38:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-06 22:38:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 22:38:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-06 22:38:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 22:38:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-06 22:38:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-06 22:38:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-06 22:38:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-06 22:38:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 22:38:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-06 22:38:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-06 22:38:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-06 22:38:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-06 22:38:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-06 22:38:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-06 22:38:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-06 22:38:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-06 22:38:30,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:38:30,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088707677] [2024-11-06 22:38:30,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088707677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:38:30,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268711918] [2024-11-06 22:38:30,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 22:38:30,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:38:30,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:38:30,446 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:38:30,449 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:38:30,493 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-06 22:38:30,493 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:38:30,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 22:38:30,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:38:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2024-11-06 22:38:30,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:38:30,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268711918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:38:30,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 22:38:30,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-11-06 22:38:30,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874285240] [2024-11-06 22:38:30,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:38:30,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 22:38:30,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:38:30,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 22:38:30,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-06 22:38:30,603 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 22:38:30,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:38:30,668 INFO L93 Difference]: Finished difference Result 98 states and 129 transitions. [2024-11-06 22:38:30,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:38:30,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 125 [2024-11-06 22:38:30,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:38:30,670 INFO L225 Difference]: With dead ends: 98 [2024-11-06 22:38:30,671 INFO L226 Difference]: Without dead ends: 96 [2024-11-06 22:38:30,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-06 22:38:30,671 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:38:30,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 94 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:38:30,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-06 22:38:30,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-06 22:38:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 46 states have (on average 1.065217391304348) internal successors, (49), 47 states have internal predecessors, (49), 39 states have call successors, (39), 10 states have call predecessors, (39), 10 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-06 22:38:30,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2024-11-06 22:38:30,687 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 125 [2024-11-06 22:38:30,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:38:30,687 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2024-11-06 22:38:30,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 22:38:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2024-11-06 22:38:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-06 22:38:30,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:38:30,689 INFO L215 NwaCegarLoop]: trace histogram [27, 26, 26, 6, 6, 6, 6, 6, 6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:38:30,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-06 22:38:30,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:38:30,890 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:38:30,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:38:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash 40082412, now seen corresponding path program 4 times [2024-11-06 22:38:30,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:38:30,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968428315] [2024-11-06 22:38:30,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:38:30,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:38:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-06 22:38:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 22:38:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 22:38:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 22:38:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:38:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 22:38:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-06 22:38:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 22:38:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-06 22:38:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 22:38:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-06 22:38:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-06 22:38:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-06 22:38:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-06 22:38:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 22:38:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-06 22:38:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-06 22:38:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-06 22:38:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-06 22:38:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-06 22:38:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-06 22:38:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-06 22:38:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-06 22:38:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-06 22:38:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-06 22:38:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-06 22:38:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:38:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 56 proven. 70 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2024-11-06 22:38:31,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:38:31,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968428315] [2024-11-06 22:38:31,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968428315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:38:31,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408508456] [2024-11-06 22:38:31,223 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-06 22:38:31,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:38:31,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:38:31,226 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:38:31,227 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:38:31,300 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-06 22:38:31,300 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:38:31,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 22:38:31,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:38:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 77 proven. 52 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-06 22:38:31,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:38:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 52 proven. 73 refuted. 0 times theorem prover too weak. 1304 trivial. 0 not checked. [2024-11-06 22:38:31,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408508456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:38:31,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:38:31,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 23 [2024-11-06 22:38:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495201571] [2024-11-06 22:38:31,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:38:31,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-06 22:38:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:38:31,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-06 22:38:31,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2024-11-06 22:38:31,812 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 13 states have call successors, (53), 3 states have call predecessors, (53), 1 states have return successors, (50), 13 states have call predecessors, (50), 13 states have call successors, (50) [2024-11-06 22:38:32,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:38:32,403 INFO L93 Difference]: Finished difference Result 161 states and 233 transitions. [2024-11-06 22:38:32,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-06 22:38:32,403 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 13 states have call successors, (53), 3 states have call predecessors, (53), 1 states have return successors, (50), 13 states have call predecessors, (50), 13 states have call successors, (50) Word has length 146 [2024-11-06 22:38:32,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:38:32,404 INFO L225 Difference]: With dead ends: 161 [2024-11-06 22:38:32,404 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 22:38:32,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 329 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=410, Invalid=1150, Unknown=0, NotChecked=0, Total=1560 [2024-11-06 22:38:32,407 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 22:38:32,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 143 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 22:38:32,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 22:38:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 22:38:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:38:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 22:38:32,408 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 146 [2024-11-06 22:38:32,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:38:32,409 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 22:38:32,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 13 states have call successors, (53), 3 states have call predecessors, (53), 1 states have return successors, (50), 13 states have call predecessors, (50), 13 states have call successors, (50) [2024-11-06 22:38:32,409 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 22:38:32,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 22:38:32,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 22:38:32,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-06 22:38:32,616 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,SelfDestructingSolverStorable9 [2024-11-06 22:38:32,620 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-11-06 22:38:32,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 22:38:33,391 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 22:38:33,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:38:33 BoogieIcfgContainer [2024-11-06 22:38:33,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 22:38:33,409 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 22:38:33,409 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 22:38:33,409 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 22:38:33,409 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:38:26" (3/4) ... [2024-11-06 22:38:33,411 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 22:38:33,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-06 22:38:33,419 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-06 22:38:33,419 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 22:38:33,419 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 22:38:33,420 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 22:38:33,484 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 22:38:33,484 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 22:38:33,484 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 22:38:33,486 INFO L158 Benchmark]: Toolchain (without parser) took 7741.48ms. Allocated memory was 100.7MB in the beginning and 134.2MB in the end (delta: 33.6MB). Free memory was 77.3MB in the beginning and 75.7MB in the end (delta: 1.6MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-11-06 22:38:33,486 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:38:33,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.82ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 66.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:38:33,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.71ms. Allocated memory is still 100.7MB. Free memory was 66.4MB in the beginning and 65.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:38:33,487 INFO L158 Benchmark]: Boogie Preprocessor took 30.86ms. Allocated memory is still 100.7MB. Free memory was 65.3MB in the beginning and 64.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:38:33,487 INFO L158 Benchmark]: RCFGBuilder took 217.46ms. Allocated memory is still 100.7MB. Free memory was 64.2MB in the beginning and 55.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:38:33,487 INFO L158 Benchmark]: TraceAbstraction took 7200.36ms. Allocated memory was 100.7MB in the beginning and 134.2MB in the end (delta: 33.6MB). Free memory was 54.5MB in the beginning and 81.0MB in the end (delta: -26.5MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-11-06 22:38:33,487 INFO L158 Benchmark]: Witness Printer took 75.77ms. Allocated memory is still 134.2MB. Free memory was 81.0MB in the beginning and 75.7MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:38:33,489 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.34ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.82ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 66.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.71ms. Allocated memory is still 100.7MB. Free memory was 66.4MB in the beginning and 65.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.86ms. Allocated memory is still 100.7MB. Free memory was 65.3MB in the beginning and 64.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 217.46ms. Allocated memory is still 100.7MB. Free memory was 64.2MB in the beginning and 55.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7200.36ms. Allocated memory was 100.7MB in the beginning and 134.2MB in the end (delta: 33.6MB). Free memory was 54.5MB in the beginning and 81.0MB in the end (delta: -26.5MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * Witness Printer took 75.77ms. Allocated memory is still 134.2MB. Free memory was 81.0MB in the beginning and 75.7MB in the end (delta: 5.3MB). There was no memory consumed. 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 - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 10, TraceHistogramMax: 27, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 907 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 673 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 593 IncrementalHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 234 mSDtfsCounter, 593 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1101 GetRequests, 981 SyntacticMatches, 13 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=9, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 947 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1379 ConstructedInterpolants, 0 QuantifiedInterpolants, 2355 SizeOfPredicates, 4 NumberOfNonLiveVariables, 766 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 9996/10307 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((i <= 4) && (0 <= i)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((i <= 3) && (0 <= i)) && (j == 0)) || ((((j <= 4) && (1 <= j)) && (i <= ((long long) 3 + j))) && (j <= i))) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-06 22:38:33,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE