./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.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/hardness-nfm22/hardness_operatoramount_amount25_file-56.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', '9db1cd65bc75e5074bada94c2cde698267c3661942827a0dbfb399cf3fcd8571'] 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/hardness-nfm22/hardness_operatoramount_amount25_file-56.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 9db1cd65bc75e5074bada94c2cde698267c3661942827a0dbfb399cf3fcd8571 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:32:21,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:32:21,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:32:22,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:32:22,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:32:22,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:32:22,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:32:22,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:32:22,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:32:22,040 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:32:22,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:32:22,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:32:22,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:32:22,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:32:22,040 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:32:22,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:32:22,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:32:22,041 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:32:22,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:32:22,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:32:22,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:32:22,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:32:22,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:32:22,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:32:22,041 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:32:22,041 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:32:22,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:32:22,041 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:32:22,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:32:22,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:32:22,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:32:22,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:32:22,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:32:22,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:32:22,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:32:22,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:32:22,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:32:22,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:32:22,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:32:22,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:32:22,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:32:22,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:32:22,044 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 -> 9db1cd65bc75e5074bada94c2cde698267c3661942827a0dbfb399cf3fcd8571 [2024-11-07 09:32:22,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:32:22,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:32:22,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:32:22,365 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:32:22,365 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:32:22,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.i [2024-11-07 09:32:23,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:32:24,046 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:32:24,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.i [2024-11-07 09:32:24,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b413981d4/8e96439311c044af85e57a15a31dafcd/FLAGbd9125a68 [2024-11-07 09:32:24,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b413981d4/8e96439311c044af85e57a15a31dafcd [2024-11-07 09:32:24,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:32:24,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:32:24,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:32:24,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:32:24,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:32:24,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:32:24" (1/1) ... [2024-11-07 09:32:24,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20097db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:32:24, skipping insertion in model container [2024-11-07 09:32:24,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:32:24" (1/1) ... [2024-11-07 09:32:24,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:32:24,244 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/hardness-nfm22/hardness_operatoramount_amount25_file-56.i[915,928] [2024-11-07 09:32:24,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:32:24,310 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:32:24,321 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/hardness-nfm22/hardness_operatoramount_amount25_file-56.i[915,928] [2024-11-07 09:32:24,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:32:24,359 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:32:24,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:32:24 WrapperNode [2024-11-07 09:32:24,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:32:24,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:32:24,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:32:24,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:32:24,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:32:24" (1/1) ... [2024-11-07 09:32:24,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:32:24" (1/1) ... [2024-11-07 09:32:24,425 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-11-07 09:32:24,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:32:24,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:32:24,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:32:24,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:32:24,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:32:24" (1/1) ... [2024-11-07 09:32:24,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:32:24" (1/1) ... [2024-11-07 09:32:24,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:32:24" (1/1) ... [2024-11-07 09:32:24,474 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-07 09:32:24,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:32:24" (1/1) ... [2024-11-07 09:32:24,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:32:24" (1/1) ... [2024-11-07 09:32:24,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:32:24" (1/1) ... [2024-11-07 09:32:24,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:32:24" (1/1) ... [2024-11-07 09:32:24,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:32:24" (1/1) ... [2024-11-07 09:32:24,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:32:24" (1/1) ... [2024-11-07 09:32:24,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:32:24,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:32:24,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:32:24,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:32:24,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:32:24" (1/1) ... [2024-11-07 09:32:24,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:32:24,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:32:24,546 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-07 09:32:24,550 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-07 09:32:24,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:32:24,577 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:32:24,577 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:32:24,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:32:24,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:32:24,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:32:24,656 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:32:24,658 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:32:24,963 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 09:32:24,964 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:32:24,977 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:32:24,977 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:32:24,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:32:24 BoogieIcfgContainer [2024-11-07 09:32:24,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:32:24,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:32:24,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:32:24,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:32:24,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:32:24" (1/3) ... [2024-11-07 09:32:24,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4b789a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:32:24, skipping insertion in model container [2024-11-07 09:32:24,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:32:24" (2/3) ... [2024-11-07 09:32:24,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4b789a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:32:24, skipping insertion in model container [2024-11-07 09:32:24,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:32:24" (3/3) ... [2024-11-07 09:32:24,989 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-56.i [2024-11-07 09:32:25,021 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:32:25,022 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:32:25,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:32:25,095 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;@5c7dc8af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:32:25,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:32:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 09:32:25,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 09:32:25,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:25,107 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:32:25,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:25,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:25,112 INFO L85 PathProgramCache]: Analyzing trace with hash 514941654, now seen corresponding path program 1 times [2024-11-07 09:32:25,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:32:25,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295620510] [2024-11-07 09:32:25,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:25,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:32:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:25,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:32:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:25,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:32:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:25,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:32:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:25,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:32:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:25,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:32:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:25,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:32:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:25,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:32:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:25,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:32:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:25,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:32:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:25,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:32:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 09:32:25,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:32:25,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295620510] [2024-11-07 09:32:25,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295620510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:32:25,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:32:25,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:32:25,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525491966] [2024-11-07 09:32:25,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:32:25,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:32:25,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:32:25,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:32:25,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:32:25,409 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 09:32:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:25,426 INFO L93 Difference]: Finished difference Result 85 states and 134 transitions. [2024-11-07 09:32:25,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:32:25,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2024-11-07 09:32:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:25,433 INFO L225 Difference]: With dead ends: 85 [2024-11-07 09:32:25,433 INFO L226 Difference]: Without dead ends: 42 [2024-11-07 09:32:25,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:32:25,440 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:25,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:32:25,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-07 09:32:25,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-07 09:32:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 09:32:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-11-07 09:32:25,483 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 72 [2024-11-07 09:32:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:25,484 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-11-07 09:32:25,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 09:32:25,484 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-11-07 09:32:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 09:32:25,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:25,486 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:32:25,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:32:25,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:25,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:25,488 INFO L85 PathProgramCache]: Analyzing trace with hash -436045418, now seen corresponding path program 1 times [2024-11-07 09:32:25,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:32:25,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995482035] [2024-11-07 09:32:25,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:25,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:32:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:26,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:32:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:26,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:32:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:26,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:32:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:26,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:32:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:26,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:32:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:26,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:32:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:26,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:32:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:26,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:32:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:26,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:32:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:32:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 09:32:26,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:32:26,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995482035] [2024-11-07 09:32:26,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995482035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:32:26,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:32:26,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 09:32:26,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664834862] [2024-11-07 09:32:26,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:32:26,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 09:32:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:32:26,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 09:32:26,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:32:26,342 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:26,572 INFO L93 Difference]: Finished difference Result 119 states and 167 transitions. [2024-11-07 09:32:26,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 09:32:26,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2024-11-07 09:32:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:26,574 INFO L225 Difference]: With dead ends: 119 [2024-11-07 09:32:26,574 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 09:32:26,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:32:26,578 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 36 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:26,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 165 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:32:26,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 09:32:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2024-11-07 09:32:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 09:32:26,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2024-11-07 09:32:26,597 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 72 [2024-11-07 09:32:26,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:26,598 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2024-11-07 09:32:26,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2024-11-07 09:32:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 09:32:26,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:26,600 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:32:26,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:32:26,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:26,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:26,603 INFO L85 PathProgramCache]: Analyzing trace with hash 265019160, now seen corresponding path program 1 times [2024-11-07 09:32:26,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:32:26,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066493821] [2024-11-07 09:32:26,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:26,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:32:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:28,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:32:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:28,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:32:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:28,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:32:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:28,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:32:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:28,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:32:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:28,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:32:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:28,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:32:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:28,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:32:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:28,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:32:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:28,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:32:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 09:32:28,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:32:28,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066493821] [2024-11-07 09:32:28,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066493821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:32:28,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:32:28,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 09:32:28,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630755200] [2024-11-07 09:32:28,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:32:28,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 09:32:28,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:32:28,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 09:32:28,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:32:28,875 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:29,757 INFO L93 Difference]: Finished difference Result 108 states and 148 transitions. [2024-11-07 09:32:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:32:29,759 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2024-11-07 09:32:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:29,761 INFO L225 Difference]: With dead ends: 108 [2024-11-07 09:32:29,761 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 09:32:29,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-07 09:32:29,762 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 48 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:29,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 239 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 09:32:29,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 09:32:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2024-11-07 09:32:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 67 states have internal predecessors, (86), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 09:32:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2024-11-07 09:32:29,783 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 72 [2024-11-07 09:32:29,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:29,785 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2024-11-07 09:32:29,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:29,785 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2024-11-07 09:32:29,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 09:32:29,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:29,787 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:32:29,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:32:29,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:29,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:29,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1403394695, now seen corresponding path program 1 times [2024-11-07 09:32:29,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:32:29,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765667705] [2024-11-07 09:32:29,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:29,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:32:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:32,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:32:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:32,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:32:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:32,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:32:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:32,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:32:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:32,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:32:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:32,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:32:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:32,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:32:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:32,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:32:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:32,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:32:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:32,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:32:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 09:32:32,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:32:32,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765667705] [2024-11-07 09:32:32,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765667705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:32:32,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:32:32,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 09:32:32,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152731803] [2024-11-07 09:32:32,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:32:32,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 09:32:32,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:32:32,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 09:32:32,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:32:32,127 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:32,851 INFO L93 Difference]: Finished difference Result 122 states and 167 transitions. [2024-11-07 09:32:32,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 09:32:32,852 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2024-11-07 09:32:32,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:32,855 INFO L225 Difference]: With dead ends: 122 [2024-11-07 09:32:32,855 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 09:32:32,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-07 09:32:32,856 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 27 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:32,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 283 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 09:32:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 09:32:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 91. [2024-11-07 09:32:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 68 states have internal predecessors, (88), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 09:32:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-07 09:32:32,872 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 73 [2024-11-07 09:32:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:32,872 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-07 09:32:32,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-07 09:32:32,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 09:32:32,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:32,874 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:32:32,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 09:32:32,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:32,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:32,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2083453065, now seen corresponding path program 1 times [2024-11-07 09:32:32,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:32:32,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865823005] [2024-11-07 09:32:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:32,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:32:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:34,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:32:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:32:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:34,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:32:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:34,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:32:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:32:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:34,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:32:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:34,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:32:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:34,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:32:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:34,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:32:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:34,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:32:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 09:32:34,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:32:34,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865823005] [2024-11-07 09:32:34,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865823005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:32:34,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:32:34,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 09:32:34,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240254294] [2024-11-07 09:32:34,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:32:34,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 09:32:34,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:32:34,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 09:32:34,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:32:34,984 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:36,343 INFO L93 Difference]: Finished difference Result 120 states and 165 transitions. [2024-11-07 09:32:36,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 09:32:36,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2024-11-07 09:32:36,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:36,345 INFO L225 Difference]: With dead ends: 120 [2024-11-07 09:32:36,345 INFO L226 Difference]: Without dead ends: 118 [2024-11-07 09:32:36,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-07 09:32:36,346 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 34 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:36,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 288 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 09:32:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-07 09:32:36,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 86. [2024-11-07 09:32:36,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 63 states have internal predecessors, (81), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 09:32:36,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2024-11-07 09:32:36,365 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 73 [2024-11-07 09:32:36,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:36,366 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2024-11-07 09:32:36,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2024-11-07 09:32:36,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 09:32:36,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:36,372 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:32:36,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 09:32:36,373 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:36,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:36,373 INFO L85 PathProgramCache]: Analyzing trace with hash -226296450, now seen corresponding path program 1 times [2024-11-07 09:32:36,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:32:36,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020028025] [2024-11-07 09:32:36,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:36,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:32:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:32:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:32:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:32:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:32:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:32:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:32:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:32:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:32:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:32:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:32:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 09:32:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 09:32:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 09:32:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 09:32:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 09:32:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 09:32:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 09:32:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 09:32:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 09:32:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 09:32:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-11-07 09:32:40,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:32:40,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020028025] [2024-11-07 09:32:40,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020028025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:32:40,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:32:40,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 09:32:40,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771758042] [2024-11-07 09:32:40,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:32:40,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 09:32:40,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:32:40,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 09:32:40,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:32:40,440 INFO L87 Difference]: Start difference. First operand 86 states and 121 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:41,874 INFO L93 Difference]: Finished difference Result 120 states and 163 transitions. [2024-11-07 09:32:41,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:32:41,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 141 [2024-11-07 09:32:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:41,876 INFO L225 Difference]: With dead ends: 120 [2024-11-07 09:32:41,876 INFO L226 Difference]: Without dead ends: 118 [2024-11-07 09:32:41,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-07 09:32:41,878 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 48 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:41,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 293 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 09:32:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-07 09:32:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 93. [2024-11-07 09:32:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 70 states have internal predecessors, (92), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 09:32:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2024-11-07 09:32:41,887 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 141 [2024-11-07 09:32:41,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:41,888 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2024-11-07 09:32:41,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:41,888 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2024-11-07 09:32:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 09:32:41,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:41,893 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:32:41,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 09:32:41,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:41,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash -942487327, now seen corresponding path program 1 times [2024-11-07 09:32:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:32:41,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053231158] [2024-11-07 09:32:41,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:41,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:32:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:32:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:32:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:32:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:32:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:32:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:32:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:32:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:32:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:32:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:32:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 09:32:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 09:32:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 09:32:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 09:32:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 09:32:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 09:32:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 09:32:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 09:32:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 09:32:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 09:32:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-11-07 09:32:45,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:32:45,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053231158] [2024-11-07 09:32:45,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053231158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:32:45,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:32:45,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 09:32:45,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922957733] [2024-11-07 09:32:45,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:32:45,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 09:32:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:32:45,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 09:32:45,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:32:45,261 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:47,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:47,304 INFO L93 Difference]: Finished difference Result 128 states and 174 transitions. [2024-11-07 09:32:47,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 09:32:47,305 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 142 [2024-11-07 09:32:47,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:47,306 INFO L225 Difference]: With dead ends: 128 [2024-11-07 09:32:47,308 INFO L226 Difference]: Without dead ends: 126 [2024-11-07 09:32:47,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-07 09:32:47,309 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 32 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:47,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 358 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 09:32:47,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-07 09:32:47,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 94. [2024-11-07 09:32:47,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.323943661971831) internal successors, (94), 71 states have internal predecessors, (94), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 09:32:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-11-07 09:32:47,328 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 142 [2024-11-07 09:32:47,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:47,328 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-11-07 09:32:47,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:47,328 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-11-07 09:32:47,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 09:32:47,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:47,331 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:32:47,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 09:32:47,331 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:47,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:47,332 INFO L85 PathProgramCache]: Analyzing trace with hash -262428957, now seen corresponding path program 1 times [2024-11-07 09:32:47,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:32:47,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985233171] [2024-11-07 09:32:47,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:47,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:32:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:32:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:32:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:32:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:32:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:32:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:32:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:32:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:32:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:32:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:32:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 09:32:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 09:32:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 09:32:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 09:32:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 09:32:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 09:32:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 09:32:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 09:32:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 09:32:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 09:32:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-11-07 09:32:48,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:32:48,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985233171] [2024-11-07 09:32:48,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985233171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:32:48,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:32:48,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 09:32:48,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502764081] [2024-11-07 09:32:48,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:32:48,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 09:32:48,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:32:48,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 09:32:49,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:32:49,000 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:50,562 INFO L93 Difference]: Finished difference Result 127 states and 172 transitions. [2024-11-07 09:32:50,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:32:50,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 142 [2024-11-07 09:32:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:50,569 INFO L225 Difference]: With dead ends: 127 [2024-11-07 09:32:50,570 INFO L226 Difference]: Without dead ends: 125 [2024-11-07 09:32:50,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-07 09:32:50,571 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 46 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:50,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 356 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 09:32:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-07 09:32:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2024-11-07 09:32:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.323943661971831) internal successors, (94), 71 states have internal predecessors, (94), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 09:32:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-11-07 09:32:50,585 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 142 [2024-11-07 09:32:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:50,585 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-11-07 09:32:50,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-11-07 09:32:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 09:32:50,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:50,591 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:32:50,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 09:32:50,592 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:50,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:50,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1630093461, now seen corresponding path program 1 times [2024-11-07 09:32:50,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:32:50,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400393183] [2024-11-07 09:32:50,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:50,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:32:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:32:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:32:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:32:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:32:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:32:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:32:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:32:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:32:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:32:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:32:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 09:32:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 09:32:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 09:32:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 09:32:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 09:32:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 09:32:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 09:32:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 09:32:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 09:32:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 09:32:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-11-07 09:32:50,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:32:50,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400393183] [2024-11-07 09:32:50,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400393183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:32:50,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:32:50,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:32:50,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661659838] [2024-11-07 09:32:50,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:32:50,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:32:50,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:32:50,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:32:50,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:32:50,712 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:50,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:50,741 INFO L93 Difference]: Finished difference Result 168 states and 240 transitions. [2024-11-07 09:32:50,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:32:50,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 142 [2024-11-07 09:32:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:50,744 INFO L225 Difference]: With dead ends: 168 [2024-11-07 09:32:50,744 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 09:32:50,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-07 09:32:50,746 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:50,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 96 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:32:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 09:32:50,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 85. [2024-11-07 09:32:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 09:32:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2024-11-07 09:32:50,759 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 142 [2024-11-07 09:32:50,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:50,760 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2024-11-07 09:32:50,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2024-11-07 09:32:50,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 09:32:50,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:50,763 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:32:50,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 09:32:50,763 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:50,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:50,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1690481293, now seen corresponding path program 1 times [2024-11-07 09:32:50,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:32:50,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594581705] [2024-11-07 09:32:50,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:50,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:32:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:32:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:32:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:32:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:32:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:32:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:32:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:32:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:32:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:32:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:32:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 09:32:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 09:32:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 09:32:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 09:32:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 09:32:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 09:32:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 09:32:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 09:32:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 09:32:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 09:32:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-11-07 09:32:50,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:32:50,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594581705] [2024-11-07 09:32:50,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594581705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:32:50,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:32:50,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:32:50,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762938084] [2024-11-07 09:32:50,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:32:50,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:32:50,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:32:50,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:32:50,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:32:50,865 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:50,895 INFO L93 Difference]: Finished difference Result 146 states and 207 transitions. [2024-11-07 09:32:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:32:50,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 142 [2024-11-07 09:32:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:50,897 INFO L225 Difference]: With dead ends: 146 [2024-11-07 09:32:50,897 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 09:32:50,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-07 09:32:50,898 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 15 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:50,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 112 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:32:50,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 09:32:50,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2024-11-07 09:32:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 09:32:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 106 transitions. [2024-11-07 09:32:50,907 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 106 transitions. Word has length 142 [2024-11-07 09:32:50,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:50,907 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 106 transitions. [2024-11-07 09:32:50,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 09:32:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2024-11-07 09:32:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 09:32:50,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:50,908 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:32:50,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 09:32:50,908 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:50,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash 662495912, now seen corresponding path program 1 times [2024-11-07 09:32:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:32:50,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055524802] [2024-11-07 09:32:50,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:50,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:32:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:32:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:32:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:32:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:32:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:32:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:32:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:32:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:32:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:32:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:32:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 09:32:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 09:32:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 09:32:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 09:32:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 09:32:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 09:32:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 09:32:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 09:32:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 09:32:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 09:32:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-11-07 09:32:51,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:32:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055524802] [2024-11-07 09:32:51,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055524802] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 09:32:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246944649] [2024-11-07 09:32:51,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:51,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:32:51,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:32:51,119 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-07 09:32:51,120 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-07 09:32:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:51,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 09:32:51,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:32:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 9 proven. 418 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-11-07 09:32:51,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:32:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-11-07 09:32:51,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246944649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 09:32:51,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 09:32:51,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 7 [2024-11-07 09:32:51,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918415918] [2024-11-07 09:32:51,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 09:32:51,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:32:51,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:32:51,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:32:51,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:32:51,735 INFO L87 Difference]: Start difference. First operand 77 states and 106 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) [2024-11-07 09:32:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:51,800 INFO L93 Difference]: Finished difference Result 173 states and 239 transitions. [2024-11-07 09:32:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 09:32:51,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) Word has length 143 [2024-11-07 09:32:51,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:51,803 INFO L225 Difference]: With dead ends: 173 [2024-11-07 09:32:51,803 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 09:32:51,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:32:51,808 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 44 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:51,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 238 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:32:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 09:32:51,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2024-11-07 09:32:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 78 states have internal predecessors, (95), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 09:32:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 155 transitions. [2024-11-07 09:32:51,829 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 155 transitions. Word has length 143 [2024-11-07 09:32:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:51,830 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 155 transitions. [2024-11-07 09:32:51,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) [2024-11-07 09:32:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 155 transitions. [2024-11-07 09:32:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 09:32:51,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:32:51,832 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:32:51,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 09:32:52,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 09:32:52,035 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:32:52,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:32:52,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1081521241, now seen corresponding path program 1 times [2024-11-07 09:32:52,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:32:52,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222795389] [2024-11-07 09:32:52,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:52,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:32:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:32:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:32:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:32:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:32:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:32:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:32:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:32:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:32:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:32:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:32:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 09:32:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 09:32:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 09:32:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 09:32:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 09:32:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 09:32:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 09:32:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 09:32:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 09:32:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 09:32:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 51 proven. 123 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2024-11-07 09:32:52,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:32:52,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222795389] [2024-11-07 09:32:52,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222795389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 09:32:52,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519336723] [2024-11-07 09:32:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:32:52,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:32:52,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:32:52,744 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-07 09:32:52,746 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-07 09:32:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:32:52,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 09:32:52,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:32:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 543 proven. 24 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-11-07 09:32:53,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:32:53,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519336723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 09:32:53,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 09:32:53,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 18 [2024-11-07 09:32:53,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193792508] [2024-11-07 09:32:53,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 09:32:53,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 09:32:53,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:32:53,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 09:32:53,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2024-11-07 09:32:53,578 INFO L87 Difference]: Start difference. First operand 112 states and 155 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 16 states have internal predecessors, (65), 6 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2024-11-07 09:32:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:32:53,941 INFO L93 Difference]: Finished difference Result 182 states and 230 transitions. [2024-11-07 09:32:53,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 09:32:53,942 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 16 states have internal predecessors, (65), 6 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 144 [2024-11-07 09:32:53,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:32:53,942 INFO L225 Difference]: With dead ends: 182 [2024-11-07 09:32:53,942 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 09:32:53,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2024-11-07 09:32:53,944 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 95 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:32:53,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 159 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:32:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 09:32:53,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 09:32:53,945 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-07 09:32:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 09:32:53,946 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 144 [2024-11-07 09:32:53,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:32:53,947 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 09:32:53,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 16 states have internal predecessors, (65), 6 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2024-11-07 09:32:53,948 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 09:32:53,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 09:32:53,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:32:53,975 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-07 09:32:54,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:32:54,155 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:32:54,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 09:32:54,741 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:32:54,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:32:54 BoogieIcfgContainer [2024-11-07 09:32:54,765 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:32:54,766 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:32:54,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:32:54,766 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:32:54,767 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:32:24" (3/4) ... [2024-11-07 09:32:54,769 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 09:32:54,776 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 09:32:54,780 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-07 09:32:54,781 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 09:32:54,781 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 09:32:54,781 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 09:32:54,873 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 09:32:54,874 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 09:32:54,874 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:32:54,875 INFO L158 Benchmark]: Toolchain (without parser) took 30790.30ms. Allocated memory was 100.7MB in the beginning and 243.3MB in the end (delta: 142.6MB). Free memory was 77.1MB in the beginning and 160.7MB in the end (delta: -83.6MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2024-11-07 09:32:54,875 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:32:54,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.42ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 64.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:32:54,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.70ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 61.6MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:32:54,877 INFO L158 Benchmark]: Boogie Preprocessor took 74.54ms. Allocated memory is still 100.7MB. Free memory was 61.6MB in the beginning and 57.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:32:54,878 INFO L158 Benchmark]: RCFGBuilder took 472.49ms. Allocated memory is still 100.7MB. Free memory was 57.4MB in the beginning and 40.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 09:32:54,878 INFO L158 Benchmark]: TraceAbstraction took 29784.32ms. Allocated memory was 100.7MB in the beginning and 243.3MB in the end (delta: 142.6MB). Free memory was 40.2MB in the beginning and 166.1MB in the end (delta: -125.9MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-07 09:32:54,878 INFO L158 Benchmark]: Witness Printer took 108.40ms. Allocated memory is still 243.3MB. Free memory was 166.1MB in the beginning and 160.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:32:54,880 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.91ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.42ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 64.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.70ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 61.6MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.54ms. Allocated memory is still 100.7MB. Free memory was 61.6MB in the beginning and 57.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 472.49ms. Allocated memory is still 100.7MB. Free memory was 57.4MB in the beginning and 40.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29784.32ms. Allocated memory was 100.7MB in the beginning and 243.3MB in the end (delta: 142.6MB). Free memory was 40.2MB in the beginning and 166.1MB in the end (delta: -125.9MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Witness Printer took 108.40ms. Allocated memory is still 243.3MB. Free memory was 166.1MB in the beginning and 160.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.1s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 443 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 441 mSDsluCounter, 2645 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2001 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1891 IncrementalHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 644 mSDtfsCounter, 1891 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1031 GetRequests, 929 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=11, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 215 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 1645 NumberOfCodeBlocks, 1645 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1773 ConstructedInterpolants, 0 QuantifiedInterpolants, 8154 SizeOfPredicates, 6 NumberOfNonLiveVariables, 643 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 8180/8780 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: 85]: Loop Invariant Derived loop invariant: ((((((1073741823 <= var_1_10) && (var_1_11 == 0)) && (127 <= var_1_5)) && (last_1_var_1_11 == 0)) && (var_1_5 <= 254)) && (var_1_10 <= 2147483647)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((var_1_11 == 0) && (last_1_var_1_11 == 0)) Ensures: ((((cond != 0) && (var_1_11 == 0)) && (last_1_var_1_11 == 0)) && ((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (last_1_var_1_1 == \old(last_1_var_1_1))) && (last_1_var_1_11 == \old(last_1_var_1_11)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 09:32:55,000 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