./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-39.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-39.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', '8b89c5a452639706785e6c59e59bc9495b7c670c1d520018d254073dacdf7a8c'] 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-39.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 8b89c5a452639706785e6c59e59bc9495b7c670c1d520018d254073dacdf7a8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:30:15,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:30:15,666 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:30:15,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:30:15,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:30:15,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:30:15,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:30:15,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:30:15,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:30:15,687 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:30:15,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:30:15,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:30:15,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:30:15,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:30:15,688 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:30:15,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:30:15,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:30:15,688 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:30:15,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:30:15,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:30:15,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:30:15,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:30:15,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:30:15,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:30:15,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:30:15,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:30:15,690 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 -> 8b89c5a452639706785e6c59e59bc9495b7c670c1d520018d254073dacdf7a8c [2024-11-07 09:30:15,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:30:15,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:30:15,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:30:15,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:30:15,924 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:30:15,924 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-39.i [2024-11-07 09:30:17,062 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:30:17,251 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:30:17,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-39.i [2024-11-07 09:30:17,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e733a0c3/cce8ef4532e1458ea14c13f2c0c7e2e3/FLAGb8de9c4a3 [2024-11-07 09:30:17,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e733a0c3/cce8ef4532e1458ea14c13f2c0c7e2e3 [2024-11-07 09:30:17,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:30:17,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:30:17,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:30:17,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:30:17,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:30:17,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:30:17" (1/1) ... [2024-11-07 09:30:17,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f9c8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:17, skipping insertion in model container [2024-11-07 09:30:17,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:30:17" (1/1) ... [2024-11-07 09:30:17,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:30:17,753 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-39.i[915,928] [2024-11-07 09:30:17,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:30:17,805 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:30:17,814 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-39.i[915,928] [2024-11-07 09:30:17,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:30:17,850 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:30:17,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:17 WrapperNode [2024-11-07 09:30:17,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:30:17,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:30:17,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:30:17,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:30:17,858 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:30:17" (1/1) ... [2024-11-07 09:30:17,865 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:30:17" (1/1) ... [2024-11-07 09:30:17,895 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-07 09:30:17,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:30:17,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:30:17,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:30:17,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:30:17,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:17" (1/1) ... [2024-11-07 09:30:17,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:17" (1/1) ... [2024-11-07 09:30:17,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:17" (1/1) ... [2024-11-07 09:30:17,927 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:30:17,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:17" (1/1) ... [2024-11-07 09:30:17,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:17" (1/1) ... [2024-11-07 09:30:17,934 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:17" (1/1) ... [2024-11-07 09:30:17,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:17" (1/1) ... [2024-11-07 09:30:17,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:17" (1/1) ... [2024-11-07 09:30:17,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:17" (1/1) ... [2024-11-07 09:30:17,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:30:17,948 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:30:17,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:30:17,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:30:17,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:17" (1/1) ... [2024-11-07 09:30:17,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:30:17,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:30:17,975 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:30:17,978 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:30:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:30:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:30:17,995 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:30:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:30:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:30:17,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:30:18,059 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:30:18,061 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:30:18,265 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 09:30:18,265 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:30:18,275 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:30:18,275 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:30:18,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:30:18 BoogieIcfgContainer [2024-11-07 09:30:18,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:30:18,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:30:18,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:30:18,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:30:18,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:30:17" (1/3) ... [2024-11-07 09:30:18,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec8b2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:30:18, skipping insertion in model container [2024-11-07 09:30:18,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:30:17" (2/3) ... [2024-11-07 09:30:18,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec8b2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:30:18, skipping insertion in model container [2024-11-07 09:30:18,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:30:18" (3/3) ... [2024-11-07 09:30:18,286 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-39.i [2024-11-07 09:30:18,297 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:30:18,298 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:30:18,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:30:18,355 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;@21335c9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:30:18,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:30:18,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 09:30:18,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 09:30:18,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:30:18,369 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:18,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:30:18,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:30:18,374 INFO L85 PathProgramCache]: Analyzing trace with hash 705531536, now seen corresponding path program 1 times [2024-11-07 09:30:18,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:30:18,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083949142] [2024-11-07 09:30:18,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:30:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:30:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:20,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:30:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:20,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:30:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:20,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:30:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:20,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 09:30:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:20,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:30:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 09:30:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:20,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:30:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:20,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 09:30:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:20,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 09:30:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:20,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 09:30:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:20,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 09:30:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:20,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 09:30:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:20,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 09:30:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:30:20,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:30:20,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083949142] [2024-11-07 09:30:20,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083949142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:30:20,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:30:20,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 09:30:20,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206715077] [2024-11-07 09:30:20,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:30:20,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:30:20,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:30:20,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:30:20,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:30:20,231 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 09:30:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:30:20,614 INFO L93 Difference]: Finished difference Result 157 states and 275 transitions. [2024-11-07 09:30:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 09:30:20,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2024-11-07 09:30:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:30:20,621 INFO L225 Difference]: With dead ends: 157 [2024-11-07 09:30:20,622 INFO L226 Difference]: Without dead ends: 113 [2024-11-07 09:30:20,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:30:20,628 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 70 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 09:30:20,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 260 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 09:30:20,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-07 09:30:20,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 81. [2024-11-07 09:30:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 09:30:20,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-11-07 09:30:20,678 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 87 [2024-11-07 09:30:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:30:20,679 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-11-07 09:30:20,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 09:30:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-07 09:30:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 09:30:20,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:30:20,682 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:20,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:30:20,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:30:20,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:30:20,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1626825182, now seen corresponding path program 1 times [2024-11-07 09:30:20,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:30:20,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372107296] [2024-11-07 09:30:20,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:30:20,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:30:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:39,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:30:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:39,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:30:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:39,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:30:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:39,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 09:30:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:39,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:30:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:39,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 09:30:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:39,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:30:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:39,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 09:30:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:39,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 09:30:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:39,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 09:30:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:39,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 09:30:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:39,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 09:30:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:39,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 09:30:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:39,396 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:30:39,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:30:39,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372107296] [2024-11-07 09:30:39,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372107296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:30:39,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:30:39,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 09:30:39,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22582232] [2024-11-07 09:30:39,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:30:39,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 09:30:39,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:30:39,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 09:30:39,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:30:39,400 INFO L87 Difference]: Start difference. First operand 81 states and 115 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:30:39,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:30:39,851 INFO L93 Difference]: Finished difference Result 104 states and 144 transitions. [2024-11-07 09:30:39,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:30:39,855 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2024-11-07 09:30:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:30:39,856 INFO L225 Difference]: With dead ends: 104 [2024-11-07 09:30:39,856 INFO L226 Difference]: Without dead ends: 102 [2024-11-07 09:30:39,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-07 09:30:39,858 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 20 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:30:39,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 286 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:30:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-07 09:30:39,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2024-11-07 09:30:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 68 states have internal predecessors, (84), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 09:30:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2024-11-07 09:30:39,878 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 88 [2024-11-07 09:30:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:30:39,878 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2024-11-07 09:30:39,878 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:30:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2024-11-07 09:30:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 09:30:39,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:30:39,880 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:39,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:30:39,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:30:39,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:30:39,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2119667321, now seen corresponding path program 1 times [2024-11-07 09:30:39,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:30:39,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109236456] [2024-11-07 09:30:39,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:30:39,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:30:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:40,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:30:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:40,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:30:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:40,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:30:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:40,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 09:30:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:40,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:30:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:40,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 09:30:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:40,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:30:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:40,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 09:30:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:40,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 09:30:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:40,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 09:30:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:40,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 09:30:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:40,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 09:30:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:40,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 09:30:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:40,066 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 09:30:40,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:30:40,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109236456] [2024-11-07 09:30:40,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109236456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:30:40,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:30:40,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 09:30:40,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443431703] [2024-11-07 09:30:40,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:30:40,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 09:30:40,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:30:40,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 09:30:40,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 09:30:40,068 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:30:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:30:40,153 INFO L93 Difference]: Finished difference Result 233 states and 326 transitions. [2024-11-07 09:30:40,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 09:30:40,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2024-11-07 09:30:40,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:30:40,157 INFO L225 Difference]: With dead ends: 233 [2024-11-07 09:30:40,158 INFO L226 Difference]: Without dead ends: 139 [2024-11-07 09:30:40,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:30:40,159 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 41 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:30:40,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 167 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:30:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-07 09:30:40,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2024-11-07 09:30:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 91 states have internal predecessors, (109), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 09:30:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2024-11-07 09:30:40,197 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 88 [2024-11-07 09:30:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:30:40,198 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2024-11-07 09:30:40,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:30:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2024-11-07 09:30:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 09:30:40,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:30:40,202 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 1, 1, 1] [2024-11-07 09:30:40,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:30:40,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:30:40,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:30:40,202 INFO L85 PathProgramCache]: Analyzing trace with hash -755537303, now seen corresponding path program 1 times [2024-11-07 09:30:40,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:30:40,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196609443] [2024-11-07 09:30:40,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:30:40,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:30:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:30:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:30:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:30:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 09:30:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:30:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 09:30:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:30:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 09:30:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 09:30:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 09:30:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 09:30:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 09:30:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 09:30:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 09:30:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 09:30:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 09:30:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 09:30:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 09:30:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 09:30:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 09:30:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 09:30:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 09:30:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 09:30:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-07 09:30:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 09:30:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 09:30:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-11-07 09:30:41,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:30:41,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196609443] [2024-11-07 09:30:41,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196609443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:30:41,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:30:41,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 09:30:41,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929599478] [2024-11-07 09:30:41,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:30:41,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 09:30:41,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:30:41,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 09:30:41,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-07 09:30:41,081 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:30:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:30:41,426 INFO L93 Difference]: Finished difference Result 164 states and 220 transitions. [2024-11-07 09:30:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 09:30:41,426 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 173 [2024-11-07 09:30:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:30:41,427 INFO L225 Difference]: With dead ends: 164 [2024-11-07 09:30:41,428 INFO L226 Difference]: Without dead ends: 162 [2024-11-07 09:30:41,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-11-07 09:30:41,428 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 32 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:30:41,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 312 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:30:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-07 09:30:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 139. [2024-11-07 09:30:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 96 states have (on average 1.21875) internal successors, (117), 96 states have internal predecessors, (117), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 09:30:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 195 transitions. [2024-11-07 09:30:41,445 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 195 transitions. Word has length 173 [2024-11-07 09:30:41,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:30:41,447 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 195 transitions. [2024-11-07 09:30:41,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:30:41,447 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 195 transitions. [2024-11-07 09:30:41,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 09:30:41,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:30:41,450 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 1, 1, 1, 1, 1] [2024-11-07 09:30:41,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 09:30:41,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:30:41,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:30:41,451 INFO L85 PathProgramCache]: Analyzing trace with hash -753690261, now seen corresponding path program 1 times [2024-11-07 09:30:41,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:30:41,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129471070] [2024-11-07 09:30:41,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:30:41,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:30:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:30:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:30:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:30:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 09:30:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:30:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 09:30:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:30:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 09:30:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 09:30:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 09:30:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 09:30:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 09:30:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 09:30:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 09:30:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 09:30:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 09:30:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 09:30:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 09:30:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 09:30:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 09:30:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 09:30:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 09:30:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 09:30:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-07 09:30:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 09:30:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 09:30:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-11-07 09:30:42,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:30:42,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129471070] [2024-11-07 09:30:42,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129471070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:30:42,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:30:42,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 09:30:42,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462300661] [2024-11-07 09:30:42,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:30:42,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 09:30:42,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:30:42,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 09:30:42,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-07 09:30:42,330 INFO L87 Difference]: Start difference. First operand 139 states and 195 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:30:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:30:42,556 INFO L93 Difference]: Finished difference Result 149 states and 205 transitions. [2024-11-07 09:30:42,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 09:30:42,557 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 173 [2024-11-07 09:30:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:30:42,558 INFO L225 Difference]: With dead ends: 149 [2024-11-07 09:30:42,558 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 09:30:42,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-07 09:30:42,559 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 16 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:30:42,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 336 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:30:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 09:30:42,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2024-11-07 09:30:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 91 states have internal predecessors, (109), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 09:30:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2024-11-07 09:30:42,579 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 173 [2024-11-07 09:30:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:30:42,579 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2024-11-07 09:30:42,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:30:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2024-11-07 09:30:42,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 09:30:42,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:30:42,581 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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:30:42,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 09:30:42,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:30:42,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:30:42,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1109662877, now seen corresponding path program 1 times [2024-11-07 09:30:42,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:30:42,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703083193] [2024-11-07 09:30:42,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:30:42,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:30:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:30:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:30:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:30:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 09:30:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:30:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 09:30:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:30:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 09:30:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 09:30:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 09:30:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 09:30:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 09:30:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 09:30:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 09:30:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 09:30:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 09:30:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 09:30:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 09:30:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 09:30:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 09:30:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 09:30:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 09:30:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 09:30:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-07 09:30:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 09:30:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 09:30:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-11-07 09:30:43,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:30:43,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703083193] [2024-11-07 09:30:43,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703083193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:30:43,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:30:43,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 09:30:43,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188919674] [2024-11-07 09:30:43,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:30:43,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 09:30:43,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:30:43,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 09:30:43,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:30:43,281 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:30:43,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:30:43,440 INFO L93 Difference]: Finished difference Result 153 states and 207 transitions. [2024-11-07 09:30:43,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 09:30:43,441 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 174 [2024-11-07 09:30:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:30:43,443 INFO L225 Difference]: With dead ends: 153 [2024-11-07 09:30:43,443 INFO L226 Difference]: Without dead ends: 151 [2024-11-07 09:30:43,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-07 09:30:43,443 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 17 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:30:43,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 245 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:30:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-07 09:30:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 134. [2024-11-07 09:30:43,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 91 states have internal predecessors, (109), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 09:30:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2024-11-07 09:30:43,464 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 174 [2024-11-07 09:30:43,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:30:43,465 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2024-11-07 09:30:43,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:30:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2024-11-07 09:30:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 09:30:43,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:30:43,466 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 1, 1] [2024-11-07 09:30:43,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 09:30:43,467 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:30:43,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:30:43,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1107815835, now seen corresponding path program 1 times [2024-11-07 09:30:43,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:30:43,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962319782] [2024-11-07 09:30:43,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:30:43,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:30:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:30:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:30:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:30:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 09:30:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:30:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 09:30:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 09:30:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 09:30:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 09:30:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 09:30:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 09:30:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 09:30:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 09:30:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 09:30:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 09:30:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 09:30:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 09:30:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 09:30:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 09:30:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 09:30:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 09:30:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 09:30:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 09:30:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-07 09:30:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 09:30:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 09:30:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:30:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-11-07 09:30:44,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:30:44,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962319782] [2024-11-07 09:30:44,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962319782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:30:44,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:30:44,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 09:30:44,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722243552] [2024-11-07 09:30:44,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:30:44,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 09:30:44,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:30:44,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 09:30:44,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-07 09:30:44,082 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:30:44,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:30:44,255 INFO L93 Difference]: Finished difference Result 150 states and 206 transitions. [2024-11-07 09:30:44,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 09:30:44,256 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 174 [2024-11-07 09:30:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:30:44,257 INFO L225 Difference]: With dead ends: 150 [2024-11-07 09:30:44,257 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 09:30:44,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-07 09:30:44,258 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 22 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:30:44,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 367 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:30:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 09:30:44,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 09:30:44,258 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:30:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 09:30:44,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2024-11-07 09:30:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:30:44,258 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 09:30:44,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 09:30:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 09:30:44,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 09:30:44,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:30:44,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 09:30:44,265 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:30:44,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 09:30:44,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:30:44,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:30:44 BoogieIcfgContainer [2024-11-07 09:30:44,805 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:30:44,806 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:30:44,806 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:30:44,806 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:30:44,807 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:30:18" (3/4) ... [2024-11-07 09:30:44,808 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 09:30:44,812 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 09:30:44,815 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-07 09:30:44,816 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 09:30:44,816 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 09:30:44,816 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 09:30:44,875 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 09:30:44,875 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 09:30:44,875 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:30:44,876 INFO L158 Benchmark]: Toolchain (without parser) took 27243.83ms. Allocated memory was 117.4MB in the beginning and 931.1MB in the end (delta: 813.7MB). Free memory was 91.5MB in the beginning and 379.6MB in the end (delta: -288.1MB). Peak memory consumption was 524.8MB. Max. memory is 16.1GB. [2024-11-07 09:30:44,876 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:30:44,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.31ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 78.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:30:44,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.20ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 76.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:30:44,876 INFO L158 Benchmark]: Boogie Preprocessor took 48.32ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 72.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:30:44,877 INFO L158 Benchmark]: RCFGBuilder took 327.81ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 57.9MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 09:30:44,877 INFO L158 Benchmark]: TraceAbstraction took 26526.10ms. Allocated memory was 117.4MB in the beginning and 931.1MB in the end (delta: 813.7MB). Free memory was 57.4MB in the beginning and 384.1MB in the end (delta: -326.8MB). Peak memory consumption was 499.6MB. Max. memory is 16.1GB. [2024-11-07 09:30:44,877 INFO L158 Benchmark]: Witness Printer took 69.29ms. Allocated memory is still 931.1MB. Free memory was 384.1MB in the beginning and 379.6MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:30:44,878 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.21ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.31ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 78.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.20ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 76.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.32ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 72.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 327.81ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 57.9MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26526.10ms. Allocated memory was 117.4MB in the beginning and 931.1MB in the end (delta: 813.7MB). Free memory was 57.4MB in the beginning and 384.1MB in the end (delta: -326.8MB). Peak memory consumption was 499.6MB. Max. memory is 16.1GB. * Witness Printer took 69.29ms. Allocated memory is still 931.1MB. Free memory was 384.1MB in the beginning and 379.6MB in the end (delta: 4.6MB). 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, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.9s, OverallIterations: 7, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 218 mSDsluCounter, 1973 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1558 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 780 IncrementalHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 415 mSDtfsCounter, 780 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 373 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=4, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 95 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 950 ConstructedInterpolants, 0 QuantifiedInterpolants, 4406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 6262/6262 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: 94]: Loop Invariant Derived loop invariant: ((((((((var_1_10 == 0) && (0 <= last_1_var_1_10)) && (10 <= var_1_14)) && (0 <= 0)) && (last_1_var_1_10 <= 0)) && ((((short) var_1_14 + var_1_11) != 0) || (0 < (129 + var_1_11)))) && ((var_1_11 < 128) || (var_1_14 != var_1_11))) || (((var_1_14 == var_1_6) && (((32768 <= (((var_1_14 * 65535) + 16) % 65536)) && ((65536 + var_1_1) == (((var_1_14 * 65535) + 16) % 65536))) || (((((var_1_14 * 65535) + 16) % 65536) == var_1_1) && ((((var_1_14 * 65535) + 16) % 65536) <= 32767)))) && (((last_1_var_1_10 == 0) || (var_1_3 < last_1_var_1_6)) || (var_1_14 == var_1_16)))) - 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_3 == \old(var_1_3))) && (var_1_6 == \old(var_1_6))) && (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_16 == \old(var_1_16))) && (last_1_var_1_6 == \old(last_1_var_1_6))) && (last_1_var_1_10 == \old(last_1_var_1_10))) RESULT: Ultimate proved your program to be correct! [2024-11-07 09:30:44,916 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