./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-5.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-5.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', '3265f2d5cc9edc9a9e002ac711875773beb1ae91d83ddece24802ad3f3213fea'] 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-5.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 3265f2d5cc9edc9a9e002ac711875773beb1ae91d83ddece24802ad3f3213fea --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:31:18,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:31:19,067 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:31:19,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:31:19,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:31:19,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:31:19,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:31:19,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:31:19,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:31:19,097 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:31:19,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:31:19,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:31:19,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:31:19,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:31:19,098 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:31:19,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:31:19,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:31:19,098 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:31:19,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:31:19,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:31:19,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:31:19,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:31:19,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:31:19,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:31:19,099 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:31:19,099 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:31:19,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:31:19,099 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:31:19,099 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:31:19,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:31:19,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:31:19,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:31:19,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:31:19,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:31:19,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:31:19,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:31:19,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:31:19,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:31:19,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:31:19,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:31:19,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:31:19,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:31:19,101 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 -> 3265f2d5cc9edc9a9e002ac711875773beb1ae91d83ddece24802ad3f3213fea [2024-11-07 09:31:19,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:31:19,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:31:19,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:31:19,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:31:19,410 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:31:19,411 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-5.i [2024-11-07 09:31:20,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:31:20,917 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:31:20,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-5.i [2024-11-07 09:31:20,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d9437e63/4e80c093ecf94d92848afb5a5903c5b3/FLAGb3bc35bd6 [2024-11-07 09:31:20,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d9437e63/4e80c093ecf94d92848afb5a5903c5b3 [2024-11-07 09:31:20,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:31:20,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:31:20,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:31:20,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:31:20,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:31:20,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:31:20" (1/1) ... [2024-11-07 09:31:20,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260f9f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:20, skipping insertion in model container [2024-11-07 09:31:20,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:31:20" (1/1) ... [2024-11-07 09:31:20,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:31:21,100 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-5.i[914,927] [2024-11-07 09:31:21,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:31:21,159 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:31:21,171 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-5.i[914,927] [2024-11-07 09:31:21,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:31:21,210 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:31:21,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:21 WrapperNode [2024-11-07 09:31:21,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:31:21,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:31:21,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:31:21,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:31:21,218 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:31:21" (1/1) ... [2024-11-07 09:31:21,227 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:31:21" (1/1) ... [2024-11-07 09:31:21,259 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-11-07 09:31:21,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:31:21,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:31:21,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:31:21,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:31:21,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:21" (1/1) ... [2024-11-07 09:31:21,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:21" (1/1) ... [2024-11-07 09:31:21,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:21" (1/1) ... [2024-11-07 09:31:21,302 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:31:21,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:21" (1/1) ... [2024-11-07 09:31:21,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:21" (1/1) ... [2024-11-07 09:31:21,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:21" (1/1) ... [2024-11-07 09:31:21,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:21" (1/1) ... [2024-11-07 09:31:21,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:21" (1/1) ... [2024-11-07 09:31:21,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:21" (1/1) ... [2024-11-07 09:31:21,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:31:21,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:31:21,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:31:21,328 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:31:21,329 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:21" (1/1) ... [2024-11-07 09:31:21,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:31:21,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:31:21,366 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:31:21,369 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:31:21,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:31:21,400 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:31:21,400 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:31:21,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:31:21,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:31:21,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:31:21,481 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:31:21,483 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:31:21,734 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 09:31:21,735 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:31:21,746 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:31:21,746 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:31:21,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:31:21 BoogieIcfgContainer [2024-11-07 09:31:21,747 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:31:21,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:31:21,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:31:21,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:31:21,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:31:20" (1/3) ... [2024-11-07 09:31:21,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ddc85f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:31:21, skipping insertion in model container [2024-11-07 09:31:21,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:31:21" (2/3) ... [2024-11-07 09:31:21,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ddc85f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:31:21, skipping insertion in model container [2024-11-07 09:31:21,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:31:21" (3/3) ... [2024-11-07 09:31:21,757 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-5.i [2024-11-07 09:31:21,770 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:31:21,772 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:31:21,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:31:21,840 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;@184abe65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:31:21,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:31:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 09:31:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 09:31:21,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:31:21,859 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:31:21,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:31:21,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:31:21,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1614083282, now seen corresponding path program 1 times [2024-11-07 09:31:21,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:31:21,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292976006] [2024-11-07 09:31:21,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:21,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:31:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:22,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:31:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:31:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:22,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:31:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:22,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:31:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:22,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:31:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:22,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:31:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:22,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:31:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:22,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:31:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:22,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:31:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:22,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:31:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:22,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:31:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:22,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:31:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:22,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:31:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:22,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:31:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 09:31:22,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:31:22,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292976006] [2024-11-07 09:31:22,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292976006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:31:22,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:31:22,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:31:22,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606895188] [2024-11-07 09:31:22,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:31:22,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:31:22,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:31:22,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:31:22,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:31:22,183 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 09:31:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:31:22,205 INFO L93 Difference]: Finished difference Result 91 states and 150 transitions. [2024-11-07 09:31:22,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:31:22,206 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2024-11-07 09:31:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:31:22,213 INFO L225 Difference]: With dead ends: 91 [2024-11-07 09:31:22,213 INFO L226 Difference]: Without dead ends: 45 [2024-11-07 09:31:22,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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:31:22,221 INFO L432 NwaCegarLoop]: 64 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, 64 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:31:22,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:31:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-07 09:31:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-07 09:31:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 09:31:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2024-11-07 09:31:22,262 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 93 [2024-11-07 09:31:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:31:22,262 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2024-11-07 09:31:22,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 09:31:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2024-11-07 09:31:22,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 09:31:22,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:31:22,266 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:31:22,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:31:22,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:31:22,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:31:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1475241070, now seen corresponding path program 1 times [2024-11-07 09:31:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:31:22,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354439062] [2024-11-07 09:31:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:31:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:23,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:31:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:23,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:31:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:23,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:31:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:31:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:23,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:31:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:31:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:23,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:31:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:31:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:31:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:23,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:31:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:23,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:31:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:23,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:31:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:23,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:31:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:23,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:31:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 09:31:23,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:31:23,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354439062] [2024-11-07 09:31:23,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354439062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:31:23,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:31:23,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 09:31:23,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096602897] [2024-11-07 09:31:23,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:31:23,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 09:31:23,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:31:23,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 09:31:23,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:31:23,949 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:31:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:31:24,409 INFO L93 Difference]: Finished difference Result 191 states and 270 transitions. [2024-11-07 09:31:24,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 09:31:24,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-11-07 09:31:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:31:24,413 INFO L225 Difference]: With dead ends: 191 [2024-11-07 09:31:24,413 INFO L226 Difference]: Without dead ends: 149 [2024-11-07 09:31:24,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:31:24,414 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 98 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 09:31:24,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 172 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 09:31:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-07 09:31:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 73. [2024-11-07 09:31:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 09:31:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2024-11-07 09:31:24,446 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 93 [2024-11-07 09:31:24,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:31:24,446 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2024-11-07 09:31:24,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:31:24,447 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2024-11-07 09:31:24,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 09:31:24,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:31:24,450 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:31:24,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:31:24,450 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:31:24,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:31:24,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1477088112, now seen corresponding path program 1 times [2024-11-07 09:31:24,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:31:24,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705071286] [2024-11-07 09:31:24,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:24,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:31:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:26,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:31:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:26,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:31:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:26,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:31:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:26,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:31:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:26,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:31:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:26,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:31:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:26,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:31:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:26,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:31:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:26,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:31:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:26,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:31:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:26,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:31:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:26,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:31:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:26,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:31:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:26,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:31:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 09:31:26,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:31:26,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705071286] [2024-11-07 09:31:26,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705071286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:31:26,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:31:26,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 09:31:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621514595] [2024-11-07 09:31:26,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:31:26,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 09:31:26,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:31:26,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 09:31:26,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:31:26,626 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:31:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:31:27,520 INFO L93 Difference]: Finished difference Result 154 states and 213 transitions. [2024-11-07 09:31:27,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:31:27,521 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-11-07 09:31:27,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:31:27,524 INFO L225 Difference]: With dead ends: 154 [2024-11-07 09:31:27,524 INFO L226 Difference]: Without dead ends: 152 [2024-11-07 09:31:27,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-07 09:31:27,525 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 100 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 09:31:27,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 239 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 09:31:27,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-07 09:31:27,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 144. [2024-11-07 09:31:27,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 93 states have internal predecessors, (107), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 09:31:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 203 transitions. [2024-11-07 09:31:27,572 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 203 transitions. Word has length 93 [2024-11-07 09:31:27,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:31:27,573 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 203 transitions. [2024-11-07 09:31:27,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:31:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 203 transitions. [2024-11-07 09:31:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 09:31:27,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:31:27,576 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:31:27,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:31:27,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:31:27,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:31:27,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1042871822, now seen corresponding path program 1 times [2024-11-07 09:31:27,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:31:27,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487411937] [2024-11-07 09:31:27,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:27,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:31:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:31:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:31:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:31:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:31:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:31:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:31:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:31:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:31:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:31:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:31:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:31:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:31:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:31:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:31:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 09:31:27,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:31:27,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487411937] [2024-11-07 09:31:27,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487411937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:31:27,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:31:27,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:31:27,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982847501] [2024-11-07 09:31:27,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:31:27,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:31:27,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:31:27,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:31:27,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:31:27,665 INFO L87 Difference]: Start difference. First operand 144 states and 203 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:31:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:31:27,709 INFO L93 Difference]: Finished difference Result 280 states and 397 transitions. [2024-11-07 09:31:27,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:31:27,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-11-07 09:31:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:31:27,712 INFO L225 Difference]: With dead ends: 280 [2024-11-07 09:31:27,715 INFO L226 Difference]: Without dead ends: 139 [2024-11-07 09:31:27,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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:31:27,717 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:31:27,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:31:27,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-07 09:31:27,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-07 09:31:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 86 states have (on average 1.127906976744186) internal successors, (97), 88 states have internal predecessors, (97), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 09:31:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 193 transitions. [2024-11-07 09:31:27,752 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 193 transitions. Word has length 93 [2024-11-07 09:31:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:31:27,753 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 193 transitions. [2024-11-07 09:31:27,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:31:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 193 transitions. [2024-11-07 09:31:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 09:31:27,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:31:27,755 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:31:27,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 09:31:27,756 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:31:27,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:31:27,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2139667856, now seen corresponding path program 1 times [2024-11-07 09:31:27,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:31:27,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614009525] [2024-11-07 09:31:27,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:27,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:31:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:31:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:31:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:31:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:31:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:31:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:31:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:31:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:31:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:31:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:31:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:31:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:31:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:31:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:31:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 09:31:27,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:31:27,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614009525] [2024-11-07 09:31:27,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614009525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:31:27,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:31:27,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:31:27,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630635069] [2024-11-07 09:31:27,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:31:27,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:31:27,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:31:27,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:31:27,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:31:27,839 INFO L87 Difference]: Start difference. First operand 139 states and 193 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:31:27,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:31:27,868 INFO L93 Difference]: Finished difference Result 243 states and 337 transitions. [2024-11-07 09:31:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:31:27,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-11-07 09:31:27,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:31:27,870 INFO L225 Difference]: With dead ends: 243 [2024-11-07 09:31:27,870 INFO L226 Difference]: Without dead ends: 107 [2024-11-07 09:31:27,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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:31:27,872 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:31:27,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:31:27,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-07 09:31:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-07 09:31:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 64 states have (on average 1.078125) internal successors, (69), 65 states have internal predecessors, (69), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 09:31:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 145 transitions. [2024-11-07 09:31:27,899 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 145 transitions. Word has length 93 [2024-11-07 09:31:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:31:27,899 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 145 transitions. [2024-11-07 09:31:27,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:31:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2024-11-07 09:31:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 09:31:27,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:31:27,903 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:31:27,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 09:31:27,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:31:27,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:31:27,904 INFO L85 PathProgramCache]: Analyzing trace with hash 323580047, now seen corresponding path program 1 times [2024-11-07 09:31:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:31:27,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33228372] [2024-11-07 09:31:27,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:27,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:31:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:31,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:31:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:31,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:31:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:31,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:31:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:31,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:31:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:31,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:31:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:31,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:31:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:31,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:31:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:31,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:31:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:31,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:31:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:31,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:31:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:31,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:31:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:31,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:31:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:31,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:31:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:31,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:31:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 09:31:31,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:31:31,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33228372] [2024-11-07 09:31:31,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33228372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:31:31,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:31:31,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 09:31:31,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252565197] [2024-11-07 09:31:31,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:31:31,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 09:31:31,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:31:31,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 09:31:31,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:31:31,881 INFO L87 Difference]: Start difference. First operand 107 states and 145 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:31:32,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:31:32,197 INFO L93 Difference]: Finished difference Result 127 states and 165 transitions. [2024-11-07 09:31:32,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 09:31:32,198 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-07 09:31:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:31:32,201 INFO L225 Difference]: With dead ends: 127 [2024-11-07 09:31:32,202 INFO L226 Difference]: Without dead ends: 125 [2024-11-07 09:31:32,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-07 09:31:32,203 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 17 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:31:32,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 340 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:31:32,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-07 09:31:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2024-11-07 09:31:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 74 states have internal predecessors, (78), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 09:31:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2024-11-07 09:31:32,227 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 94 [2024-11-07 09:31:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:31:32,227 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2024-11-07 09:31:32,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:31:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2024-11-07 09:31:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 09:31:32,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:31:32,229 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:31:32,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 09:31:32,229 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:31:32,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:31:32,233 INFO L85 PathProgramCache]: Analyzing trace with hash 93886917, now seen corresponding path program 1 times [2024-11-07 09:31:32,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:31:32,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730262672] [2024-11-07 09:31:32,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:32,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:31:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:33,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:31:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:33,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:31:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:33,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:31:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:33,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:31:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:33,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:31:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:33,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:31:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:33,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:31:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:33,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:31:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:33,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:31:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:33,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:31:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:33,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:31:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:33,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:31:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:33,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:31:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:31:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 09:31:33,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:31:33,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730262672] [2024-11-07 09:31:33,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730262672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:31:33,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:31:33,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 09:31:33,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915109548] [2024-11-07 09:31:33,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:31:33,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 09:31:33,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:31:33,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 09:31:33,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-07 09:31:33,118 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:31:33,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:31:33,291 INFO L93 Difference]: Finished difference Result 140 states and 178 transitions. [2024-11-07 09:31:33,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 09:31:33,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-11-07 09:31:33,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:31:33,292 INFO L225 Difference]: With dead ends: 140 [2024-11-07 09:31:33,293 INFO L226 Difference]: Without dead ends: 138 [2024-11-07 09:31:33,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-07 09:31:33,294 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 22 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:31:33,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 332 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:31:33,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-07 09:31:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2024-11-07 09:31:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 74 states have internal predecessors, (78), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 09:31:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2024-11-07 09:31:33,320 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 95 [2024-11-07 09:31:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:31:33,321 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2024-11-07 09:31:33,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:31:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2024-11-07 09:31:33,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-07 09:31:33,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:31:33,324 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:31:33,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 09:31:33,325 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:31:33,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:31:33,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1313672385, now seen corresponding path program 1 times [2024-11-07 09:31:33,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:31:33,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925017279] [2024-11-07 09:31:33,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:33,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:31:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:31:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:31:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:31:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:31:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:31:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:31:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:31:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:31:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:31:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:31:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:31:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:31:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:31:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:31:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 09:31:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 09:31:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 09:31:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 09:31:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 09:31:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 09:31:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 09:31:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 09:31:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 09:31:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 09:31:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 09:31:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 09:31:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 09:31:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 09:31:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked. [2024-11-07 09:31:35,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:31:35,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925017279] [2024-11-07 09:31:35,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925017279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 09:31:35,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762518567] [2024-11-07 09:31:35,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:31:35,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:31:35,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:31:35,126 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:31:35,128 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:31:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:31:35,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-07 09:31:35,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:31:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 182 proven. 537 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2024-11-07 09:31:48,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:31:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked. [2024-11-07 09:31:50,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762518567] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 09:31:50,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 09:31:50,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 17] total 27 [2024-11-07 09:31:50,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272974629] [2024-11-07 09:31:50,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:31:50,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 09:31:50,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:31:50,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 09:31:50,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2024-11-07 09:31:50,838 INFO L87 Difference]: Start difference. First operand 116 states and 154 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:31:51,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:31:51,214 INFO L93 Difference]: Finished difference Result 137 states and 176 transitions. [2024-11-07 09:31:51,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:31:51,215 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 184 [2024-11-07 09:31:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:31:51,216 INFO L225 Difference]: With dead ends: 137 [2024-11-07 09:31:51,216 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 09:31:51,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2024-11-07 09:31:51,218 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 49 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:31:51,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 359 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:31:51,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 09:31:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 09:31:51,218 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:31:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 09:31:51,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 184 [2024-11-07 09:31:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:31:51,219 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 09:31:51,219 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:31:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 09:31:51,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 09:31:51,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:31:51,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 09:31:51,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 09:31:51,431 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:31:51,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 09:31:52,441 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:31:52,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:31:52 BoogieIcfgContainer [2024-11-07 09:31:52,465 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:31:52,466 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:31:52,466 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:31:52,466 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:31:52,467 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:31:21" (3/4) ... [2024-11-07 09:31:52,469 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 09:31:52,474 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 09:31:52,479 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-07 09:31:52,479 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 09:31:52,479 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 09:31:52,479 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 09:31:52,557 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 09:31:52,557 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 09:31:52,557 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:31:52,558 INFO L158 Benchmark]: Toolchain (without parser) took 31609.34ms. Allocated memory was 109.1MB in the beginning and 838.9MB in the end (delta: 729.8MB). Free memory was 84.3MB in the beginning and 407.4MB in the end (delta: -323.1MB). Peak memory consumption was 402.1MB. Max. memory is 16.1GB. [2024-11-07 09:31:52,559 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory is still 47.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:31:52,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.09ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 71.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:31:52,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.15ms. Allocated memory is still 109.1MB. Free memory was 71.5MB in the beginning and 68.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:31:52,560 INFO L158 Benchmark]: Boogie Preprocessor took 65.52ms. Allocated memory is still 109.1MB. Free memory was 68.8MB in the beginning and 65.0MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:31:52,561 INFO L158 Benchmark]: RCFGBuilder took 420.36ms. Allocated memory is still 109.1MB. Free memory was 65.0MB in the beginning and 49.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 09:31:52,561 INFO L158 Benchmark]: TraceAbstraction took 30715.71ms. Allocated memory was 109.1MB in the beginning and 838.9MB in the end (delta: 729.8MB). Free memory was 48.6MB in the beginning and 415.7MB in the end (delta: -367.0MB). Peak memory consumption was 368.5MB. Max. memory is 16.1GB. [2024-11-07 09:31:52,561 INFO L158 Benchmark]: Witness Printer took 91.48ms. Allocated memory is still 838.9MB. Free memory was 415.7MB in the beginning and 407.4MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:31:52,563 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory is still 47.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.09ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 71.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.15ms. Allocated memory is still 109.1MB. Free memory was 71.5MB in the beginning and 68.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.52ms. Allocated memory is still 109.1MB. Free memory was 68.8MB in the beginning and 65.0MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 420.36ms. Allocated memory is still 109.1MB. Free memory was 65.0MB in the beginning and 49.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 30715.71ms. Allocated memory was 109.1MB in the beginning and 838.9MB in the end (delta: 729.8MB). Free memory was 48.6MB in the beginning and 415.7MB in the end (delta: -367.0MB). Peak memory consumption was 368.5MB. Max. memory is 16.1GB. * Witness Printer took 91.48ms. Allocated memory is still 838.9MB. Free memory was 415.7MB in the beginning and 407.4MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.6s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 286 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 286 mSDsluCounter, 1744 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1216 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 627 IncrementalHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 528 mSDtfsCounter, 627 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 714 GetRequests, 643 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=3, InterpolantAutomatonStates: 54, 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, 8 MinimizatonAttempts, 115 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 26.1s InterpolantComputationTime, 1022 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1196 ConstructedInterpolants, 0 QuantifiedInterpolants, 4992 SizeOfPredicates, 29 NumberOfNonLiveVariables, 388 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 6645/7183 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: 95]: Loop Invariant Derived loop invariant: ((((var_1_8 == var_1_15) && (var_1_12 <= var_1_8)) || (((var_1_8 + 1) <= var_1_12) && (var_1_15 == var_1_12))) || (((((0 <= 0) && (var_1_13 <= ((short) var_1_13 + var_1_8))) && (var_1_9 <= 0)) && (var_1_8 <= 10)) && (((short) var_1_13 + var_1_8) <= (255 + var_1_13)))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (last_1_var_1_8 == \old(last_1_var_1_8))) RESULT: Ultimate proved your program to be correct! [2024-11-07 09:31:52,597 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